From Wrapping to Knowledge

One the most challenging problems for Enterprise Information Integration is to deal with heterogeneous information sources on the Web. The reason is that they usually provide information that is in human-readable form only, which makes it difficult for a software agent to understand it. Current solutions build on the idea of annotating the information with semantics. If the information is unstructured, proposals such as S-CREAM, MnM, or Armadillo may be effective enough since they rely on using natural language processing techniques; furthermore, their accuracy can be improved by using redundant information on the Web, as C-PANKOW has proved recently. If the information is structured and closely related to a back-end database, Deep Annotation ranges among the most effective proposals, but it requires the information providers to modify their applications; if Deep Annotation is not applicable, the easiest solution consists of using a wrapper and transforming its output into annotations. In this paper, we prove that this transformation can be automated by means of an efficient, domain-independent algorithm. To the best of our knowledge, this is the first attempt to devise and formalize such a systematic, general solution.Comisión Interministerial de Ciencia y Tecnología TIC2003-02737-C02-0

Computing the elliptic genus of higher rank E-strings from genus 0 GW invariants

We show that the elliptic genus of the higher rank E-strings can be computed based solely on the genus 0 Gromov-Witten invariants of the corresponding elliptic geometry. To set up our computation, we study the structure of the topological string free energy on elliptically fibered Calabi-Yau manifolds both in the unrefined and the refined case, determining the maximal amount of the modular structure of the partition function that can be salvaged. In the case of fibrations exhibiting only isolated fibral curves, we show that the principal parts of the topological string partition function at given base-wrapping can be computed from the knowledge of the genus 0 Gromov-Witten invariants at this base-wrapping, and the partition function at lower base-wrappings. For the class of geometries leading to the higher rank E-strings, this leads to the result stated in the opening sentence.Comment: 40 page

Double-logs, Gribov-Lipatov reciprocity and wrapping

We study analytical properties of the five-loop anomalous dimension of twist-2 operators at negative even values of Lorentz spin. Following L. N. Lipatov and A. I. Onishchenko, we have found two possible generalizations of double-logarithmic equation, which allow to predict a lot of poles of anomalous dimension of twist-2 operators at all orders of perturbative theory from the known results. Second generalization is related with the reciprocity-respecting function, which is a single-logarithmic function in this case. We have found, that the knowledge of first orders of the reciprocity-respecting function gives all-loop predictions for the highest poles. Obtained predictions can be used for the reconstruction of a general form of the wrapping corrections for twist-2 operators.Comment: 17 pages, references adde

Protective wrapping of off-the-shelf components

System designers using off-the-shelf components (OTSCs), whose internals they cannot change, often use add-on “wrappers” to adapt the OTSCs’ behaviour as required. In most cases, wrappers are used to change “functional” properties of the components they wrap. In this paper we discuss instead protective wrapping, the use of wrappers to improve the dependability – i.e., “non-functional” properties like availability, reliability, security, and/or safety – of a component and thus of a system. Wrappers can improve dependability by adding fault tolerance, e.g. graceful degradation, or error recovery mechanisms. We discuss the rational specification of such protective wrappers in view of system dependability requirements, and highlight some of the design trade-offs and uncertainties that affect system design with OTSCs and wrappers, and that differentiate it from other forms of fault-tolerant design

Wrapping and unwrapping, concepts and approaches

No abstract available

Calibrations, Torsion Classes and Wrapped M-Branes

The present work has two goals. The first is to complete the classification of geometries in terms of torsion classes of M-branes wrapping cycles of a Calabi-Yau. The second goal is to give insight into the physical meaning of the torsion class constraints. We accomplish both tasks by defining new energy minimizing calibrations in M-brane backgrounds. When fluxes are turned on, it is these calibrations that are relevant, rather than those which had previously been defined in the context of purely geometric backgrounds

Percolation on two- and three-dimensional lattices

In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good results for the wrapping probabilities, correlation length critical exponent and critical concentration are obtained for the square, simple cubic, HCP and hexagonal lattices by using relatively small systems. We also confirm the universal aspect of the wrapping probabilities regarding site and bond dilution.Comment: 15 pages, 6 figures, 3 table

Chocolate Bar Wrapping Machine

Gilbert Chocolates has proposed to manufacture a machine to wrap chocolate bars. This machine is intended to replace two people wrapping the chocolate bars by hand, which is a time consuming method. This is especially apparent between October and January when the workers are working long hours in preparation for the Christmas rush of customers. Currently wrapping a bar takes about a minute and Gilbert Chocolates wants this time reduced down to 20-30 seconds. The budget for this project is set at $1000, and is being funded by the company. This machine needs to fit in a cubic foot of space and weigh under 30 pounds for storage purposes. This device can be either purely mechanical with manual input, or it may use step motors and a controller. This project pulls from our knowledge in kinematics, dynamics, 3D modeling, tolerance analysis, material selection, manufacturing techniques, and design of components. From doing this project we will learn how to apply all of these concepts together to solve real world problems. This project will encompass the design, manufacturing of a prototype, and optimization of the chocolate bar wrapping machine in hopes that the price of manufacturing chocolate bars can be reduced for Gilbert Chocolates. The final presentation of this project will include a working prototype, a report, and a presentation. The project will be presented at the Engineering Senior Design Project day. The machine will be operated and displayed at this event