formula results from the CPAN

lib/Algorithm/NaiveBayes.pm view on Meta::CPAN

                   cat in cats          P(words)


Since C<P(words)> doesn't change over the range of categories, we can get rid
of it.  That's good, because we didn't want to have to compute these values
anyway.  So our new formula is:

  Best category =   ArgMax      P(words | cat) P(cat)
                   cat in cats

Finally, we note that if C<w1, w2, ... wn> are the words in the document,
then this expression is equivalent to:

  Best category =   ArgMax      P(w1|cat)*P(w2|cat)*...*P(wn|cat)*P(cat)
                   cat in cats

That's the formula I use in my document categorization code.  The last
step is the only non-rigorous one in the derivation, and this is the
"naive" part of the Naive Bayes technique.  It assumes that the
probability of each word appearing in a document is unaffected by the
presence or absence of each other word in the document.  We assume
this even though we know this isn't true: for example, the word

view all matches for this distribution

Algorithm-SAT-Backtracking

3 results

lib/Algorithm/SAT/Backtracking.pm view on Meta::CPAN


=head1 DESCRIPTION

Algorithm::SAT::Backtracking is a pure Perl implementation of a simple SAT Backtracking solver.

In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as I<SATISFIABILITY> or I<SAT>) is the problem of determining if there exists an interpretation that satisfies a given Bool...

For example, the formula "a AND NOT b" is satisfiable because one can find the values a = B<TRUE> and b = B<FALSE>, which make (a AND NOT b) = TRUE. In contrast, "a AND NOT a" is unsatisfiable. More: L<https://en.wikipedia.org/wiki/Boolean_satisfiabi...

Have a look also at the tests file for an example of usage.

L<Algorithm::SAT::Expression> use this module to solve Boolean expressions.

view all matches for this distribution

Algorithm-SVM

1 match

libsvm.cpp view on Meta::CPAN

	si->r = (r1+r2)/2;
	return (r1-r2)/2;
}

//
// Q matrices for various formulations
//
class SVC_Q: public Kernel
{ 
public:
	SVC_Q(const svm_problem& prob, const svm_parameter& param, const schar *y_)

libsvm.cpp view on Meta::CPAN

	Qfloat *buffer[2];
	Qfloat *QD;
};

//
// construct and solve various formulations
//
static void solve_c_svc(
	const svm_problem *prob, const svm_parameter* param,
	double *alpha, Solver::SolutionInfo* si, double Cp, double Cn)
{

view all matches for this distribution

Algorithm-Simplex

3 results

lib/Algorithm/Simplex.pm view on Meta::CPAN


Algorithm::Simplex - Simplex Algorithm Implementation using Tucker Tableaux

=head1 Synopsis

Given a linear program formulated as a Tucker tableau, a 2D matrix or 
ArrayRef[ArrayRef] in Perl, seek an optimal solution.

    use Algorithm::Simplex::Rational;
    my $matrix = [
        [ 5,  2,  30],

view all matches for this distribution

Algorithm-SkipList

1 match

lib/Algorithm/SkipList.pm view on Meta::CPAN

  } else {
    $self->{MAXLEVEL};
  }
}

# We use the formula from Pugh's "Skip List Cookbook" paper.  We
# generate a reverse-sorted array of values based on p and k.  In
# _new_node_level() we look for the highest value in the array that is
# less than a random number n (0<n<1).

