451,631 research outputs found
Extruder for food product (otak–otak) with heater and roll cutter
Food extrusion is a form of extrusion used in food industries. It is a process by which a set of mixed ingredients are forced through an opening in a perforated plate or die with a design specific to the food, and is then cut to a specified size by blades [1]. Summary of the invention principal objects of the present invention are to provide a machine capable of continuously producing food products having an’ extruded filler material of meat or similarity and an extruded outer covering of a moldable food product, such as otak-otak, that completely envelopes the filler material
Variation In Greedy Approach To Set Covering Problem
The weighted set covering problem is to choose a number of subsets to cover all the elements in a universal set at the lowest cost. It is a well-studied classical problem with applications in various fields like machine learning, planning, information retrieval, facility allocation, etc. Deep web crawling refers to the process of gathering documents that have been structured into a data source and can be retrieved through a search interface. Its query selection process calls for an efficient solution to the set covering problem
Online Mixed Packing and Covering
In many problems, the inputs arrive over time, and must be dealt with
irrevocably when they arrive. Such problems are online problems. A common
method of solving online problems is to first solve the corresponding linear
program, and then round the fractional solution online to obtain an integral
solution.
We give algorithms for solving linear programs with mixed packing and
covering constraints online. We first consider mixed packing and covering
linear programs, where packing constraints are given offline and covering
constraints are received online. The objective is to minimize the maximum
multiplicative factor by which any packing constraint is violated, while
satisfying the covering constraints. No prior sublinear competitive algorithms
are known for this problem. We give the first such --- a
polylogarithmic-competitive algorithm for solving mixed packing and covering
linear programs online. We also show a nearly tight lower bound.
Our techniques for the upper bound use an exponential penalty function in
conjunction with multiplicative updates. While exponential penalty functions
are used previously to solve linear programs offline approximately, offline
algorithms know the constraints beforehand and can optimize greedily. In
contrast, when constraints arrive online, updates need to be more complex.
We apply our techniques to solve two online fixed-charge problems with
congestion. These problems are motivated by applications in machine scheduling
and facility location. The linear program for these problems is more
complicated than mixed packing and covering, and presents unique challenges. We
show that our techniques combined with a randomized rounding procedure give
polylogarithmic-competitive integral solutions. These problems generalize
online set-cover, for which there is a polylogarithmic lower bound. Hence, our
results are close to tight
Invariant Causal Set Covering Machines
Rule-based models, such as decision trees, appeal to practitioners due to
their interpretable nature. However, the learning algorithms that produce such
models are often vulnerable to spurious associations and thus, they are not
guaranteed to extract causally-relevant insights. In this work, we build on
ideas from the invariant causal prediction literature to propose Invariant
Causal Set Covering Machines, an extension of the classical Set Covering
Machine algorithm for conjunctions/disjunctions of binary-valued rules that
provably avoids spurious associations. We demonstrate both theoretically and
empirically that our method can identify the causal parents of a variable of
interest in polynomial time
Using machine learning to predict the number of alternative solutions to a minimum cardinality set covering problem
Although the characterization of alternative optimal solutions for linear programming problems is well known, such characterizations for combinatorial optimization problems are essentially non-existent. This is the first article to qualitatively predict the number of alternative optima for a classic NP-hard combinatorial optimization problem, namely, the minimum cardinality (also called unicost) set covering problem (MCSCP). For the MCSCP, a set must be covered by a minimum number of subsets selected from a specified collection of subsets of the given set. The MCSCP has numerous industrial applications that require that a secondary objective is optimized once the size of a minimum cover has been determined. To optimize the secondary objective, the number of MCSCP solutions is optimized. In this article, for the first time, a machine learning methodology is presented to generate categorical regression trees to predict, qualitatively (extra-small, small, medium, large, or extra-large), the number of solutions to an MCSCP. Within the machine learning toolbox of MATLAB®, 600,000 unique random MCSCPs were generated and used to construct regression trees. The prediction quality of these regression trees was tested on 5000 different MCSCPs. For the 5-output model, the average accuracy of being at most one off from the predicted category was 94.2%.Â
- …