2,629 research outputs found
Constraint and Integer Programming
No full textThe purpose of this introductory chapter is to provide the basic concepts
behind Constraint Programming CP and Integer Programming IP. These two
fields cover a variety of aspects and have been widely studied. Therefore,
here we do not intend to give a deep insight of the fields, but to provide
the definitions and concepts for understanding the rest of this book. We
explain CP and IP modelling aspects and solving strategies. We ground our
discussion on an example: the car sequencing problem. The chapter provides
references to relevant biography which can be referred to for a deeper
understanding
The Third Trick
No full textWe prove a result, similar to the ones known as Ishihara's First and Second
Trick, for sequences of functions
THE TRICK AND GAG AS THE BASIC BASIS OF ECCENTRIC MUSIC IN CLASSIC AND MODERN NUMBERS
No full textThe article explores the specifics of gag and trick in the genres of musical eccentrics and clownery as means of expression in the circus and variety. By establishing relationships and distinctive features between the trick and gag, the author discovers an innovative approach to the theoretical understanding of the clown genre and musical eccentrics.The problem of the relationship of main assets of expressiveness is considered separately in clowning and musical eccentric numbers, which gives the author the opportunity to identify discrepancies in the theoretical conclusions of Slavsky R. regarding the definition of the term "gag”. The article proves the failure of the substitution of the term gag for the term comic trick with reference to a musical eccentric.Keywords: trick classification, trick functions, dramatic gag, gag as a comic trick, walkthrough and storyline gages, basic and auxiliary means of expression, clown and musical eccentricity in the system of original circus genre
Trick Simulation Environment 07
No full textThe Trick Simulation Environment is a generic simulation toolkit used for constructing and running simulations. This release includes a Monte Carlo analysis simulation framework and a data analysis package. It produces all auto documentation in XML. Also, the software is capable of inserting a malfunction at any point during the simulation. Trick 07 adds variable server output options and error messaging and is capable of using and manipulating wide characters for international support. Wide character strings are available as a fundamental type for variables processed by Trick. A Trick Monte Carlo simulation uses a statistically generated, or predetermined, set of inputs to iteratively drive the simulation. Also, there is a framework in place for optimization and solution finding where developers may iteratively modify the inputs per run based on some analysis of the outputs. The data analysis package is capable of reading data from external simulation packages such as MATLAB and Octave, as well as the common comma-separated values (CSV) format used by Excel, without the use of external converters. The file formats for MATLAB and Octave were obtained from their documentation sets, and Trick maintains generic file readers for each format. XML tags store the fields in the Trick header comments. For header files, XML tags for structures and enumerations, and the members within are stored in the auto documentation. For source code files, XML tags for each function and the calling arguments are stored in the auto documentation. When a simulation is built, a top level XML file, which includes all of the header and source code XML auto documentation files, is created in the simulation directory. Trick 07 provides an XML to TeX converter. The converter reads in header and source code XML documentation files and converts the data to TeX labels and tables suitable for inclusion in TeX documents. A malfunction insertion capability allows users to override the value of any simulation variable, or call a malfunction job, at any time during the simulation. Users may specify conditions, use the return value of a malfunction trigger job, or manually activate a malfunction. The malfunction action may consist of executing a block of input file statements in an action block, setting simulation variable values, call a malfunction job, or turn on/off simulation jobs
Recommended from our members
Lost Relatives of the Gumbel Trick
No full textThe Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method re- lies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of related methods, of which the Gumbel trick is one member, and show that the new methods have superior properties in several settings with minimal additional computational cost. In particular, for the Gumbel trick to yield computational benefits for discrete graphical models, Gumbel perturbations on all configurations are typically replaced with so- called low-rank perturbations. We show how a subfamily of our new methods adapts to this set- ting, proving new upper and lower bounds on the log partition function and deriving a family of sequential samplers for the Gibbs distribution. Finally, we balance the discussion by showing how the simpler analytical form of the Gumbel trick enables additional theoretical results
The Whitney Trick
No full textThe Whitney Trick is a procedure by which submanifolds of a given manifold can, under certain conditions, be isotoped off each other by using an embedded 2-disc. It works well when the ambient manifold is of dimension five or greater. Here, a particularly simple example of its breakdown in dimension four is exhibited. © 1996, Published by Elsevier Science B.V. All rights reserved
Lost relatives of the Gumbel trick
No full textThe Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of related methods, of which the Gumbel trick is one member, and show that the new methods have superior properties in several settings with minimal additional computational cost. In particular, for the Gumbel trick to yield computational benefits for discrete graphical models, Gumbel perturbations on all configurations are typically replaced with socalled low-rank perturbations. We show how a subfamily of our new methods adapts to this setting, proving new upper and lower bounds on the log partition function and deriving a family of sequential samplers for the Gibbs distribution. Finally, we balance the discussion by showing how the simpler analytical form of the Gumbel trick enables additional theoretical results
Lost Relatives of the Gumbel Trick
No full textThe Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method re- lies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of related methods, of which the Gumbel trick is one member, and show that the new methods have superior properties in several settings with minimal additional computational cost. In particular, for the Gumbel trick to yield computational benefits for discrete graphical models, Gumbel perturbations on all configurations are typically replaced with so- called low-rank perturbations. We show how a subfamily of our new methods adapts to this set- ting, proving new upper and lower bounds on the log partition function and deriving a family of sequential samplers for the Gibbs distribution. Finally, we balance the discussion by showing how the simpler analytical form of the Gumbel trick enables additional theoretical results
A Trick Question: Are Early Animated Drawings a Film Genre or a Special Effect?
No full text By abandoning a linear understanding of film history, the author revisits animated film history by placing its emergence within the lineage of trick films. Analysis of discourses on the first animated cartoons — such as the critical and publicity discourses found in trade papers — reveals that these films were seen like any other trick films, not as a distinct type. How, then, can we explain the popularity of the first animated cartoons in the mid-1910s when trick films had almost disappeared? How can we account for the popularity of a variety of ‘trick films’ —animated drawings — precisely when these same trick films had almost ceased to exist? This article addresses these issues by looking at the process by which a major shift occurred in the way we look at the earliest animated drawings. More precisely, the author tries to outline the context of the transition from the perception that animated drawings were trick films to their eventual consecration as a genre within the institution. </jats:p
The Legendrian Whitney trick
No full textIn this article, we prove a Legendrian Whitney trick which allows for the removal of intersections between codimension-two contact submanifolds and Legendrian submanifolds, assuming such a smooth cancellation is possible. This technique is applied to show the existence h-principle for codimension-two contact embeddings with a prescribed contact structure
- …
