25,324 research outputs found

    CURRENT ISSUES IN FOOD DISTRIBUTION

    Get PDF
    The most serious problem in food distribution is productivity.Agribusiness,

    A review of multi-instance learning assumptions

    Get PDF
    Multi-instance (MI) learning is a variant of inductive machine learning, where each learning example contains a bag of instances instead of a single feature vector. The term commonly refers to the supervised setting, where each bag is associated with a label. This type of representation is a natural fit for a number of real-world learning scenarios, including drug activity prediction and image classification, hence many MI learning algorithms have been proposed. Any MI learning method must relate instances to bag-level class labels, but many types of relationships between instances and class labels are possible. Although all early work in MI learning assumes a specific MI concept class known to be appropriate for a drug activity prediction domain; this ‘standard MI assumption’ is not guaranteed to hold in other domains. Much of the recent work in MI learning has concentrated on a relaxed view of the MI problem, where the standard MI assumption is dropped, and alternative assumptions are considered instead. However, often it is not clearly stated what particular assumption is used and how it relates to other assumptions that have been proposed. In this paper, we aim to clarify the use of alternative MI assumptions by reviewing the work done in this area

    Elliptic Solutions of ABS Lattice Equations

    Full text link
    Elliptic N-soliton-type solutions, i.e. solutions emerging from the application of N consecutive B\"acklund transformations to an elliptic seed solution, are constructed for all equations in the ABS list of quadrilateral lattice equations, except for the case of the Q4 equation which is treated elsewhere. The main construction, which is based on an elliptic Cauchy matrix, is performed for the equation Q3, and by coalescence on certain auxiliary parameters, the corresponding solutions of the remaining equations in the list are obtained. Furthermore, the underlying linear structure of the equations is exhibited, leading, in particular, to a novel Lax representation of the Q3 equation.Comment: 42 pages, 3 diagram

    Exploiting Data Representation for Fault Tolerance

    Full text link
    We explore the link between data representation and soft errors in dot products. We present an analytic model for the absolute error introduced should a soft error corrupt a bit in an IEEE-754 floating-point number. We show how this finding relates to the fundamental linear algebra concepts of normalization and matrix equilibration. We present a case study illustrating that the probability of experiencing a large error in a dot product is minimized when both vectors are normalized. Furthermore, when data is normalized we show that the absolute error is less than one or very large, which allows us to detect large errors. We demonstrate how this finding can be used by instrumenting the GMRES iterative solver. We count all possible errors that can be introduced through faults in arithmetic in the computationally intensive orthogonalization phase, and show that when scaling is used the absolute error can be bounded above by one

    The Coherent Flame Model for Turbulent Chemical Reactions

    Get PDF
    A description of the turbulent diffusion flame is proposed in which the flame structure is composed of a distribution of laminar diffusion flame elements, whose thickness is small in comparison with the large eddies. These elements retain their identity during the flame development; they are strained in their own plane by the gas motion, a process that not only extends their surface area, but also establishes the rate at which a flame element consumes the reactants. Where this flame stretching process has produced a high flame surface density, the flame area per unit volume, adjacent flame elements may consume the intervening reactant, thereby annihilating both flame segments. This is the flame shortening mechanism which, in balance with the flame stretching process, establishes the local level of the flame density. The consumption rate of reactant is then given simply by the product of the local flame density and the reactang consumption rate per unit area of flame surface. The proposed description permits a rather complete separation of the turbulent flow structure, on one hand, and the flame structure, on the other, and in this manner permits the treatment of reactions with complex chemistry with a minimum of added labor. The structure of the strained laminar diffusion flame may be determined by analysis, numerical computation, and by experiment without significant change to the model

    Evaluating the Impact of SDC on the GMRES Iterative Solver

    Full text link
    Increasing parallelism and transistor density, along with increasingly tighter energy and peak power constraints, may force exposure of occasionally incorrect computation or storage to application codes. Silent data corruption (SDC) will likely be infrequent, yet one SDC suffices to make numerical algorithms like iterative linear solvers cease progress towards the correct answer. Thus, we focus on resilience of the iterative linear solver GMRES to a single transient SDC. We derive inexpensive checks to detect the effects of an SDC in GMRES that work for a more general SDC model than presuming a bit flip. Our experiments show that when GMRES is used as the inner solver of an inner-outer iteration, it can "run through" SDC of almost any magnitude in the computationally intensive orthogonalization phase. That is, it gets the right answer using faulty data without any required roll back. Those SDCs which it cannot run through, get caught by our detection scheme
    corecore