sub _build_distribution {

view all matches for this distribution

Algorithm-VSM

1 match

lib/Algorithm/VSM.pm view on Meta::CPAN


=head1 CHANGES

Version 1.70: All of the changes made in this version affect only that part of the
module that is used for calculating precision-vs.-recall curve for the estimation of
MAP (Mean Average Precision).  The new formulas that go into estimating MAP are
presented in the author's tutorial on significance testing.  Additionally, when
estimating the average retrieval precision for a query, this version explicitly
disregards all documents that have zero similarity with the query.

Version 1.62 removes the Perl version restriction on the module. This version also

lib/Algorithm/VSM.pm view on Meta::CPAN

the user.  The similarity matrix is output as a CSV file.

Version 1.3 incorporates IDF (Inverse Document Frequency) weighting of the words in a
document file. What that means is that the words that appear in most of the documents
get reduced weighting since such words are non-discriminatory with respect to the
retrieval of the documents. A typical formula that is used to calculate the IDF
weight for a word is the logarithm of the ratio of the total number of documents to
the number of documents in which the word appears.  So if a word were to appear in
all the documents, its IDF multiplier would be zero in the vector representation of a
document.  If so desired, you can turn off the IDF weighting of the words by
explicitly setting the constructor parameter C<use_idf_filter> to zero.

view all matches for this distribution

Algorithm-WordLevelStatistics

1 match

SPACE AND TIME IN CLASSICAL MECHANICS


The purpose of mechanics is to describe how bodies change their
position in space with "time." I should load my conscience with grave
sins against the sacred spirit of lucidity were I to formulate the
aims of mechanics in this way, without serious reflection and detailed
explanations. Let us proceed to disclose these sins.

It is not clear what is to be understood here by "position" and
"space." I stand at the window of a railway carriage which is

return later. If the principle of relativity (in the restricted sense)
does not hold, then the Galileian co-ordinate systems K, K1, K2, etc.,
which are moving uniformly relative to each other, will not be
equivalent for the description of natural phenomena. In this case we
should be constrained to believe that natural laws are capable of
being formulated in a particularly simple manner, and of course only
on condition that, from amongst all possible Galileian co-ordinate
systems, we should have chosen one (K[0]) of a particular state of
motion as our body of reference. We should then be justified (because
of its merits for the description of natural phenomena) in calling
this system " absolutely at rest," and all other Galileian systems K "
in motion." If, for instance, our embankment were the system K[0] then
our railway carriage would be a system K, relative to which less
simple laws would hold than with respect to K[0]. This diminished
simplicity would be due to the fact that the carriage K would be in
motion (i.e."really")with respect to K[0]. In the general laws of
nature which have been formulated with reference to K, the magnitude
and direction of the velocity of the carriage would necessarily play a
part. We should expect, for instance, that the note emitted by an
organpipe placed with its axis parallel to the direction of travel
would be different from that emitted if the axis of the pipe were
placed perpendicular to this direction.

time by corresponding values x1, y1, z1, t1, which of course are not
identical with x, y, z, t. It has already been set forth in detail how
these magnitudes are to be regarded as results of physical
measurements.

Obviously our problem can be exactly formulated in the following
manner. What are the values x1, y1, z1, t1, of an event with respect
to K1, when the magnitudes x, y, z, t, of the same event with respect
to K are given ? The relations must be so chosen that the law of the
transmission of light in vacuo is satisfied for one and the same ray
of light (and of course for every ray) with respect to K and K1. For

Galilei transformation or the Lorentz transformation corresponds to
the facts. Experiment * decides in favour of equation (B) derived
from the theory of relativity, and the agreement is, indeed, very
exact. According to recent and most excellent measurements by Zeeman,
the influence of the velocity of flow v on the propagation of light is
represented by formula (B) to within one per cent.

Nevertheless we must now draw attention to the fact that a theory of
this phenomenon was given by H. A. Lorentz long before the statement
of the theory of relativity. This theory was of a purely
electrodynamical nature, and was obtained by the use of particular


The principle we have made use of not only maintains that we may
equally well choose the carriage or the embankment as our
reference-body for the description of any event (for this, too, is
self-evident). Our principle rather asserts what follows : If we
formulate the general laws of nature as they are obtained from
experience, by making use of

(a) the embankment as reference-body,
(b) the railway carriage as reference-body,

motion" and " reference-body " and derivable from them; only
experience can decide as to its correctness or incorrectness.

Up to the present, however, we have by no means maintained the
equivalence of all bodies of reference K in connection with the
formulation of natural laws. Our course was more on the following
Iines. In the first place, we started out from the assumption that
there exists a reference-body K, whose condition of motion is such
that the Galileian law holds with respect to it : A particle left to
itself and sufficiently far removed from all other particles moves
uniformly in a straight line. With reference to K (Galileian
reference-body) the laws of nature were to be as simple as possible.
But in addition to K, all bodies of reference K1 should be given
preference in this sense, and they should be exactly equivalent to K
for the formulation of natural laws, provided that they are in a state
of uniform rectilinear and non-rotary motion with respect to K ; all
these bodies of reference are to be regarded as Galileian
reference-bodies. The validity of the principle of relativity was
assumed only for these reference-bodies, but not for others (e.g.
those possessing motion of a different kind). In this sense we speak

relativity.

In contrast to this we wish to understand by the "general principle of
relativity" the following statement : All bodies of reference K, K1,
etc., are equivalent for the description of natural phenomena
(formulation of the general laws of nature), whatever may be their
state of motion. But before proceeding farther, it ought to be pointed
out that this formulation must be replaced later by a more abstract
one, for reasons which will become evident at a later stage.

Since the introduction of the special principle of relativity has been
justified, every intellect which strives after generalisation must
feel the temptation to venture the step towards the general principle

THE GRAVITATIONAL FIELD


"If we pick up a stone and then let it go, why does it fall to the
ground ?" The usual answer to this question is: "Because it is
attracted by the earth." Modern physics formulates the answer rather
differently for the following reason. As a result of the more careful
study of electromagnetic phenomena, we have come to regard action at a
distance as a process impossible without the intervention of some
intermediary medium. If, for instance, a magnet attracts a piece of
iron, we cannot be content to regard this as meaning that the magnet

the effect of a gravitational field. Nevertheless, the
space-distribution of this gravitational field is of a kind that would
not be possible on Newton's theory of gravitation.* But since the
observer believes in the general theory of relativity, this does not
disturb him; he is quite in the right when he believes that a general
law of gravitation can be formulated- a law which not only explains
the motion of the stars correctly, but also the field of force
experienced by himself.

The observer performs experiments on his circular disc with clocks and
measuring-rods. In doing so, it is his intention to arrive at exact

way. With every point of the continuum, we associate arbitrarily four
numbers, x[1], x[2], x[3], x[4], which are known as " co-ordinates."
Adjacent points correspond to adjacent values of the coordinates. If a
distance ds is associated with the adjacent points P and P1, this
distance being measurable and well defined from a physical point of
view, then the following formula holds:

ds2 = g[11]dx[1]^2 + 2g[12]dx[1]dx[2] . . . . g[44]dx[4]^2,

where the magnitudes g[11], etc., have values which vary with the
position in the continuum. Only when the continuum is a Euclidean one


THE SPACE-TIME CONTINUUM OF THE SPEICAL THEORY OF RELATIVITY CONSIDERED AS A
EUCLIDEAN CONTINUUM


We are now in a position to formulate more exactly the idea of
Minkowski, which was only vaguely indicated in Section 17. In
accordance with the special theory of relativity, certain co-ordinate
systems are given preference for the description of the
four-dimensional, space-time continuum. We called these " Galileian
co-ordinate systems." For these systems, the four co-ordinates x, y,



EXACT FORMULATION OF THE GENERAL PRINCIPLE OF RELATIVITY


We are now in a position to replace the pro. visional formulation of
the general principle of relativity given in Section 18 by an exact
formulation. The form there used, "All bodies of reference K, K1,
etc., are equivalent for the description of natural phenomena
(formulation of the general laws of nature), whatever may be their
state of motion," cannot be maintained, because the use of rigid
reference-bodies, in the sense of the method followed in the special
theory of relativity, is in general not possible in space-time
description. The Gauss co-ordinate system has to take the place of the
body of reference. The following statement corresponds to the
fundamental idea of the general principle of relativity: "All Gaussian
co-ordinate systems are essentially equivalent for the formulation of
the general laws of nature."

We can state this general principle of relativity in still another
form, which renders it yet more clearly intelligible than it is when
in the form of the natural extension of the special principle of

space co-ordinates as opposed to the time co-ordinate. Every point on
the mollusc is treated as a space-point, and every material point
which is at rest relatively to it as at rest, so long as the mollusc
is considered as reference-body. The general principle of relativity
requires that all these molluscs can be used as reference-bodies with
equal right and equal success in the formulation of the general laws
of nature; the laws themselves must be quite independent of the choice
of mollusc.

The great power possessed by the general principle of relativity lies
in the comprehensive limitation which is imposed on the laws of nature

transformation of co-ordinates.

The next step is to investigate the space-time behaviour of the
gravitational field G, which was derived from the Galileian special
case simply by transformation of the coordinates. This behaviour is
formulated in a law, which is always valid, no matter how the
reference-body (mollusc) used in the description may be chosen.

This law is not yet the general law of the gravitational field, since
the gravitational field under consideration is of a special kind. In
order to find out the general law-of-field of gravitation we still


                 x - ct = 0     .     .     .    (1).

Since the same light-signal has to be transmitted relative to K1 with
the velocity c, the propagation relative to the system K1 will be
represented by the analogous formula

                x' - ct' = O     .     .     .    (2)

Those space-time points (events) which satisfy (x) must also satisfy
(2). Obviously this will be the case when the relation

          x2 + y2 + z2 = c^2t2 = 0    .     .     .    (10).

It is required by the law of propagation of light, in conjunction with
the postulate of relativity, that the transmission of the signal in
question should take place -- as judged from K1 -- in accordance with
the corresponding formula

                               r' = ct'

or,

view all matches for this distribution

Alien-FreeImage

15 results

src/Source/FreeImage/WuQuantizer.cpp view on Meta::CPAN

}

// We want to minimize the sum of the variances of two subboxes.
// The sum(c^2) terms can be ignored since their sum over both subboxes
// is the same (the sum for the whole box) no matter where we split.
// The remaining terms have a minus sign in the variance formula,
// so we drop the minus sign and MAXIMIZE the sum of the two terms.

