[Pkg-octave-commit] [octave-mvn] 01/02: Imported Upstream version 1.1.0

Rafael Laboissière rlaboiss-guest at moszumanska.debian.org
Wed Sep 14 17:26:39 UTC 2016


This is an automated email from the git hooks/post-receive script.

rlaboiss-guest pushed a commit to branch master
in repository octave-mvn.

commit cd735665bf922374f1d9dd2ce9211b6e0d956a99
Author: Rafael Laboissiere <rafael at debian.org>
Date:   Sat Aug 20 16:19:25 2016 -0300

    Imported Upstream version 1.1.0
---
 COPYING                             | 674 ++++++++++++++++++++++++++++++++++++
 DESCRIPTION                         |  12 +
 INDEX                               |  21 ++
 NEWS                                |   3 +
 README.txt                          |  27 ++
 inst/mvn_bregmancentroid_geodesic.m |  55 +++
 inst/mvn_bregmancentroid_kl_left.m  |  59 ++++
 inst/mvn_bregmancentroid_kl_right.m |  47 +++
 inst/mvn_bregmancentroid_skl.m      |  58 ++++
 inst/mvn_div_bc.m                   |  36 ++
 inst/mvn_div_js.m                   |  55 +++
 inst/mvn_div_kl.m                   |  30 ++
 inst/mvn_div_skl.m                  |  36 ++
 inst/mvn_divmat.m                   |  56 +++
 inst/mvn_entropy.m                  |  26 ++
 inst/mvn_fn2class.m                 |  36 ++
 inst/mvn_ismetric.m                 |  37 ++
 inst/mvn_kmeans.m                   | 144 ++++++++
 inst/mvn_knnclass.m                 |  56 +++
 inst/mvn_new.m                      |  56 +++
 inst/mvn_som_skl.m                  | 156 +++++++++
 inst/mvn_test.m                     | 105 ++++++
 inst/mvn_traceprod.m                |  25 ++
 inst/mvn_version.m                  |  25 ++
 24 files changed, 1835 insertions(+)

diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/DESCRIPTION b/DESCRIPTION
new file mode 100644
index 0000000..7659bb9
--- /dev/null
+++ b/DESCRIPTION
@@ -0,0 +1,12 @@
+Name: mvn
+Version: 1.1.0
+Date: 2013-12-30
+Author: Dominik Schnitzer
+Maintainer: Nir Krakauer <nkrakauer at ccny.cuny.edu>
+Title: mvn
+Description: Multivariate normal distribution clustering and utility functions.
+Categories: Statistics
+Depends: octave (>= 3.6.0)
+Autoload: no
+License: GPLv3+
+Url: http://octave.sf.net
diff --git a/INDEX b/INDEX
new file mode 100644
index 0000000..fb0e384
--- /dev/null
+++ b/INDEX
@@ -0,0 +1,21 @@
+analysis >> Data analysis
+Multivariate normal distribution functions
+ mvn_bregmancentroid_geodesic
+ mvn_bregmancentroid_kl_left
+ mvn_bregmancentroid_kl_right
+ mvn_bregmancentroid_skl
+ mvn_div_bc
+ mvn_div_js
+ mvn_div_kl
+ mvn_div_skl
+ mvn_divmat
+ mvn_entropy
+ mvn_fn2class
+ mvn_ismetric
+ mvn_kmeans
+ mvn_knnclass
+ mvn_new
+ mvn_som_skl
+ mvn_test
+ mvn_traceprod
+ mvn_version
diff --git a/NEWS b/NEWS
new file mode 100644
index 0000000..1a0ab2a
--- /dev/null
+++ b/NEWS
@@ -0,0 +1,3 @@
+Summary of important user-visible changes for mvn 1.1.0:
+-------------------------------------------------------------------
+Changed documentation and internal try/catch syntax from version 1.0 (available at http://ofai.at/~dominik.schnitzer/mvn/ ) for Octave compatibility
diff --git a/README.txt b/README.txt
new file mode 100644
index 0000000..494b01a
--- /dev/null
+++ b/README.txt
@@ -0,0 +1,27 @@
+This is the Multivariate Normals (MVN) toolbox for Octave/Matlab.
+http://www.ofai.at/~dominik.schnitzer/mvn
+---
+
+
+The MVN toolbox provides functions to handle multivariate Gaussians in Matlab.
+
+It implements divergences for similarity computation:
+ - The Kullback-Leibler divergence
+ - The symmetrized Kullback-Leibler divergence
+ - A Jensen-Shannon approximation
+ - The Bhattacharyya coefficient
+ - and othe functions to work with these divergences.
+ 
+We also include a k-means clustering method for the multivariate Gaussians
+and a method to compute native Self-Organizing maps for multivatiate Gaussians
+and their divergences.
+
+The author uses the toolbox for Music Similarity estimation and experiments
+(as the features there are multivariate Gaussians), but its methods are of
+course not limited to that topic.
+
+
+
+
+August, 31th 2011
+Dominik Schnitzer <dominik.schnitzer at ofai.at>
diff --git a/inst/mvn_bregmancentroid_geodesic.m b/inst/mvn_bregmancentroid_geodesic.m
new file mode 100644
index 0000000..7d1a40a
--- /dev/null
+++ b/inst/mvn_bregmancentroid_geodesic.m
@@ -0,0 +1,55 @@
+function [c] = mvn_bregmancentroid_geodesic(d, c1, c2)
+%MVN_BREGMANCENTROID_GEODESIC   Computes an arbitrary weighted KL centroid on the geodesic linking between two sided centroids c1 and c2.
+%
+%   [c] = MVN_BREGMANCENTROID_GEODESIC(d, m1, m2) computes the KL centroid
+%   for the given sided centroids m1 and m2 weighting m1 with d and m2
+%   with (1-d).
+%
+%   See: On the centroids of symmetrized bregman divergences, Nielsen, F.
+%   and Nock, R., 2007.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    c.m = d*c1.m + (1-d)*c2.m;
+    c.cov = d*(c1.cov + c1.m*c1.m') + ...
+        (1-d)*(c2.cov + c2.m*c2.m') - ...
+        c.m*c.m';
+
+
+    c_chol = chol(c.cov);
+    c.logdet = 2*sum(log(diag(c_chol)));
+    c_ui = c_chol\eye(length(c.m));
+    c.icov = c_ui*c_ui';    
+    
+% Original version
+% 
+%     % compute gradient (gradF)
+%     c1GF.m = c1.m;
+%     c1GF.cov = -(c1.cov + c1.m*c1.m');
+%     c2GF.m = c2.m;
+%     c2GF.cov = -(c2.cov + c2.m*c2.m');
+% 
+%     % geodesic walk
+%     gcGF.m = d*c1GF.m + (1-d)*c2GF.m;
+%     gcGF.cov = d*c1GF.cov + (1-d)*c2GF.cov;
+% 
+%     % compute inverse gradient (gradF^-1)
+%     c.m = gcGF.m;
+%     c.cov = -(gcGF.cov + gcGF.m*gcGF.m');
+
+end
diff --git a/inst/mvn_bregmancentroid_kl_left.m b/inst/mvn_bregmancentroid_kl_left.m
new file mode 100644
index 0000000..8b1971e
--- /dev/null
+++ b/inst/mvn_bregmancentroid_kl_left.m
@@ -0,0 +1,59 @@
+function [c] = mvn_bregmancentroid_kl_left(models)
+%MVN_BREGMANCENTROID_KL_LEFT    Compute the left sided Kullback-Leibler (KL) centroid given mvn models. (GRADIENT SPACE CENTER OF MASS)
+%
+%   [c] = MVN_BREGMANCENTROID_KL_LEFT(models) computes the left sided KL
+%   centroid for the given multivariate normals.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    c.m = 0 .* models(1).m;
+
+    % new means
+    len = length(models);
+    for i=1:len
+        c.m = c.m + 1/len .* models(i).m;
+    end
+
+    % new covariance
+    
+%     % original:        
+%     c.cov = c.m*c.m';
+%     for i=1:len
+%         c.cov = c.cov + 1/len .* (models(i).cov +...
+%             models(i).m*models(i).m' - models(i).m*c.m' -...
+%             c.m*models(i).m');
+
+    c.cov = -1 .* c.m*c.m';
+    for i=1:len
+        c.cov = c.cov + 1/len.*(models(i).cov + models(i).m*models(i).m');
+    end
+    
+    % compute inverse covariance
+    
+    % speedup for
+    %
+    %   c.logdet = log(det(c.cov));
+    %   c.icov = inv(c.cov);
+    %
+    % using Cholesky:
+    
+    c_chol = chol(c.cov);
+    c.logdet = 2*sum(log(diag(c_chol)));
+    c_ui = c_chol\eye(length(c.m));
+    c.icov = c_ui*c_ui';
+end
diff --git a/inst/mvn_bregmancentroid_kl_right.m b/inst/mvn_bregmancentroid_kl_right.m
new file mode 100644
index 0000000..bfcc345
--- /dev/null
+++ b/inst/mvn_bregmancentroid_kl_right.m
@@ -0,0 +1,47 @@
+function [c] = mvn_bregmancentroid_kl_right(models)
+%MVN_BREGMANCENTROID_RIGHT    Compute the right centroid given mvn models ("center of mass").
+%
+%   [c] = MVN_BREGMANCENTROID_RIGHT(models) computes the right sided
+%   centroid for the given multivariate normals.
+
+%   (c) 2010, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    % compute the new mean in the natural parameter space
+    len = length(models);
+    c.m = 0 .* models(1).m;
+    for i=1:len
+        c.m = c.m + 1/len * (models(i).icov * models(i).m);
+    end
+
+    % compute the covariance in the natural parameter space
+    c.cov = [];
+    c.logdet = NaN;
+    c.icov = 0 .* models(1).cov;
+    
+    for i=1:len
+	    c.icov = c.icov + 1/len * models(i).icov;
+    end
+
+    % recover the the parameters of the multivariate gaussian distribution
+    % from the natual parameters
+    c.cov = inv(c.icov);
+    c.m = c.cov * c.m;
+    
+    c_chol = chol(c.cov);
+    c.logdet = 2*sum(log(diag(c_chol)));    
+end
diff --git a/inst/mvn_bregmancentroid_skl.m b/inst/mvn_bregmancentroid_skl.m
new file mode 100644
index 0000000..57e31d9
--- /dev/null
+++ b/inst/mvn_bregmancentroid_skl.m
@@ -0,0 +1,58 @@
+function [c] = mvn_bregmancentroid_skl(models, approx, lc, rc)
+%MVN_BREGMANCENTROID_SKL    Compute the symmetric Kullback-Leibler (KL) centroid given mvn models.
+%
+%   [c] = MVN_BREGMANCENTROID_SKL(models) computes the SKL centroid 
+%   for the given multivariate normals.
+%
+%   [c] = MVN_BREGMANCENTROID_SKL(models, 1) computes the SKL centroid 
+%   mid-point approximation for the given multivariate normals.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    c = [];
+
+    if (nargin < 3)
+        if (length(models) < 1)
+            return;
+        end
+
+        lc = mvn_bregmancentroid_kl_left(models);
+        rc = mvn_bregmancentroid_kl_right(models);
+    end
+    
+    % compute the mid-point approximation if requested.
+    if ((nargin > 1) && (approx == 1))
+        c = mvn_bregmancentroid_geodesic(0.5, lc, rc);
+        return;
+    end
+
+    d = 0;
+    d1 = 1;
+
+    while ((d1 - d) > 0.00001)
+        d2 = 0.5 * (d + d1);
+        c = mvn_bregmancentroid_geodesic(d2, lc, rc);
+
+        bisector = mvn_div_kl(c, lc) - mvn_div_kl(rc, c);
+        if (bisector < 0)
+            d1 = d2;
+        else
+            d = d2;
+        end
+    end
+end
diff --git a/inst/mvn_div_bc.m b/inst/mvn_div_bc.m
new file mode 100644
index 0000000..80f2114
--- /dev/null
+++ b/inst/mvn_div_bc.m
@@ -0,0 +1,36 @@
+function d = mvn_div_bc(m1, m2)
+%MVN_DIV_BC Compute the Bhattacharyya coefficient between two
+%   multivariate normals.
+%
+%   [d] = MVN_DIV_BC(m1, m2) computes the BC between two
+%   multivariate normals. d is never negative.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    mdiff = m1.m - m2.m;
+    covsum = 0.5*(m1.cov + m2.cov);
+
+%     % Original
+%     d = 1/8 * ((mdiff' * inv(covsum)) * mdiff) +...
+%         1/2*log(det(covsum)) - 1/4*m1.logdet - 1/4*m2.logdet;
+    
+    d = 1/8 * ((mdiff' / covsum) * mdiff) +...
+        1/2*log(det(covsum)) - 1/4*m1.logdet - 1/4*m2.logdet;
+    d = max(d, 0);
+    
+end
diff --git a/inst/mvn_div_js.m b/inst/mvn_div_js.m
new file mode 100644
index 0000000..b5d4774
--- /dev/null
+++ b/inst/mvn_div_js.m
@@ -0,0 +1,55 @@
+function d = mvn_div_js(m1, m2, use_kl)
+%MVN_DIV_JS Compute the Jensen-Shannon (JS) divergence between two multivariate normals.
+%
+%   [d] = MVN_DIV_JS(m1, m2) computes the JS divergence between two
+%   multivariate normals. d is never negative.
+%
+%   The JS divergence is defined as:
+%       d = 0.5*KL(m1, m1+m2) + 0.5*KL(m2, m1+m2)
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    % Speedup:
+    %
+    %    m12 = mvn_bregmancentroid_kl_left([m1 m2]);
+    %
+    % using Cholesky & more Optimization
+
+    m12.m = 0.5*m1.m + 0.5*m2.m;
+    m12.cov = 0.5*(m1.cov + m1.m*m1.m') + 0.5*(m2.cov + m2.m*m2.m') ...
+        - m12.m*m12.m';
+    m12_chol = chol(m12.cov);
+    m12.logdet = 2*sum(log(diag(m12_chol)));
+    
+    if ((nargin > 2) && (use_kl == 1))
+        m12_ui = m12_chol\eye(length(m12.m));
+        m12.icov = m12_ui*m12_ui';
+
+        d = 0.5*mvn_div_kl(m1, m12) + 0.5*mvn_div_kl(m2, m12);
+    else
+        % Speedup original (entropy):
+        %
+        % d = mvn_entropy(m12) - 0.5*mvn_entropy(m1) - 0.5*mvn_entropy(m2);
+        %
+        % faster:
+        
+        d = 0.5*m12.logdet - 0.25*m1.logdet - 0.25*m2.logdet;
+    end
+    
+    d = max(d, 0);
+end
diff --git a/inst/mvn_div_kl.m b/inst/mvn_div_kl.m
new file mode 100644
index 0000000..ddc8326
--- /dev/null
+++ b/inst/mvn_div_kl.m
@@ -0,0 +1,30 @@
+function [d] = mvn_div_kl(p, q)
+%MVN_DIV_KL  Compute the Kullback-Leibler (KL) divergence.
+%
+%   [d] = MVN_DIV_KL(m1, m2) computes the KL divergence between two
+%   multivariate normals. d is never negative.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    n = length(p.m);
+    m = q.m - p.m;
+
+    d = 0.5 * ((q.logdet - p.logdet) + mvn_traceprod(q.icov, p.cov) + ...
+        m' * q.icov * m - n);
+    d = max(d, 0);
+end
diff --git a/inst/mvn_div_skl.m b/inst/mvn_div_skl.m
new file mode 100644
index 0000000..41f8bbd
--- /dev/null
+++ b/inst/mvn_div_skl.m
@@ -0,0 +1,36 @@
+function d = mvn_div_skl(m1, m2)
+%MVN_DIV_SKL  Compute the symmetric Kullback-Leibler (KL) divergence.
+%
+%   [d] = MVN_DIV_SKL(m1, m2) computes the SKL divergence between two
+%   multivariate normals. d is never negative.
+%
+%   The SKL divergence is defined as:
+%       d = 0.5*KL(m1, m2) + 0.5*KL(m2, m1)
+%
+%   Note: This function computes a faster version.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    n = length(m1.m);
+    m = m1.m - m2.m;
+
+    d = (mvn_traceprod(m1.cov, m2.icov) + mvn_traceprod(m2.cov, m1.icov) + ...
+         mvn_traceprod(m1.icov+m2.icov, m*m') - 2*n) / 4;
+
+    d = max(d, 0);
+end
diff --git a/inst/mvn_divmat.m b/inst/mvn_divmat.m
new file mode 100644
index 0000000..fa8f966
--- /dev/null
+++ b/inst/mvn_divmat.m
@@ -0,0 +1,56 @@
+function [d] = mvn_divmat(models, t)
+%MVN_DIVMAT  Compute a distance/divergence matrix using the specified MODELS and the given divergence T.
+%
+%   [d] = MVN_DIVMAT(models, t) Computes a divergence matrix using the given
+%   mvn MODELS models and divergence T. T can be 'kl_left', 'kl_right', 
+%   'skl', 'js', 'js_kl'. It defaults to the 'skl'.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    if (nargin < 2)
+        t = 'skl';
+    end
+
+    if (strcmp(t, 'kl_left') == 1)
+        mvn_div = @(x, c) mvn_div_kl(x, c);
+    elseif (strcmp(t, 'kl_right') == 1)
+        mvn_div = @(x, c) mvn_div_kl(c, x);
+    elseif (strcmp(t, 'skl') == 1)
+        mvn_div = @(x, c) mvn_div_skl(x, c);
+    elseif (strcmp(t, 'js') == 1)
+        mvn_div = @(x, c) mvn_div_js(x, c);
+    elseif (strcmp(t, 'js_kl') == 1)
+        mvn_div = @(x, c) mvn_div_js(x, c, 1);
+    end
+
+    d = zeros(length(models), length(models), 'single');
+
+    for i=1:length(models)
+        if (isempty(models(i).m))
+            continue;
+        end
+        for j=i+1:length(models)
+            if (isempty(models(j).m))
+                continue;
+            end
+            d(i, j) = mvn_div(models(i), models(j));
+            d(j, i) = d(i, j);
+        end
+    end
+
+end
diff --git a/inst/mvn_entropy.m b/inst/mvn_entropy.m
new file mode 100644
index 0000000..db13a87
--- /dev/null
+++ b/inst/mvn_entropy.m
@@ -0,0 +1,26 @@
+function [h] = mvn_entropy(m)
+%MVN_ENTROPY Compute the Entropy of the given multivariate normal.
+%
+%   [h] = MVN_ENTROPY(m) computes the entropy of mvn model M.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    n = length(m.m);
+    
+    h = (n + n*log(2*pi))/2 + m.logdet/2;
+end
diff --git a/inst/mvn_fn2class.m b/inst/mvn_fn2class.m
new file mode 100644
index 0000000..fa9baff
--- /dev/null
+++ b/inst/mvn_fn2class.m
@@ -0,0 +1,36 @@
+function [cl_names, cl_assig] = mvn_fn2class(filenames, cl_pos, delim)
+%MVN_FN2CLASS 
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    cl_names_all = cell(length(filenames), 1);
+
+    for i = 1:length(filenames)
+        fn = filenames{i};
+        sp = strfind(fn, delim);
+        cl_names_all{i} = fn(sp(cl_pos)+1:sp(cl_pos+1)-1);
+    end
+
+    cl_names = unique(cl_names_all);
+
+    cl_assig = zeros(length(filenames), 1);
+    for i = 1:length(filenames)
+        cl_assig(i) = find(strcmp(cl_names, cl_names_all{i}) == 1);
+    end
+    
+end
diff --git a/inst/mvn_ismetric.m b/inst/mvn_ismetric.m
new file mode 100644
index 0000000..ec5982e
--- /dev/null
+++ b/inst/mvn_ismetric.m
@@ -0,0 +1,37 @@
+function [ ismetric ] = mvn_ismetric(d)
+%MVN_ISMETRIC Analyzes the distance matrix D and returns the percentage of triples fulfilling the triangle inequality.
+%
+%   ATTENTION: Symmetry and Identity is presumed.
+%
+%   ismetric = MVN_ISMETRIC(d) Analyzes the given distance matrix and returns
+%   the percentage of all possible triples fulfilling the triangle inequality.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    ismetric = 0;
+    for x = 1:length(d)
+        ismetric = ismetric + sum((d(x,x) <= d(x,:) + d(x,:)));
+        for y = (x+1):length(d)
+            ismetric = ismetric + 2*sum( d(x, y) <= (d(x, :) + d(y, :)) );
+        end
+   end
+    
+   ismetric = ismetric / (length(d)^3);
+   
+end
+
diff --git a/inst/mvn_kmeans.m b/inst/mvn_kmeans.m
new file mode 100644
index 0000000..c86d74a
--- /dev/null
+++ b/inst/mvn_kmeans.m
@@ -0,0 +1,144 @@
+function [centers, assig, qe] = mvn_kmeans(models, k, t)
+%MVN_KMEANS Compute K-Means clustering on the given mvn models in respect to the given divergence. Standard is the symmetric Kullback-Leibler divergence between the models.
+%
+%   [centers, assig] = MVN_KMEANS_SKL(models, k, type) computes a k-means
+%   clustering using the given the SKL divergence. We return k mvn
+%   centers and the assignment of the models to their centers.
+%
+%   See: Clustering with Bregman divergences, A. Banerjee et al., The
+%   Journal of Machine Learning Research 2005, Volume 6.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    items = length(models);
+    assig = zeros(items, 1);
+
+    ri = randi(items, k, 1);
+    centers = models(ri);
+
+    if ((nargin < 2) || (nargin > 3))
+         error('Wrong number of input arguments');
+    end
+
+    if (nargin < 3)
+        t = 'skl';
+    end
+    
+    if (strcmp(t, 'kl_left') == 1)
+        mvn_div = @(x, c) mvn_div_kl(x, c);
+        mvn_bregmancentroid = @(x) mvn_bregmancentroid_kl_left(x); 
+        
+    elseif (strcmp(t, 'kl_right') == 1)
+        mvn_div = @(x, c) mvn_div_kl(c, x);
+        mvn_bregmancentroid = @(x) mvn_bregmancentroid_kl_right(x); 
+        
+    elseif (strcmp(t, 'skl') == 1)
+        mvn_div = @(x, c) mvn_div_skl(x, c);
+        mvn_bregmancentroid = @(x) mvn_bregmancentroid_skl(x); 
+        
+    elseif (strcmp(t, 'skl_mid') == 1)
+        mvn_div = @(x, c) mvn_div_skl(x, c);
+        mvn_bregmancentroid = @(x) mvn_bregmancentroid_skl(x, 1);
+        
+%    elseif (strcmp(t, 'js') == 1)
+%        mvn_div = @(x, c) mvn_div_js(x, c, 0);
+%        mvn_bregmancentroid = @(x) mvn_bregmancentroid_js(x, 1);
+%        
+%    elseif (strcmp(t, 'js_mid') == 1)
+%        mvn_div = @(x, c) mvn_div_js(x, c);
+%        mvn_bregmancentroid = @(x) mvn_bregmancentroid_js(x, 1);
+%        
+%    elseif (strcmp(t, 'burbearao') == 1)
+%        mvn_div = @(x, c) mvn_div_js(x, c);
+%        mvn_bregmancentroid = @(x) mvn_bregmancentroid_burbearao(x);
+        
+    else
+        error('Unknown divergence given.');
+    end
+
+    iter = 0;
+    oldqe = 1;
+    qe = 0;
+  
+    reiterate = 3;
+    while (reiterate > 0)
+
+        % assign the models to their closest centroid	
+        oldqe = qe;
+        qe = 0;
+        for i = 1:items
+            c = intmax();
+            cidx = k+1;
+            for j = 1:k
+                dist = mvn_div(models(i), centers(j));
+                if (dist < c)
+                    c = dist;
+                    cidx = j;
+                end
+            end
+            qe = qe + c;
+            assig(i) = cidx;
+        end
+        qe = qe/items;
+        fprintf('#%d, average bregman quantization error = %f\n', iter, qe);
+
+        % check for failing clentroids
+        reiterate = max(reiterate - 1, 0);
+        i = 1;
+        while (i <= k)
+            sel = find(assig == i);
+            if (length(sel) < 1)
+                fprintf('%d, reinitializing centroid #%d (%d)\n', ...
+                    iter, i, length(sel));
+                r = randi(items, 1, 1);
+                centers(i) = models(r);
+                assig(r) = i;
+                reiterate = reiterate + 3;
+                i=0;
+            end
+            i = i+1;
+        end
+        
+        % compute the new centroids
+        for i = 1:k
+            aaa = mvn_bregmancentroid(models(assig == i));
+%            fprintf('centroids = %d = %d, %d\n', i , length(aaa), length(models(assig == i)));
+            centers(i) = aaa;
+        end
+
+        iter = iter + 1;
+        
+        if (((oldqe - qe) >= 0.0001) && (reiterate == 0))
+            reiterate = 1;
+        end
+    end
+
+    % assign the models to their closest centroid	
+    for i = 1:items
+        c = intmax();
+        cidx = k+1;
+        for j = 1:k
+            dist = mvn_div(models(i), centers(j));
+            if (dist < c)
+                c = dist;
+                cidx = j;
+            end
+        end
+        assig(i) = cidx;
+    end
+end
diff --git a/inst/mvn_knnclass.m b/inst/mvn_knnclass.m
new file mode 100644
index 0000000..ba4636b
--- /dev/null
+++ b/inst/mvn_knnclass.m
@@ -0,0 +1,56 @@
+function accuracy = mvn_knnclass(D, cl_assig, k, cl_filter)
+%MVN_KNNCLASS
+
+%   (c) 2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+accuracy = 0;
+
+if (nargin < 4)
+    cl_filter = [];
+end
+
+for i = 1:length(cl_assig)
+    
+    D(i, i) = +Inf;
+    [~, nn_idx] = sort(D(i, :));
+    
+    if (~isempty(cl_filter))
+        kk = 0;
+        for j = 1:length(cl_assig)
+            if (cl_filter(nn_idx(j)) ~= cl_filter(i))
+                kk = kk + 1;
+                if (cl_assig(nn_idx(j)) == cl_assig(i))
+                    accuracy = accuracy + 1/k;
+                end
+                
+                if (kk == k)
+                    break;
+                end
+            end
+        end
+    else
+        for kk = 1:k
+            if (cl_assig(nn_idx(k)) == cl_assig(i))
+                accuracy = accuracy + 1/k;
+            end
+        end
+    end
+    
+end
+
+accuracy = accuracy / length(cl_assig);
diff --git a/inst/mvn_new.m b/inst/mvn_new.m
new file mode 100644
index 0000000..325f0f4
--- /dev/null
+++ b/inst/mvn_new.m
@@ -0,0 +1,56 @@
+%MVN_NEW  Initialize a mvn struct
+%
+%   [d] = MVN_NEW(cov, m) initializes a MVN struct using the given covariance
+%   matrix COV and mean vector M.
+%
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+%   Revised for Octave compatibility 2013, Nir Krakauer <nkrakauer at ccny.cuny.edu>
+
+function [g] = mvn_new(cov, m)
+
+    g.m = m(:);
+    g.cov = cov;
+    
+    if (rcond(cov) < 1e-15)
+        error("Covariance is badly scaled!");
+    end
+    
+    % speedup for
+    %
+    %  g.logdet = log(det(g.cov));
+    %  g.icov = inv(g.cov);
+    %
+    % using Cholesky:
+    
+     g_chol = chol(cov);
+     g.logdet = 2*sum(log(diag(g_chol)));
+     g_ui = g_chol\eye(length(g.m));
+     g.icov = g_ui*g_ui';
+
+endfunction
+
+%!test
+%! n = 3; m = ones(n, 1); C = [1 0 0.2; 0 1 0; 0.2 0 1];
+%! [g] = mvn_new(C, m);
+%! assert (g.m, m);
+%! assert (g.cov, C);
+%! assert (g.icov, inv(C));
+%! assert (g.logdet, log(det(C)), eps);
diff --git a/inst/mvn_som_skl.m b/inst/mvn_som_skl.m
new file mode 100644
index 0000000..77f71e7
--- /dev/null
+++ b/inst/mvn_som_skl.m
@@ -0,0 +1,156 @@
+function [grid D] = mvn_som_skl(cm, n, global_training, local_training)
+%MVN_SOM_SKL  Computes a NxN SOM using the MVN models and the
+%   Symmetric Kullback-Leibler divergence. 
+%
+%The algorithm was published in 2010:
+%   ``Islands of Gaussians: The Self Organizing Map and Gaussian Music Similarity Features'', D. Schnitzer, A. Flexer, G. Widmer and M. Gasser, Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010.
+%
+%   [grid D] = MVN_SOM_SKL(models, n) Select the models to compute
+%   the NxN SOM.
+%
+%   [grid D] = MVN_SOM_SKL(models, n, global_training, local_training)
+%   Select the models to compute the NxN SOM; global/local_training sets the global/local training iterations of the SOM
+
+%   MVN is (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   <http://www.ofai.at/~dominik.schnitzer/mvn>
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    cmsel = 1:length(cm);
+
+    % initialization
+    grid = [];
+    for i = 0:n-1
+        for j = 0:n-1
+            grid(i*n + (j+1)).x = i;
+            grid(i*n + (j+1)).y = j;
+            grid(i*n + (j+1)).n = [];
+        end
+    end
+
+    cmlen = length(cmsel);
+    
+    mlen = n*n;
+    
+    % RANDOM INIT
+    mperm = randperm(cmlen);
+    m = cm(mperm(1:mlen));
+    
+    if (nargin <= 2)
+        global_training = 100;
+        local_training = 200;
+    end
+
+    for learniter = 1:global_training+local_training
+
+        if (learniter < global_training)
+
+            % select appropriate alpha
+            alpha = 0.9 * (1 - learniter/global_training);
+
+            % relatively large radius, decay to 1 during global learning
+            sigma = 1 + 2/3*n*(1 - learniter/global_training);
+            fprintf(1, 'global training; som iteration=%d, alpha=%f, sigma=%f\n', learniter,...
+                alpha, sigma);
+        else
+            local_learniter = learniter - global_training;
+
+            % attain alpha values in the range of 0.06 - 0.01
+            alpha = 0.01 + 0.05*(1 - local_learniter/local_training);
+
+            % only modify neighbours
+            sigma = 1.5;
+            fprintf(1, 'local training; som iteration=%d, alpha=%f, sigma=%f\n',...
+                local_learniter, alpha, sigma);
+        end
+
+        % select a random input
+        cm_now = randi(cmlen);
+
+        % compute the winner unit (c)
+        dc = realmax();
+        c = 0;
+        for i = 1:mlen
+            d = mvn_div_skl(cm(cmsel(cm_now)), m(i));
+            if (d < dc)
+                c = i;
+                dc = d;
+            end
+        end
+
+        for i = 1:mlen
+
+            e2dist = (grid(i).x - grid(c).x)^2 + (grid(i).y - grid(c).y)^2;
+            nkernel = alpha * exp(-e2dist/(2*sigma*sigma));
+            
+
+            try
+                r = bregman_combine_r(m(i), cm(cmsel(cm_now)), nkernel);
+                l = bregman_combine_l(m(i), cm(cmsel(cm_now)), nkernel);
+                
+                lrm = [mvn_new(l.cov, l.m), mvn_new(r.cov, r.m)];
+                sym = mvn_bregmancentroid_skl(lrm);
+                m(i).cov = sym.cov;
+                m(i).icov = sym.icov;
+                m(i).m = sym.m;
+
+            catch ex
+                fprintf(1, 'Skip this, this is dangerous (mainloop, i=%d)\n', i);
+                fprintf(1, 'Exception: %s\n', ex.message);
+                break;
+            end
+        end
+
+    end
+
+    % build the final grid
+    D = zeros(cmlen, mlen);
+    for i = 1:cmlen
+        fprintf(1, 'assignment iteration = %d\n', i);
+
+        dnn = realmax();
+        nn = 0;
+        for j = 1:mlen
+            D(i, j) = mvn_div_skl(cm(cmsel(i)), m(j));
+            if (D(i, j) < dnn)
+                dnn = D(i, j);
+                nn = j;
+            end
+        end
+        grid(nn).n = [grid(nn).n cmsel(i)];
+    end
+end
+
+
+function r = bregman_combine_r(x, y, ytheta)
+% compute right centroid mixture
+
+    r.m = (1-ytheta) * (x.icov * x.m) + (ytheta)*(y.icov * y.m);
+    r.cov = (1-ytheta) * (0.5 * x.icov) + (ytheta)*(0.5 * y.icov);
+    r.icov = 2 * r.cov;
+    r.cov = inv(r.icov);
+    r.m = r.cov * r.m;
+end
+
+function l = bregman_combine_l(x, y, ytheta)
+% compute left centroid mixture
+
+    l.m = (1-ytheta)*(x.m) + (ytheta)*(y.m);
+    l.cov = (1-ytheta)* (-(x.cov + x.m*x.m')) +...
+       (ytheta)*(-(y.cov + y.m*y.m'));
+    l.cov = -(l.cov + l.m*l.m');
+    l.icov = inv(l.cov);
+end
diff --git a/inst/mvn_test.m b/inst/mvn_test.m
new file mode 100644
index 0000000..36d22dc
--- /dev/null
+++ b/inst/mvn_test.m
@@ -0,0 +1,105 @@
+function [filenames, models_tc, models_oc] = mvn_test(testfile, t, tc_dim, oc_dim)
+%MVN_TEST  Load a testcollection and prepare for using with the mvn functions.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    data = load(testfile, 'data');
+    if (strcmp(t, 'me') == 1)
+        models_tc = struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        models_oc = [];
+        type = 1;
+    elseif (strcmp(t, 'ep') == 1)
+        models_tc = struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        models_oc = struct('fp', [], 'fpg', [], 'fpb', []);
+        type = 2;
+    elseif (strcmp(t, 'mots4') == 1)
+        models_tc = struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        models_oc = struct('fp', [], 'fpg', [], 'fpb', []);
+        type = 3;
+    elseif (strcmp(t, 'andre') == 1)
+        models_tc =  struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        models_oc = struct('op', []);
+        type = 4;
+    else
+        models_tc = struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        models_oc = struct('m', [], 'cov', [], 'logdet', [], 'icov', []);
+        type = 0;
+    end
+    filenames = [];
+    
+    c = 1;
+    ocd = 1:oc_dim;
+    tcd = 1:tc_dim;
+    
+    for i = 1:length(data.data.cm)
+        try
+            
+            if (type == 1)
+                mtc = mvn_new(data.data.cm{i}.cov, data.data.cm{i}.mu);
+                models_tc(c) = mtc;
+            elseif (type == 2)
+                mtc = mvn_new(data.data.cm{i}.cov, ...
+                    data.data.cm{i}.m);
+                mop.fp = data.data.cm{i}.fp;
+                mop.fpg = data.data.cm{i}.fpg;
+                mop.fpb = data.data.cm{i}.fp_bass;
+                
+                models_oc(c) = mop;
+                models_tc(c) = mtc;
+            elseif (type == 3)
+                mtc = mvn_new(data.data.cm{i}.co, ...
+                    data.data.cm{i}.m);
+                mop.fp = data.data.cm{i}.fp;
+                mop.fpg = data.data.cm{i}.fpg;
+                mop.fpb = data.data.cm{i}.fpb;
+                
+                models_oc(c) = mop;
+                models_tc(c) = mtc;
+                
+            elseif (type == 4)
+                mtc = mvn_new(data.data.cm{i}.tc.cov(tcd, tcd), ...
+                    data.data.cm{i}.tc.mu(tcd));
+                models_oc(c).op = data.data.cm{i}.op;
+                models_tc(c) = mtc;
+            else
+                mtc = mvn_new(data.data.cm{i}.tc.cov(tcd, tcd), ...
+                    data.data.cm{i}.tc.mu(tcd));
+                moc = mvn_new(data.data.cm{i}.oc.cov(ocd, ocd), ...
+                    data.data.cm{i}.oc.mu(ocd));
+                models_oc(c) = moc;
+                models_tc(c) = mtc;
+            end
+            
+            filenames{c} = data.data.filenames{i};
+            
+            c = c + 1;
+        catch eobj
+            %NYK, 2013: replaced the following block for Octave compatibility
+            %if (strcmp(eobj.identifier, 'mvn:cov'))
+            %    fprintf(2, 'Skipping model with invalid covariance: %d\n', i);
+            %elseif (strcmp(eobj.identifier, 'MATLAB:posdef'))
+            %    fprintf(2, ['Skipping model with non-positive definite ' ...
+            %        'covariance: %d\n'], i);
+            %else
+            %    rethrow(eobj);
+            %end
+            fprintf(2, 'Skipping model with invalid covariance: %d\n', i);
+        end
+    end
+    
+end
diff --git a/inst/mvn_traceprod.m b/inst/mvn_traceprod.m
new file mode 100644
index 0000000..ae74e3c
--- /dev/null
+++ b/inst/mvn_traceprod.m
@@ -0,0 +1,25 @@
+function [c] = mvn_traceprod(A, B)
+%MVN_TRACEPROD  Compute Matrix trace of the matrix product of two symmetric matrices a and b.
+%
+%   [c] = MVN_TRACEPROD(A, B) computes the trace of the symmetric matices
+%   c = trace(A*B) in an efficient way.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    c = A(:).'*B(:);
+end
diff --git a/inst/mvn_version.m b/inst/mvn_version.m
new file mode 100644
index 0000000..0cae4f9
--- /dev/null
+++ b/inst/mvn_version.m
@@ -0,0 +1,25 @@
+function [v] = mvn_version()
+%MVN_VERSION  
+%
+%   [v] = MVN_VERSION() Returns the version of MVN.
+
+%   (c) 2010-2011, Dominik Schnitzer, <dominik.schnitzer at ofai.at>
+%   http://www.ofai.at/~dominik.schnitzer/mvn
+%
+%   This file is part of the MVN Octave/Matlab Toolbox
+%   MVN is free software: you can redistribute it and/or modify
+%   it under the terms of the GNU General Public License as published by
+%   the Free Software Foundation, either version 3 of the License, or
+%   (at your option) any later version.
+%
+%   MVN is distributed in the hope that it will be useful,
+%   but WITHOUT ANY WARRANTY; without even the implied warranty of
+%   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+%   GNU General Public License for more details.
+%
+%   You should have received a copy of the GNU General Public License
+%   along with MVN.  If not, see <http://www.gnu.org/licenses/>.
+
+    v = 1;
+
+end

-- 
Alioth's /home/groups/pkg-octave/bin/git-commit-notice on /srv/git.debian.org/git/pkg-octave/octave-mvn.git



More information about the Pkg-octave-commit mailing list