A common method for constructing blending Dupin cyclides for two cones having a common inscribed sphere of radius r > 0 involves three steps: (1) computing the (?r)-oosets of the cones so that they share a common vertex, (2) constructing a blending cyclide for the ooset cones, and (3) computing the r-ooset of the cyclide. Unfortunately , this process does not always work properly. Worse, for so...

The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to decompose the overall problem spatially into three domains: the crude-oil unloading and blending, the production-unit operations and the product blending and delivery. In particular, the first problem involves the crude...

A blobtree is an implicit surface defined by a tree of objects. Each node of the tree can either be a primitive or an operation. Primitives are skeletal implicit surfaces defined by a skeleton (like a point or a line) and a potential function which maps the distance to the primitive to R. Operations (like union, twist or blend) are nodes that work on one or more other nodes. Skeletal implicit s...

The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to decompose the overall problem spatially into three domains: the crude-oil unloading and blending, the production unit operations and the product blending and delivery. In particular, the first problem involves the crude...

Recent advances in generative adversarial networks (GANs) have shown promising potentials in conditional image generation. However, how to generate high-resolution images remains an open problem. In this paper, we aim at generating high-resolution well-blended images given composited copy-and-paste ones, i.e. realistic highresolution image blending. To achieve this goal, we propose Gaussian-Poi...

We propose ontological blending as a new method for ‘creatively’ combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating categories and relations of thematically closely related ontologies, blending aims at ‘creatively’ generating new categories and ontological definitions on the basis of input ontologies whose domains are thematically distinct ...

Using a Coons patch mapping to generate a structured grid in the parametric region of a trimmed surface can avoid the singularity of elliptic PDE methods when only C1 continuous boundary is given; the error of converting generic parametric C1 boundary curves into a specified representation form is also avoided. However, overlap may happen on some portions of the algebraically generated grid whe...

In this paper, we propose a fuzzy aggregate production planning (APP) model for blending problem in a brass factory which is the problem of computing optimal amounts of raw materials for the total production of several types of brass in a period. The model has deterministic and imprecise parameters which follows triangular possibility distributions. The brass casting APP model can not always be...

This paper presents a hybrid evolutionary algorithm to deal with the wheat blending problem. The unique constraints of this problem make many existing algorithms fail: either they do not generate acceptable results or they are not able to complete optimization within the required time. The proposed algorithm starts with a filtering process that follows predefined rules to reduce the search spac...

We know that misinformation presented in interrogating questions or in advertising produces blendings, that even imagining a possible episode might produce blending as well, however, we do not know whether reasoning and problem solving can produce the same effect. On the other hand, models of analogy-making assume “perfect memory” for old episodes. The AMBR model of analogical problem solving h...