float
WuQuantizer::Maximize(Box *cube, BYTE dir, int first, int last , int *cut, LONG whole_r, LONG whole_g, LONG whole_b, LONG whole_w) {
	LONG half_r, half_g, half_b, half_w;

view all matches for this distribution

Alien-GvaScript

2 results

MANIFEST view on Meta::CPAN

lib/Alien/GvaScript/lib/btn_sprite.gif
lib/Alien/GvaScript/lib/delete.png
lib/Alien/GvaScript/lib/dot.gif
lib/Alien/GvaScript/lib/GvaScript.css
lib/Alien/GvaScript/lib/GvaScript.js
lib/Alien/GvaScript/lib/images/formulaire/ajax_loading.gif
lib/Alien/GvaScript/lib/images/paginator/bg.gif
lib/Alien/GvaScript/lib/images/paginator/glass-bg-n-2.gif
lib/Alien/GvaScript/lib/images/paginator/glass-bg-n.gif
lib/Alien/GvaScript/lib/images/paginator/glass-bg.gif
lib/Alien/GvaScript/lib/images/paginator/page-first.gif

view all matches for this distribution

Alien-Prototype

1 match

prototype.js view on Meta::CPAN

      },
      'only-of-type':   function(m) {
        var p = Selector.xpath.pseudos; return p['first-of-type'](m) + p['last-of-type'](m);
      },
      nth: function(fragment, m) {
        var mm, formula = m[6], predicate;
        if (formula == 'even') formula = '2n+0';
        if (formula == 'odd')  formula = '2n+1';
        if (mm = formula.match(/^(\d+)$/)) // digit only
          return '[' + fragment + "= " + mm[1] + ']';
        if (mm = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
          if (mm[1] == "-") mm[1] = -1;
          var a = mm[1] ? Number(mm[1]) : 1;
          var b = mm[2] ? Number(mm[2]) : 0;
          predicate = "[((#{fragment} - #{b}) mod #{a} = 0) and " +
          "((#{fragment} - #{b}) div #{a} >= 0)]";

prototype.js view on Meta::CPAN

      for (var i = 0, results = [], node; node = nodes[i]; i++)
        if (!h.previousElementSibling(node) && !h.nextElementSibling(node))
          results.push(node);
      return results;
    },
    'nth-child':        function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root);
    },
    'nth-last-child':   function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true);
    },
    'nth-of-type':      function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, false, true);
    },
    'nth-last-of-type': function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true, true);
    },
    'first-of-type':    function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, false, true);
    },
    'last-of-type':     function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, true, true);
    },
    'only-of-type':     function(nodes, formula, root) {
      var p = Selector.pseudos;
      return p['last-of-type'](p['first-of-type'](nodes, formula, root), formula, root);
    },

    // handles the an+b logic
    getIndices: function(a, b, total) {
      if (a == 0) return b > 0 ? [b] : [];

prototype.js view on Meta::CPAN

        return memo;
      });
    },

    // handles nth(-last)-child, nth(-last)-of-type, and (first|last)-of-type
    nth: function(nodes, formula, root, reverse, ofType) {
      if (nodes.length == 0) return [];
      if (formula == 'even') formula = '2n+0';
      if (formula == 'odd')  formula = '2n+1';
      var h = Selector.handlers, results = [], indexed = [], m;
      h.mark(nodes);
      for (var i = 0, node; node = nodes[i]; i++) {
        if (!node.parentNode._counted) {
          h.index(node.parentNode, reverse, ofType);
          indexed.push(node.parentNode);
        }
      }
      if (formula.match(/^\d+$/)) { // just a number
        formula = Number(formula);
        for (var i = 0, node; node = nodes[i]; i++)
          if (node.nodeIndex == formula) results.push(node);
      } else if (m = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
        if (m[1] == "-") m[1] = -1;
        var a = m[1] ? Number(m[1]) : 1;
        var b = m[2] ? Number(m[2]) : 0;
        var indices = Selector.pseudos.getIndices(a, b, nodes.length);
        for (var i = 0, node, l = indices.length; node = nodes[i]; i++) {

view all matches for this distribution

Alien-SVN

3 results

src/subversion/doc/doxygen.conf view on Meta::CPAN

# doxygen to be busy swapping symbols to and from disk most of the time
# causing a significant performance penality.
# If the system has enough physical memory increasing the cache will improve the
# performance by keeping more symbols in memory. Note that the value works on
# a logarithmic scale so increasing the size by one will rougly double the
# memory usage. The cache size is given by this formula:
# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
# corresponding to a cache size of 2^16 = 65536 symbols

SYMBOL_CACHE_SIZE      = 0

src/subversion/doc/doxygen.conf view on Meta::CPAN

# used to set the initial width (in pixels) of the frame in which the tree
# is shown.

TREEVIEW_WIDTH         = 250

# Use this tag to change the font size of Latex formulas included
# as images in the HTML documentation. The default is 10. Note that
# when you change the font size after a successful doxygen run you need
# to manually remove any form_*.png images from the HTML output directory
# to force them to be regenerated.

src/subversion/doc/doxygen.conf view on Meta::CPAN

USE_PDFLATEX           = NO

# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
# command to the generated LaTeX files. This will instruct LaTeX to keep
# running if errors occur, instead of asking the user for help.
# This option is also used when generating formulas in HTML.

LATEX_BATCHMODE        = NO

# If LATEX_HIDE_INDICES is set to YES then doxygen will not
# include the index chapters (such as File Index, Compound Index, etc.)

view all matches for this distribution

Alien-Web-ExtJS-V3

1 match

share/docs/extjs/ext-all.js view on Meta::CPAN


--

This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT OF THIRD-PARTY INTELLECTUAL PROPERTY RIGHTS.  See t...
*/
var Ext=Ext||{};Ext._startTime=new Date().getTime();(function(){var h=this,a=Object.prototype,j=a.toString,b=true,g={toString:1},e=function(){},d=function(){var i=d.caller.caller;return i.$owner.prototype[i.$name].apply(this,arguments)},c;Ext.global=...

view all matches for this distribution

Alien-XGBoost

4 results

# doxygen to be busy swapping symbols to and from disk most of the time
# causing a significant performance penalty.
# If the system has enough physical memory increasing the cache will improve the
# performance by keeping more symbols in memory. Note that the value works on
# a logarithmic scale so increasing the size by one will roughly double the
# memory usage. The cache size is given by this formula:
# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
# corresponding to a cache size of 2^16 = 65536 symbols.

SYMBOL_CACHE_SIZE      = 0

# set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given
# their name and scope. Since this can be an expensive process and often the
# same symbol appear multiple times in the code, doxygen keeps a cache of
# pre-resolved symbols. If the cache is too small doxygen will become slower.
# If the cache is too large, memory is wasted. The cache size is given by this
# formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0,
# corresponding to a cache size of 2^16 = 65536 symbols.

LOOKUP_CACHE_SIZE      = 0

#---------------------------------------------------------------------------

# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open
# links to external symbols imported via tag files in a separate window.

EXT_LINKS_IN_WINDOW    = NO

# Use this tag to change the font size of Latex formulas included
# as images in the HTML documentation. The default is 10. Note that
# when you change the font size after a successful doxygen run you need
# to manually remove any form_*.png images from the HTML output directory
# to force them to be regenerated.

FORMULA_FONTSIZE       = 10

# Use the FORMULA_TRANPARENT tag to determine whether or not the images
# generated for formulas are transparent PNGs. Transparent PNGs are
# not supported properly for IE 6.0, but are supported on all modern browsers.
# Note that when changing this option you need to delete any form_*.png files
# in the HTML output before the changes have effect.

FORMULA_TRANSPARENT    = YES

# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax
# (see http://www.mathjax.org) which uses client side Javascript for the
# rendering instead of using prerendered bitmaps. Use this if you do not
# have LaTeX installed or if you want to formulas look prettier in the HTML
# output. When enabled you also need to install MathJax separately and
# configure the path to it using the MATHJAX_RELPATH option.

USE_MATHJAX            = NO

LATEX_OUTPUT           = latex

# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
# invoked. If left blank `latex' will be used as the default command name.
# Note that when enabling USE_PDFLATEX this option is only used for
# generating bitmaps for formulas in the HTML output, but not in the
# Makefile that is written to the output directory.

LATEX_CMD_NAME         = latex

# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to

USE_PDFLATEX           = YES

# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
# command to the generated LaTeX files. This will instruct LaTeX to keep
# running if errors occur, instead of asking the user for help.
# This option is also used when generating formulas in HTML.

LATEX_BATCHMODE        = NO

# If LATEX_HIDE_INDICES is set to YES then doxygen will not
# include the index chapters (such as File Index, Compound Index, etc.)

view all matches for this distribution

Alien-boost-mini

1 match

include/boost/config/auto_link.hpp view on Meta::CPAN

Algorithm:
~~~~~~~~~~

Libraries for Borland and Microsoft compilers are automatically
selected here, the name of the lib is selected according to the following
formula:

BOOST_LIB_PREFIX
   + BOOST_LIB_NAME
   + "_"
   + BOOST_LIB_TOOLSET

view all matches for this distribution

Alien-cares

1 match

libcares/test/gmock-1.8.0/gmock-gtest-all.cc view on Meta::CPAN

}

// Formats a countable noun.  Depending on its quantity, either the
// singular form or the plural form is used. e.g.
//
// FormatCountableNoun(1, "formula", "formuli") returns "1 formula".
// FormatCountableNoun(5, "book", "books") returns "5 books".
static std::string FormatCountableNoun(int count,
                                       const char * singular_form,
                                       const char * plural_form) {
  return internal::StreamableToString(count) + " " +

view all matches for this distribution

Alien-libsecp256k1

13 results

libsecp256k1/README.md view on Meta::CPAN

  * Optimized implementation without data-dependent branches of arithmetic modulo the curve's order.
    * Using 4 64-bit limbs (relying on __int128 support in the compiler).
    * Using 8 32-bit limbs.
* Modular inverses (both field elements and scalars) based on [safegcd](https://gcd.cr.yp.to/index.html) with some modifications, and a variable-time variant (by Peter Dettman).
* Group operations
  * Point addition formula specifically simplified for the curve equation (y^2 = x^3 + 7).
  * Use addition between points in Jacobian and affine coordinates where possible.
  * Use a unified addition/doubling formula where necessary to avoid data-dependent branches.
  * Point/x comparison without a field inversion by comparison in the Jacobian coordinate space.
* Point multiplication for verification (a*P + b*G).
  * Use wNAF notation for point multiplicands.
  * Use a much larger window for multiples of G, using precomputed multiples.
  * Use Shamir's trick to do the multiplication with the public key and the generator simultaneously.

view all matches for this distribution

Alt-CWB-ambs

1 match

lib/CWB/CEQL/Parser.pm view on Meta::CPAN

=head2 The shift-reduce parser for nested bracketing

The B<Apply> method is more than a convenient shorthand for parsing lists of
constituents.  Its main purpose is to parse nested bracketing structures,
which are very common in the syntax of formal languages (examples include
arithmetical formulae, regular expressions and most computer programming
languages).  When parsing the constituents of a list with nested bracketing,
two special methods, B<BeginGroup> and B<EndGroup>, are called to mark opening
and closing delimiters.  Proper nesting will then automatically be verified by
the DPP parser.  If the syntax allows different types of groups to be mixed,
optional names can be passed to the B<BeginGroup> and B<EndGroup> calls in

view all matches for this distribution

Amethyst

6 results

factpacks/Linux.fact view on Meta::CPAN

ezmlm => <reply> $who, Easy-to-use, high-speed mailing list manager for qmail. URL: ftp://koobera.math.uic.edu/www/ezmlm.html
eznet => <reply> $who, Very simple PPP setup. URL: http://www.hwaci.com/sw/eznet/
EzRPM => <reply> $who, RPM dependency checker and installer. URL: http://www.linuxstart.com/~igloo/ezrpm/ezrpm-1.2.tar.gz
F => <reply> $who, Lightweight file browser for GNOME.. URL: http://www.maybe.net/f/
F-CULT => <reply> $who, File Collector's Universal Listing Tool. URL: http://www.mbnet.fi/~laurijh/
f/Calc => <reply> $who, Calculate several different photographic formulae.. URL: http://www.cyberport.com/~tangent/photo/fcalc/
fact => <reply> $who, An automated system for managing small snippets of information.. URL: http://projects.ticons.com.au/fact/
failoverd => <reply> $who, Provide rudimentary failover capability for Linux. URL: http://ps-ax.com/failoverd/
FAIM => <reply> $who, An open source client for America Online's Instant Messenger service. URL: http://www.auk.cx/faim/
Fake => <reply> $who, Utility to switch in backup servers on a LAN. URL: http://vergenet.net/linux/fake/
fake identd => <reply> $who, Robust non-forking standalone fake ident daemon. URL: http://iki.fi/too/sw/identd.readme

factpacks/Linux.fact view on Meta::CPAN

TrueReality => <reply> $who, N64 Emulator. URL: http://www.emuhq.com/truereality/
Truth VSA => <reply> $who, Open Source Lie Detection. URL: http://www.accessone.com/~rivero/POLITICS/VSA/truthvsa.html
TSambaClass => <reply> $who, Cross platform C++ class library for accessing smb.conf file.. URL: http://www.spanware.com/
tsbiff => <reply> $who, Tsbiff will oversee your mailbox and notify you when new messages appears. URL: http://www.tildeslash.com/tsbiff/
Tsinvest => <reply> $who, Quantitative financial analysis of equities.. URL: http://www2.inow.com/~conover/ntropix/
TSpaces => <reply> $who, Allows heterogeneous, Java-enabled devices to exchange data. URL: http://www.alphaworks.ibm.com/formula/
tsync => <reply> $who, A Perl scipt for synchronising the system time with a remote server.. URL: http://www.hibernaculum.demon.co.uk/
TT-News => <reply> $who, A headline-news ticker for various news-sources.. URL: http://www.student.lu.se/~etn97ksi/sim_home/
TTC => <reply> $who, Controls login on ttys. URL: http://poseidon.pspt.fi/~priikone/english/programs.shtml
TTdb => <reply> $who, Simple database API written entirely in /bin/sh. URL: http://www.tinaa.com/TTdb/index.html
TThread => <reply> $who, A Cross-platfrom Threading library.. URL: http://www.cs.wisc.edu/~stanis/tthread.html

view all matches for this distribution

Amibroker-OLE-Interface

1 match

lib/Amibroker/OLE/Interface.pm view on Meta::CPAN

You can run various analysis based on the action supplied.
But before that you need to pass APX file, 

APX file is an important file to Amibroker engine. It is like the rule book to the amibroker.
The analysis project file (.apx extension) is human-readable self-explanatory XML-format file that can be written/edited/modified from any language / any text editor. 
APX file includes all settings and formula needed in single file that is required to run analysis. 
APX file instructs what the amibroker engine has to do.

NOTE: Be very careful in creating the apx file.

You can either manually create the apx file or by automatically by a script.

view all matches for this distribution

Amon2

1 match

lib/Amon2/Setup/Asset/Bootstrap.pm view on Meta::CPAN

  "bootstrap/carousel.js" => "/*!\n  * Bootstrap carousel.js v4.4.1 (https://getbootstrap.com/)\n  * Copyright 2011-2019 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)\n  * Licensed under MIT (https://github.com/twbs/bo...
  "bootstrap/carousel.js.map" => "{\"version\":3,\"file\":\"carousel.js\",\"sources\":[\"../src/carousel.js\"],\"sourcesContent\":[\"/**\\n * --------------------------------------------------------------------------\\n * Bootstrap (v4.4.1): carousel...
  "bootstrap/collapse.js" => "/*!\n  * Bootstrap collapse.js v4.4.1 (https://getbootstrap.com/)\n  * Copyright 2011-2019 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)\n  * Licensed under MIT (https://github.com/twbs/bo...
  "bootstrap/collapse.js.map" => "{\"version\":3,\"file\":\"collapse.js\",\"sources\":[\"../src/collapse.js\"],\"sourcesContent\":[\"/**\\n * --------------------------------------------------------------------------\\n * Bootstrap (v4.4.1): collapse...
  "bootstrap/css/bootstrap-grid.css" => "/*!\n * Bootstrap Grid v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/mast...
  "bootstrap/css/bootstrap-grid.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap-grid.scss\",\"bootstrap-grid.css\",\"../../scss/_grid.scss\",\"../../scss/mixins/_grid.scss\",\"../../scss/mixins/_breakpoints.scss\",\"../../scss/_variab...
  "bootstrap/css/bootstrap-grid.min.css" => "/*!\n * Bootstrap Grid v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/...
  "bootstrap/css/bootstrap-grid.min.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap-grid.scss\",\"dist/css/bootstrap-grid.css\",\"../../scss/_grid.scss\",\"../../scss/mixins/_grid.scss\",\"../../scss/mixins/_breakpoints.scss\",\"../.....
  "bootstrap/css/bootstrap-reboot.css" => "/*!\n * Bootstrap Reboot v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/...
  "bootstrap/css/bootstrap-reboot.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap-reboot.scss\",\"bootstrap-reboot.css\",\"../../scss/_reboot.scss\",\"../../scss/_variables.scss\",\"../../scss/vendor/_rfs.scss\",\"../../scss/mixins/_h...
  "bootstrap/css/bootstrap-reboot.min.css" => "/*!\n * Bootstrap Reboot v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/b...
  "bootstrap/css/bootstrap-reboot.min.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap-reboot.scss\",\"../../scss/_reboot.scss\",\"dist/css/bootstrap-reboot.css\",\"../../scss/vendor/_rfs.scss\",\"bootstrap-reboot.css\",\"../../scss/mi...
  "bootstrap/css/bootstrap.css" => "/*!\n * Bootstrap v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE...
  "bootstrap/css/bootstrap.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap.scss\",\"bootstrap.css\",\"../../scss/_root.scss\",\"../../scss/_reboot.scss\",\"../../scss/_variables.scss\",\"../../scss/vendor/_rfs.scss\",\"../../scss/mixi...
  "bootstrap/css/bootstrap.min.css" => "/*!\n * Bootstrap v4.4.1 (https://getbootstrap.com/)\n * Copyright 2011-2019 The Bootstrap Authors\n * Copyright 2011-2019 Twitter, Inc.\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LIC...
  "bootstrap/css/bootstrap.min.css.map" => "{\"version\":3,\"sources\":[\"../../scss/bootstrap.scss\",\"../../scss/_root.scss\",\"../../scss/_reboot.scss\",\"dist/css/bootstrap.css\",\"../../scss/vendor/_rfs.scss\",\"bootstrap.css\",\"../../scss/mixi...
  "bootstrap/dropdown.js" => "/*!\n  * Bootstrap dropdown.js v4.4.1 (https://getbootstrap.com/)\n  * Copyright 2011-2019 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)\n  * Licensed under MIT (https://github.com/twbs/bo...
  "bootstrap/dropdown.js.map" => "{\"version\":3,\"file\":\"dropdown.js\",\"sources\":[\"../src/dropdown.js\"],\"sourcesContent\":[\"/**\\n * --------------------------------------------------------------------------\\n * Bootstrap (v4.4.1): dropdown...
  "bootstrap/index.js" => "/**\n * --------------------------------------------------------------------------\n * Bootstrap (v4.4.0): index.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE)\n * ------------------------...

view all matches for this distribution

Analizo

1 match

lib/Analizo/Metric/AverageCycloComplexity.pm view on Meta::CPAN

The Average Cyclomatic Complexity per Method is calculated counting the
predicates (i.e., decision points, or conditional paths) on each method plus
one, then a mean of all methods is returned as the final value of ACCM.

The cyclomatic complexity of a program represented as a graph can be calculated
using a formula of graph theory:

  v(G) = e - n + 2

Where C<e> is the number of edges and C<n> is the number of nodes of the graph.

view all matches for this distribution

Apache-AxKit-Provider-OpenOffice

2 results

>
<!ELEMENT table:change-track-table-cell (text:p*)>
<!ATTLIST table:change-track-table-cell
	table:cell-address %cell-address; #IMPLIED
	table:matrix-covered (true | false) "false"
	table:formula %string; #IMPLIED
	table:number-matrix-rows-spanned %positiveInteger; #IMPLIED
	table:number-matrix-columns-spanned %positiveInteger; #IMPLIED
	table:value-type %valueType; "string"
	table:value %float; #IMPLIED
	table:date-value %date; #IMPLIED

<!ATTLIST table:scenario
	table:display-border %boolean; "true"
	table:border-color %color; #IMPLIED
	table:copy-back %boolean; "true"
	table:copy-styles %boolean; "true"
	table:copy-formulas %boolean; "true"
	table:is-active %boolean; #REQUIRED
	table:scenario-ranges %cell-range-address-list; #REQUIRED
	table:comment CDATA #IMPLIED
>
<!ELEMENT table:shapes %shapes;>

	table:number-columns-repeated %positiveInteger; "1"
	table:number-rows-spanned %positiveInteger; "1"
	table:number-columns-spanned %positiveInteger; "1"
	table:style-name %styleName; #IMPLIED
	table:validation-name CDATA #IMPLIED
	table:formula %string; #IMPLIED
	table:number-matrix-rows-spanned %positiveInteger; #IMPLIED
	table:number-matrix-columns-spanned %positiveInteger; #IMPLIED
	table:value-type %valueType; "string"
	table:value %float; #IMPLIED
	table:date-value %date; #IMPLIED

>
<!ATTLIST table:covered-table-cell
	table:number-columns-repeated %positiveInteger; "1"
	table:style-name %styleName; #IMPLIED
	table:validation-name CDATA #IMPLIED
	table:formula %string; #IMPLIED
	table:number-matrix-rows-spanned %positiveInteger; #IMPLIED
	table:number-matrix-columns-spanned %positiveInteger; #IMPLIED
	table:value-type %valueType; "string"
	table:value %float; #IMPLIED
	table:date-value %date; #IMPLIED

view all matches for this distribution

Apache-SdnFw

1 match

lib/Apache/SdnFw/js/prototype.js view on Meta::CPAN

      },
      'only-of-type':   function(m) {
        var p = Selector.xpath.pseudos; return p['first-of-type'](m) + p['last-of-type'](m);
      },
      nth: function(fragment, m) {
        var mm, formula = m[6], predicate;
        if (formula == 'even') formula = '2n+0';
        if (formula == 'odd')  formula = '2n+1';
        if (mm = formula.match(/^(\d+)$/)) // digit only
          return '[' + fragment + "= " + mm[1] + ']';
        if (mm = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
          if (mm[1] == "-") mm[1] = -1;
          var a = mm[1] ? Number(mm[1]) : 1;
          var b = mm[2] ? Number(mm[2]) : 0;
          predicate = "[((#{fragment} - #{b}) mod #{a} = 0) and " +
          "((#{fragment} - #{b}) div #{a} >= 0)]";

lib/Apache/SdnFw/js/prototype.js view on Meta::CPAN

      for (var i = 0, results = [], node; node = nodes[i]; i++)
        if (!h.previousElementSibling(node) && !h.nextElementSibling(node))
          results.push(node);
      return results;
    },
    'nth-child':        function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root);
    },
    'nth-last-child':   function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true);
    },
    'nth-of-type':      function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, false, true);
    },
    'nth-last-of-type': function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true, true);
    },
    'first-of-type':    function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, false, true);
    },
    'last-of-type':     function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, true, true);
    },
    'only-of-type':     function(nodes, formula, root) {
      var p = Selector.pseudos;
      return p['last-of-type'](p['first-of-type'](nodes, formula, root), formula, root);
    },

    // handles the an+b logic
    getIndices: function(a, b, total) {
      if (a == 0) return b > 0 ? [b] : [];

lib/Apache/SdnFw/js/prototype.js view on Meta::CPAN

        return memo;
      });
    },

    // handles nth(-last)-child, nth(-last)-of-type, and (first|last)-of-type
    nth: function(nodes, formula, root, reverse, ofType) {
      if (nodes.length == 0) return [];
      if (formula == 'even') formula = '2n+0';
      if (formula == 'odd')  formula = '2n+1';
      var h = Selector.handlers, results = [], indexed = [], m;
      h.mark(nodes);
      for (var i = 0, node; node = nodes[i]; i++) {
        if (!node.parentNode._countedByPrototype) {
          h.index(node.parentNode, reverse, ofType);
          indexed.push(node.parentNode);
        }
      }
      if (formula.match(/^\d+$/)) { // just a number
        formula = Number(formula);
        for (var i = 0, node; node = nodes[i]; i++)
          if (node.nodeIndex == formula) results.push(node);
      } else if (m = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
        if (m[1] == "-") m[1] = -1;
        var a = m[1] ? Number(m[1]) : 1;
        var b = m[2] ? Number(m[2]) : 0;
        var indices = Selector.pseudos.getIndices(a, b, nodes.length);
        for (var i = 0, node, l = indices.length; node = nodes[i]; i++) {

view all matches for this distribution

Apache-Wyrd

2 results

Wyrd/Interfaces/IndexUser.pm view on Meta::CPAN

=cut

sub _init_index {
	my ($self) = @_;
	return $self->{'index'} if (UNIVERSAL::isa($self->{'index'}, $self->_base_class . '::Index'));
	my $formula = $self->_base_class . '::Index';
	eval("use $formula") unless ($INC{$formula});
	$self->{'index'} = eval($formula . '->new');
	$self->_raise_exception("Failed to open the index: $formula; reason: $@") if ($@);
	return $self->{'index'};
}

sub _dispose_index {
	my ($self) = @_;

view all matches for this distribution

Apache2-API

1 match

lib/Apache2/API/Status.pm view on Meta::CPAN


This is returned to indicate the resource was found, but somewhere else. This is to be understood as a temporary change.

The de facto standard, divergent from the original intent, is to point the client to a new location after a C<POST> request was performed. This is why the status code C<307> was created.

See also C<307 Temporary Redirect>, which more formally tells the client to reformulate their request to the new location.

See also C<303 See Other> for a formal implementation of aforementioned de facto standard, i.e. C<GET> new location after C<POST> request.

=head2 HTTP_SEE_OTHER (303)

view all matches for this distribution

Apache2-Controller

1 match

lib/Apache2/Controller/DBI/Connector.pm view on Meta::CPAN


Then when you get a load increase, handles are connected that persist
across requests long enough to handle the next request, but during
idle times, your database server conserves resources.

There are various formulas for determining how much memory is
needed for the maximum number of connections your database server 
provides.  MySQL has a formula in their docs somewhere to calculate
memory needed for InnoDB handles. It is weird. 

When using
persistent database connections, it's a good idea to limit the
max number of Apache children to the max number of database connections
that your server can provide.  Find a formula from your vendor's 
documentation, if one exists, or wing it.

=cut

use strict;

view all matches for this distribution

Apache2-Translation

1 match

lib/Apache2/Translation/Admin/prototype.js view on Meta::CPAN

      },
      'only-of-type':   function(m) {
        var p = Selector.xpath.pseudos; return p['first-of-type'](m) + p['last-of-type'](m);
      },
      nth: function(fragment, m) {
        var mm, formula = m[6], predicate;
        if (formula == 'even') formula = '2n+0';
        if (formula == 'odd')  formula = '2n+1';
        if (mm = formula.match(/^(\d+)$/)) // digit only
          return '[' + fragment + "= " + mm[1] + ']';
        if (mm = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
          if (mm[1] == "-") mm[1] = -1;
          var a = mm[1] ? Number(mm[1]) : 1;
          var b = mm[2] ? Number(mm[2]) : 0;
          predicate = "[((#{fragment} - #{b}) mod #{a} = 0) and " +
          "((#{fragment} - #{b}) div #{a} >= 0)]";

lib/Apache2/Translation/Admin/prototype.js view on Meta::CPAN

      for (var i = 0, results = [], node; node = nodes[i]; i++)
        if (!h.previousElementSibling(node) && !h.nextElementSibling(node))
          results.push(node);
      return results;
    },
    'nth-child':        function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root);
    },
    'nth-last-child':   function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true);
    },
    'nth-of-type':      function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, false, true);
    },
    'nth-last-of-type': function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, formula, root, true, true);
    },
    'first-of-type':    function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, false, true);
    },
    'last-of-type':     function(nodes, formula, root) {
      return Selector.pseudos.nth(nodes, "1", root, true, true);
    },
    'only-of-type':     function(nodes, formula, root) {
      var p = Selector.pseudos;
      return p['last-of-type'](p['first-of-type'](nodes, formula, root), formula, root);
    },

    // handles the an+b logic
    getIndices: function(a, b, total) {
      if (a == 0) return b > 0 ? [b] : [];

lib/Apache2/Translation/Admin/prototype.js view on Meta::CPAN

        return memo;
      });
    },

    // handles nth(-last)-child, nth(-last)-of-type, and (first|last)-of-type
    nth: function(nodes, formula, root, reverse, ofType) {
      if (nodes.length == 0) return [];
      if (formula == 'even') formula = '2n+0';
      if (formula == 'odd')  formula = '2n+1';
      var h = Selector.handlers, results = [], indexed = [], m;
      h.mark(nodes);
      for (var i = 0, node; node = nodes[i]; i++) {
        if (!node.parentNode._counted) {
          h.index(node.parentNode, reverse, ofType);
          indexed.push(node.parentNode);
        }
      }
      if (formula.match(/^\d+$/)) { // just a number
        formula = Number(formula);
        for (var i = 0, node; node = nodes[i]; i++)
          if (node.nodeIndex == formula) results.push(node);
      } else if (m = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b
        if (m[1] == "-") m[1] = -1;
        var a = m[1] ? Number(m[1]) : 1;
        var b = m[2] ? Number(m[2]) : 0;
        var indices = Selector.pseudos.getIndices(a, b, nodes.length);
        for (var i = 0, node, l = indices.length; node = nodes[i]; i++) {

view all matches for this distribution

App-BPOMUtils-Table-FoodCategory

4 results

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "05020207",
    "Krokant/Nugat (Praline)/Brittles",
    "Krokant / nugat (praline)/ brittles adalah kembang gula /permen sejenis toffee tetapi tidak menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancur...
    "Tidak Aktif",
  ],
  [
    "05020208",
    "Marshmallow",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "05020212",
    "Krokant/Brittles",
    "Krokant/brittles adalah kembang gula/permen sejenis toffee menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancuran agak kasar (chopped).",
    "Aktif",
  ],
  [
    "05020213",
    "Gulali",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "07010403",
    "Tepung Roti / Bread Crumb",
    "Tepung Roti/Bread crumb adalah roti tawar yang dihancurkan menjadi serpihan lalu dikeringkan, berukuran kasar (lebih kasar dari tepung panir) untuk menyalut bahan pangan lain dengan formulasi yang sesuai peruntukannya.",
    "Aktif",
  ],
  [
    "07010404",
    "Roti Untuk Stuffing",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    13010101,
    "Formula Bayi Bubuk",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010102,
    "Formula Bayi Cair",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010201,
    "Formula Lanjutan Bubuk",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1396,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Padat)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1397,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Cair)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1398,
    "PKMK untuk Pasien Penyakit Ginjal Kronik dengan Terapi Dialisis (Padat)",
    "Pangan yang diformulasikan secara khusus bagi pasien penyakit ginjal kronik, dapat digunakan sebagai makanan pengganti ataupun makanan tambahan, dengan memperhitungkan kebutuhan dan asupan gizi per hari pasien penyakit ginjal kronik.",
    "Aktif",
  ],
  [
    1401010101,
    "Air Mineral Alami Terkarbonasi Secara Alami (Naturally Carbonated Natural Mineral Water)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040101,
    "Minuman Elektrolit Berkarbonat",
    "Minuman elektrolit berkarbonat adalah minuman formulasi berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat<br> mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, kalium sit...
    "Tidak Aktif",
  ],
  [
    1401040103,
    "Minuman Isotonik Berkarbonat",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Tidak Aktif",
  ],
  [
    1401040215,
    "Minuman Elektrolit Tidak Berkarbonat",
    "Minuman elektrolit tidak berkarbonat adalah minuman formulasi tidak berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, ka...
    "Tidak Aktif",
  ],
  [
    1401040216,
    "Minuman Hipotonik Tidak Berkarbonat",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Tidak Aktif",
  ],
  [
    1401040219,
    "Minuman Dasar Elektrolit (Electrolyte Drinks Base) Tidak Berkarbonat",
    "Minuman dasar elektrolit (electrolyte drinks base) tidak berkarbonat adalah minuman formulasi tidak berkarbonasi berbentuk bubuk atau cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit.",
    "Tidak Aktif",
  ],
  [1401040220, "Minuman Asam Jawa", "", "Tidak Aktif"],
  [1401040225, "Nata De Coco Dalam Minuman", "", "Tidak Aktif"],
  [

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040313,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Serbuk)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{2...
    "Tidak Aktif",
  ],
  [
    1401040314,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Cair)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base)(cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{20AC}\...
    "Tidak Aktif",
  ],
  [
    1401040315,
    "Squash Berperisa (Steril)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040317,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Serbuk)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<...
    "Tidak Aktif",
  ],
  [
    1401040318,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Cair)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<br> ...
    "Tidak Aktif",
  ],
  [
    1401040319,
    "Konsentrat Minuman Rasa/Berperisa (Steril Komersial)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    14010557,
    "Minuman Berkafein Formulasi (Formulated Caffeinated Beverages) (Serbuk)",
    "Minuman berkafein formulasi (formulated caffeinated beverages) adalah minuman berperisa tidak beralkohol dalam bentuk serbuk yang mengandung kafein, dapat mengandung karbohidrat, asam amino, vitamin dan zat lain, termasuk bahan pangan lain.<br> ...
    "Aktif",
  ],
  [
    14010558,
    "Minuman Berkafein Formulasi (Formulated Caffeinated Beverages) (Cair)",
    "Minuman berkafein formulasi (formulated caffeinated beverages) adalah minuman berperisa tidak beralkohol berbasis air yang mengandung kafein, dapat mengandung karbohidrat, asam amino, vitamin dan zat lain, termasuk bahan pangan lain.<br> Karakte...
    "Aktif",
  ],
  [
    14010559,
    "Minuman botanikal/minuman rempah (Serbuk)",

view all matches for this distribution

App-BPOMUtils-Table

4 results

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "05020207",
    "Krokant/Nugat (Praline)/Brittles",
    "Krokant / nugat (praline)/ brittles adalah kembang gula /permen sejenis toffee tetapi tidak menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancur...
    "Tidak Aktif",
  ],
  [
    "05020208",
    "Marshmallow",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "05020212",
    "Krokant/Brittles",
    "Krokant/brittles adalah kembang gula/permen sejenis toffee menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancuran agak kasar (chopped).",
    "Aktif",
  ],
  [
    "05020213",
    "Gulali",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    "07010403",
    "Tepung Roti / Bread Crumb",
    "Tepung Roti/Bread crumb adalah roti tawar yang dihancurkan menjadi serpihan lalu dikeringkan, berukuran kasar (lebih kasar dari tepung panir) untuk menyalut bahan pangan lain dengan formulasi yang sesuai peruntukannya.",
    "Aktif",
  ],
  [
    "07010404",
    "Roti Untuk Stuffing",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    13010101,
    "Formula Bayi Bubuk",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010102,
    "Formula Bayi Cair",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010201,
    "Formula Lanjutan Bubuk",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1396,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Padat)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1397,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Cair)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1398,
    "PKMK untuk Pasien Penyakit Ginjal Kronik dengan Terapi Dialisis (Padat)",
    "Pangan yang diformulasikan secara khusus bagi pasien penyakit ginjal kronik, dapat digunakan sebagai makanan pengganti ataupun makanan tambahan, dengan memperhitungkan kebutuhan dan asupan gizi per hari pasien penyakit ginjal kronik.",
    "Aktif",
  ],
  [
    1401010101,
    "Air Mineral Alami Terkarbonasi Secara Alami (Naturally Carbonated Natural Mineral Water)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040101,
    "Minuman Elektrolit Berkarbonat",
    "Minuman elektrolit berkarbonat adalah minuman formulasi berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat<br> mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, kalium sit...
    "Tidak Aktif",
  ],
  [
    1401040103,
    "Minuman Isotonik Berkarbonat",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Tidak Aktif",
  ],
  [
    1401040215,
    "Minuman Elektrolit Tidak Berkarbonat",
    "Minuman elektrolit tidak berkarbonat adalah minuman formulasi tidak berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, ka...
    "Tidak Aktif",
  ],
  [
    1401040216,
    "Minuman Hipotonik Tidak Berkarbonat",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Tidak Aktif",
  ],
  [
    1401040219,
    "Minuman Dasar Elektrolit (Electrolyte Drinks Base) Tidak Berkarbonat",
    "Minuman dasar elektrolit (electrolyte drinks base) tidak berkarbonat adalah minuman formulasi tidak berkarbonasi berbentuk bubuk atau cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit.",
    "Tidak Aktif",
  ],
  [1401040220, "Minuman Asam Jawa", "", "Tidak Aktif"],
  [1401040225, "Nata De Coco Dalam Minuman", "", "Tidak Aktif"],
  [

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040313,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Serbuk)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{2...
    "Tidak Aktif",
  ],
  [
    1401040314,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Cair)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base)(cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{20AC}\...
    "Tidak Aktif",
  ],
  [
    1401040315,
    "Squash Berperisa (Steril)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    1401040317,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Serbuk)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<...
    "Tidak Aktif",
  ],
  [
    1401040318,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Cair)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<br> ...
    "Tidak Aktif",
  ],
  [
    1401040319,
    "Konsentrat Minuman Rasa/Berperisa (Steril Komersial)",

lib/App/BPOMUtils/Table/FoodCategory.pm view on Meta::CPAN

    "Aktif",
  ],
  [
    14010557,
    "Minuman Berkafein Formulasi (Formulated Caffeinated Beverages) (Serbuk)",
    "Minuman berkafein formulasi (formulated caffeinated beverages) adalah minuman berperisa tidak beralkohol dalam bentuk serbuk yang mengandung kafein, dapat mengandung karbohidrat, asam amino, vitamin dan zat lain, termasuk bahan pangan lain.<br> ...
    "Aktif",
  ],
  [
    14010558,
    "Minuman Berkafein Formulasi (Formulated Caffeinated Beverages) (Cair)",
    "Minuman berkafein formulasi (formulated caffeinated beverages) adalah minuman berperisa tidak beralkohol berbasis air yang mengandung kafein, dapat mengandung karbohidrat, asam amino, vitamin dan zat lain, termasuk bahan pangan lain.<br> Karakte...
    "Aktif",
  ],
  [
    14010559,
    "Minuman botanikal/minuman rempah (Serbuk)",

view all matches for this distribution

App-BPOMUtils

3 results

  [605, "Formula Lanjutan"],
  [606, "Formula Pertumbuhan"],
  [610, "Makanan Diet Diabetes"],
  [
    613,
    "Makanan formula sebagai makanan diet kontrol berat badan",
  ],
  [615, "Pangan Ibu Hamil dan Pangan Ibu Menyusui"],
  [651, "Air mineral alami"],
  [652, "Air Minum dalam Kemasan (AMDK)"],
  [653, "Air Bermineral"],

    "Aktif",
  ],
  [
    "05020207",
    "Krokant/Nugat (Praline)/Brittles",
    "Krokant / nugat (praline)/ brittles adalah kembang gula /permen sejenis toffee tetapi tidak menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancur...
    "Tidak Aktif",
  ],
  [
    "05020208",
    "Marshmallow",

    "Aktif",
  ],
  [
    "05020212",
    "Krokant/Brittles",
    "Krokant/brittles adalah kembang gula/permen sejenis toffee menggunakan susu dalam formulasinya dan didominasi oleh rasa kacang (almond, hazelnut atau kacang tanah) yang ditambahkan pada adonan dalam bentuk hancuran agak kasar (chopped).",
    "Aktif",
  ],
  [
    "05020213",
    "Gulali",

    "Aktif",
  ],
  [
    "07010403",
    "Tepung Roti / Bread Crumb",
    "Tepung Roti/Bread crumb adalah roti tawar yang dihancurkan menjadi serpihan lalu dikeringkan, berukuran kasar (lebih kasar dari tepung panir) untuk menyalut bahan pangan lain dengan formulasi yang sesuai peruntukannya.",
    "Aktif",
  ],
  [
    "07010404",
    "Roti Untuk Stuffing",

    "Aktif",
  ],
  [
    13010101,
    "Formula Bayi Bubuk",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010102,
    "Formula Bayi Cair",
    "Formula sebagai pengganti ASI untuk bayi (sampai umur 6 (enam) bulan, tidak lebih dari umur 12 (dua belas) bulan) yang secara khusus diformulasikan untuk menjadi satu-satunya sumber zat gizi dalam bulan-bulan pertama kehidupannya sampai bayi dip...
    "Tidak Aktif",
  ],
  [
    13010201,
    "Formula Lanjutan Bubuk",

    "Aktif",
  ],
  [
    1396,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Padat)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1397,
    "Pangan Olahan Keperluan Medis Khusus Bagi Bayi Intoleransi Laktosa (Cair)",
    "PKMK untuk Bayi Intoleransi Laktosa adalah pangan yang diformulasikan secara khusus bagi bayi yang mengalami intoleransi laktosa. PKMK untuk bayi intoleransi laktosa dapat digunakan sebagai makanan pengganti atau makanan tambahan, sehingga dapat...
    "Aktif",
  ],
  [
    1398,
    "PKMK untuk Pasien Penyakit Ginjal Kronik dengan Terapi Dialisis (Padat)",
    "Pangan yang diformulasikan secara khusus bagi pasien penyakit ginjal kronik, dapat digunakan sebagai makanan pengganti ataupun makanan tambahan, dengan memperhitungkan kebutuhan dan asupan gizi per hari pasien penyakit ginjal kronik.",
    "Aktif",
  ],
  [
    1401010101,
    "Air Mineral Alami Terkarbonasi Secara Alami (Naturally Carbonated Natural Mineral Water)",

    "Aktif",
  ],
  [
    1401040101,
    "Minuman Elektrolit Berkarbonat",
    "Minuman elektrolit berkarbonat adalah minuman formulasi berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat<br> mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, kalium sit...
    "Tidak Aktif",
  ],
  [
    1401040103,
    "Minuman Isotonik Berkarbonat",

    "Tidak Aktif",
  ],
  [
    1401040215,
    "Minuman Elektrolit Tidak Berkarbonat",
    "Minuman elektrolit tidak berkarbonat adalah minuman formulasi tidak berkarbonasi yang ditujukan untuk menggantikan cairan, karbohidrat, elektrolit dan mineral tubuh dengan cepat. Dapat mengandung kalsium fosfat, kalium fosfat, kalsium sitrat, ka...
    "Tidak Aktif",
  ],
  [
    1401040216,
    "Minuman Hipotonik Tidak Berkarbonat",

    "Tidak Aktif",
  ],
  [
    1401040219,
    "Minuman Dasar Elektrolit (Electrolyte Drinks Base) Tidak Berkarbonat",
    "Minuman dasar elektrolit (electrolyte drinks base) tidak berkarbonat adalah minuman formulasi tidak berkarbonasi berbentuk bubuk atau cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit.",
    "Tidak Aktif",
  ],
  [1401040220, "Minuman Asam Jawa", "", "Tidak Aktif"],
  [1401040225, "Nata De Coco Dalam Minuman", "", "Tidak Aktif"],
  [

    "Aktif",
  ],
  [
    1401040313,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Serbuk)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{2...
    "Tidak Aktif",
  ],
  [
    1401040314,
    "Minuman Dasar Elektrolit Berkarbonat (Electrolyte Drinks Base)(Cair)",
    "Minuman dasar elektrolit berkarbonat (electrolyte drinks base)(cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit berkarbonat.<br> Karakteristik dasar:<br> \xE2\x{20AC}\...
    "Tidak Aktif",
  ],
  [
    1401040315,
    "Squash Berperisa (Steril)",

    "Aktif",
  ],
  [
    1401040317,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Serbuk)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (serbuk) adalah minuman formulasi berbentuk serbuk yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<...
    "Tidak Aktif",
  ],
  [
    1401040318,
    "Minuman Dasar Elektrolit Tidak Berkarbonat (Electrolyte Drinks Base) (Cair)",
    "Minuman dasar elektrolit tidak berkarbonat (electrolyte drinks base) (cair) adalah minuman formulasi berbentuk cair yang dikonsumsi dengan penambahan air ditujukan untuk membuat minuman elektrolit tidak berkarbonat.<br> Karakteristik dasar:<br> ...
    "Tidak Aktif",
  ],
  [
    1401040319,
    "Konsentrat Minuman Rasa/Berperisa (Steril Komersial)",