changes:
-Added surround channel mapping API and capability
-New config file options
-misc updates and fixes
pkgsrc note: The format structure passed to ao_open_*() has grown a new
member ("matrix", for channel mapping). All client pkgs need to be
checked that it is at least zero-initialized.
changes:
-improved kiosk use
-Yellow location for valid SSL, red for invalid
-UI improvements
-bugfixes
pkgsrc change: Drop Linux conditional for installation if the
adblock config file. It seems to depend on the shared library file
extension which might be different than .so on some platforms, but
it is just a config file which doesn't hurt if it is not found.
-install some "style" definitions
-use "gmake" as default make tool -- the build process depends
on gnumake's "-w" flag (can be adjusted in project properties, but this
way it works out of the box)
bump PKGREVISION
CaboCha is a Japanese dependency analysis machine based on Support Vector
Machines. It is (89.29%) system that accuracy is the highest as a statistical
Japanese dependency analysis machine as of June, 2001. Moreover, definite
analytical algorithm (Cascaded Chunking Model) that doesn't do back-track is
adopted, and an efficient analysis can be done comparatively.
This package is ruby module for CaboCha.
CaboCha is a Japanese dependency analysis machine based on Support Vector
Machines. It is (89.29%) system that accuracy is the highest as a statistical
Japanese dependency analysis machine as of June, 2001. Moreover, definite
analytical algorithm (Cascaded Chunking Model) that doesn't do back-track is
adopted, and an efficient analysis can be done comparatively.
This package is python module for CaboCha.
CaboCha is a Japanese dependency analysis machine based on Support Vector
Machines. It is (89.29%) system that accuracy is the highest as a statistical
Japanese dependency analysis machine as of June, 2001. Moreover, definite
analytical algorithm (Cascaded Chunking Model) that doesn't do back-track is
adopted, and an efficient analysis can be done comparatively.
This package is perl module for CaboCha.
CaboCha is a Japanese dependency analysis machine based on Support Vector
Machines. It is (89.29%) system that accuracy is the highest as a statistical
Japanese dependency analysis machine as of June, 2001. Moreover, definite
analytical algorithm (Cascaded Chunking Model) that doesn't do back-track is
adopted, and an efficient analysis can be done comparatively.
YamCha is a generic, customizable, and open source text chunker oriented toward
a lot of NLP tasks, such as POS tagging, Named Entity Recognition, base NP
chunking, and Text Chunking. YamCha is using a state-of-the-art machine learning
algorithm called Support Vector Machines (SVMs), first introduced by Vapnik in
1995.
This package is ruby module for YamCha.
YamCha is a generic, customizable, and open source text chunker oriented toward
a lot of NLP tasks, such as POS tagging, Named Entity Recognition, base NP
chunking, and Text Chunking. YamCha is using a state-of-the-art machine learning
algorithm called Support Vector Machines (SVMs), first introduced by Vapnik in
1995.
This package is python module for YamCha.
YamCha is a generic, customizable, and open source text chunker oriented toward
a lot of NLP tasks, such as POS tagging, Named Entity Recognition, base NP
chunking, and Text Chunking. YamCha is using a state-of-the-art machine learning
algorithm called Support Vector Machines (SVMs), first introduced by Vapnik in
1995.
This package is perl module for YamCha.
YamCha is a generic, customizable, and open source text chunker oriented toward
a lot of NLP tasks, such as POS tagging, Named Entity Recognition, base NP
chunking, and Text Chunking. YamCha is using a state-of-the-art machine learning
algorithm called Support Vector Machines (SVMs), first introduced by Vapnik in
1995.
YamCha is exactly the same system which performed the best in the CoNLL2000
Shared Task, Chunking and BaseNP Chunking task.
==================================
New features and changes since 2.3
==================================
(1) Maude 2.4 provides an order-sorted Ax-unification algorithm for
all order-sorted theories (CSigma, E U Ax) such that:
- the signature Sigma is preregular modulo Ax;
- the axioms Ax associated to function symbols are as follows:
- there can be arbitrary function symbols and constants with
no equational attributes;
- the iter equational attribute can be declared for some unary
symbols;
- the comm or assoc comm attributes can be declared for some
binary function symbols, but then no other equational
attributes must be given for such symbols.
Explicitly excluded are theories with binary function symbols having
either: (i) the id:, left id:, or right id: attributes; or (ii) the
assoc attribute without the comm one; or (iii) a combination of (i)
and (ii).
(2) Unification is reflected in the META-LEVEL module by two descent
functions:
op metaUnify : Module UnificationProblem Nat Nat ~>
UnificationPair? [special (...)].
op metaDisjointUnify : Module UnificationProblem Nat Nat ~>
UnificationTriple? [special (...)].
(3) Statements (rule, equations and membership axioms) can now take a
print attribute. In print attribute mode, when a statement is executed
the items in its print attribute are printed, with variables taking
their value in the current substitution.
(4) Parsing of file names in the commands load, in, cd and pushd now
allows spaces using either of two syntactic conventions:
If the file name starts with " then all following characters will be
taken literally up to the terminating ", line feed or form feed.
If a file name starts with other than ", the following escape
sequences are recognized
\\ becomes \
\<space> becomes <space>
\" becomes "
(5) For operators in the C, CU, CI and CUI theories, if both arguments
are the same, the rewrite, srewrite and search commands and the model
checker will only consider one of the arguments for that step since
only one rewriting step is made per pass, the choice of argument is
irrelevant. This already happened for operators in the AC and ACU
theories. The frewrite command still always considers all arguments
even if they are identical since multiple rewriting steps can happen
in each pass.
(6) The GNU libsigsegv library is used to distinguigh between true
segmentation faults and stack overflows and so stack overflows are now
reported with an informative message.
(7) Several optimizations, bug fixes and improvements.
TinySVM is an implementation of Support Vector Machines (SVMs) [Vapnik 95],
[Vapnik 98] for the problem of pattern recognition. Support Vector Machines is a
new generation learning algorithms based on recent advances in statistical
learning theory, and applied to large number of real-world applications, such as
text categorization, hand-written character recognition.
Changes since 1.2 release:
- Try to fetch X86 CPU identification using "cpuid" instruction
- Detect Ubuntu version
- Only use 64-bit libraries when running on 64-bit kernel
- Fixes for builds with older versions of Visual C
- Dectect Windows 7
- Fix Garbage Collection crashes after calling an external function
- Fix HTTP w/ DOC/WatTCP
- Fix MinGW compliation
Changes in GNU Prolog version 1.3.1:
* add working sigaction detection to detect fault addr (e.g. Mac OS X)
* add gplc option --no-mult-warn
* add prolog flags suspicious_warning, multifile_warning
* detect integer underflow/overflow in the parser
* fix a memory leak in catch/3
* increase limits (MAX_VAR_NAME_LENGTH=1024 and MAX_VAR_IN_TERM=10240)
* add PL_INT_LOWEST_VALUE and PL_INT_GREATEST_VALUE to gprolog.h
* prefix all global symbols, constants and types with Pl_ PL_ Pl
* fix a bug in the byte-code due to new max number of atoms
* provide a minimal gprolog.h
* detect if struct sigcontext needs asm/sigcontext.h on linux
* modify gplc: --c-compiler also sets linker and --linker added
* port to x86_64/bsd - many thanks to:
David Holland <dholland@netbsd.org>
* fix problem using ebx as global reg (bug in gcc 4.3.2)
* fix a bug in is/2 with [X] (X should only be an integer)
* fix a bug with atoms '/*' '*/' and '%' (were not quoted)
* increase maximum number of atoms to 1048576 (2^20)
* increase default stack sizes (16Mb for heap, 8Mb for others)
* fix stack alignment for x86_64/Solaris
* include patch from Paul Eggert <eggert@cs.ucla.edu> for sparc/solaris8
* port to x86_64/Solaris - many thanks to:
Scott L. Burson <Scott@coral8.com>
* fix a bug in arithmetics (mod)
* fix a bug in the FD solver (under 64 bits machines)
Changelog:
Among other things, this release features gapless MP3 playback,
native PulseAudio support, faster startup, and much improved compilations
handling.
* cone/sgml/cone-folderindex.sgml (prompt): Mention the inn 2.5.x bug.
* cone/myreferences.H (m): Fix NULL ptr deref.
* cone/cursesmessage.C (nextLink): Fix wild pointer.
* libmail/copymessage.C (fail): Fix segfault if fetching the contents,
of the message being copied, fails.
* cone/cursesmessage.C (reformatAddLine): Clear the entire struct
to suppress warnings from valgrind.
* gcc 4.5 portability fixes.
* tcpd/libcouriergnutls.c (tls_connect): Fix bad call to
gnutls_server_name_set().
Changes 0.82:
* cone/curseseditmessage.C (getMarkedRegion): Portability fix (gcc 4.4.3).
* all: Some code cleanup.
Changes 0.81:
* cone/spellcheckerAspell.C: Do not set "lang" and "encoding" to empty values.
Changes 0.80:
* cone/libmail: Link with libidn if this library is installed. Added
getAddrAddr() and setAddrAddr() methods to mail::emailAddress that
use libidn, if installed, to decode/encode the hostname portion of the
email address.
* The GNU IDN library is now required to build Cone
