imon-Pierre Cadieux Eric S. Raymond Gilles Vollant and with the following additions to the disclaimer: There is no warranty against interference with your enjoyment of the library or against infringement. There is no warranty that our efforts or the library will fulfill any of your particular purposes or needs. This library is provided with all faults, and the entire risk of satisfactory quality, performance, accuracy, and effort is with the user. libpng versions 0.97, January 1998, through 1.0.6, March 20, 2000, are Copyright (c) 1998, 1999 Glenn Randers-Pehrson, and are distributed according to the same disclaimer and license as libpng-0.96, with the following individuals added to the list of Contributing Authors: Tom Lane Glenn Randers-Pehrson Willem van Schaik libpng versions 0.89, June 1996, through 0.96, May 1997, are Copyright (c) 1996, 1997 Andreas Dilger Distributed according to the same disclaimer and license as libpng-0.88, with the following individuals added to the list of Contributing Authors: John Bowler Kevin Bracey Sam Bushell Magnus Holmgren Greg Roelofs Tom Tanner libpng versions 0.5, May 1995, through 0.88, January 1996, are Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc. For the purposes of this copyright and license, "Contributing Authors" is defined as the following set of individuals: Andreas Dilger Dave Martindale Guy Eric Schalnat Paul Schmidt Tim Wegner The PNG Reference Library is supplied "AS IS". The Contributing Authors and Group 42, Inc. disclaim all warranties, expressed or implied, including, without limitation, the warranties of merchantability and of fitness for any purpose. The Contributing Authors and Group 42, Inc. assume no liability for direct, indirect, incidental, special, exemplary, or consequential damages, which may result from the use of the PNG Reference Library, even if advised of the possibility of such damage. Permission is hereby granted to use, copy, modify, and distribute this source code, or portions hereof, for any purpose, without fee, subject to the following restrictions: 1. The origin of this source code must not be misrepresented. 2. Altered versions must be plainly marked as such and must not be misrepresented as being the original source. 3. This Copyright notice may not be removed or altered from any source or altered source distribution. The Contributing Authors and Group 42, Inc. specifically permit, without fee, and encourage the use of this source code as a component to supporting the PNG file format in commercial products. If you use this source code in a product, acknowledgment is not required but would be appreciated. A "png_get_copyright" function is available, for convenient use in "about" boxes and the like: printf("%s",png_get_copyright(NULL)); Also, the PNG logo (in PNG format, of course) is supplied in the files "pngbar.png" and "pngbar.jpg (88x31) and "pngnow.png" (98x31). Libpng is OSI Certified Open Source Software. OSI Certified Open Source is a certification mark of the Open Source Initiative. Glenn Randers-Pehrson glennrp at users.sourceforge.net April 29, 2008 **************************** protobuf **************************** Copyright 2008, Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.   Code generated by the Protocol Buffer compiler is owned by the owner of the input file used when generating it. This code is not standalone and requires a support library to be linked with it. This support library is itself covered by the above license. **************************** re2 **************************** // Copyright (c) 2009 The RE2 Authors. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission.   The compilation and test files are licensed under the MIT license, but the single-file libraries themselves are in the public domain (free for use and modification for any purpose without legal friction). The MIT License (MIT) Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. **************************** stl **************************** SGI STL The STL portion of GNU libstdc++ that is used with gcc3 and gcc4 is licensed under the GPL, with the following exception: # As a special exception, you may use this file as part of a free software # library without restriction. Specifically, if other files instantiate # templates or use macros or inline functions from this file, or you compile # this file and link it with other files to produce an executable, this # file does not by itself cause the resulting executable to be covered by # the GNU General Public License. This exception does not however # invalidate any other reasons why the executable file might be covered by # the GNU General Public License. **************************** tinyxml **************************** TinyXml is released under the zlib license: This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. **************************** tz **************************** With a few exceptions, all files in the tz code and data (including this one) are in the public domain. The exceptions are tzcode's date.c, newstrftime.3, and strftime.c, which contain material derived from BSD and which use the BSD 3-clause license. **************************** utf **************************** UTF-8 Library The authors of this software are Rob Pike and Ken Thompson. Copyright (c) 1998-2002 by Lucent Technologies. Permission to use, copy, modify, and distribute this software for any purpose without fee is hereby granted, provided that this entire notice is included in all copies of any software which is or includes a copy or modification of this software and in all copies of the supporting documentation for such software. THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. **************************** xmpmeta **************************** xmpmeta. A fast XMP metadata parsing and writing library. Copyright 2016 Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.   **************************** Xorg **************************** The following is the 'standard copyright' agreed upon by most contributors, and is currently the canonical license preferred by the X.Org Foundation. This is a slight variant of the common MIT license form published by the Open Source Initiative at http://www.opensource.org/licenses/mit-license.php Copyright holders of new code should use this license statement where possible, and insert their name to this list. Please sort by surname for people, and by the full name for other entities (e.g. Juliusz Chroboczek sorts before Intel Corporation sorts before Daniel Stone). See each individual source file or directory for the license that applies to that file. Copyright (C) 2003-2006,2008 Jamey Sharp, Josh Triplett Copyright © 2009 Red Hat, Inc. Copyright 1990-1992,1999,2000,2004,2009,2010 Oracle and/or its affiliates. All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ---------------------------------------------------------------------- The following licenses are 'legacy' - usually MIT/X11 licenses with the name of the copyright holder(s) in the license statement: Copyright 1984-1994, 1998 The Open Group Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of The Open Group shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from The Open Group. X Window System is a trademark of The Open Group. ---------------------------------------- Copyright 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1994, 1996 X Consortium Copyright 2000 The XFree86 Project, Inc. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the X Consortium shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the X Consortium. Copyright 1985, 1986, 1987, 1988, 1989, 1990, 1991 by Digital Equipment Corporation Portions Copyright 1990, 1991 by Tektronix, Inc. Permission to use, copy, modify and distribute this documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appears in all copies and that both that copyright notice and this permission notice appear in all copies, and that the names of Digital and Tektronix not be used in in advertising or publicity pertaining to this documentation without specific, written prior permission. Digital and Tektronix makes no representations about the suitability of this documentation for any purpose. It is provided ``as is'' without express or implied warranty. ---------------------------------------- Copyright (c) 1999-2000 Free Software Foundation, Inc. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE FREE SOFTWARE FOUNDATION BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the Free Software Foundation shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the Free Software Foundation. ---------------------------------------- Code and supporting documentation (c) Copyright 1990 1991 Tektronix, Inc. All Rights Reserved This file is a component of an X Window System-specific implementation of Xcms based on the TekColor Color Management System. TekColor is a trademark of Tektronix, Inc. The term "TekHVC" designates a particular color space that is the subject of U.S. Patent No. 4,985,853 (equivalent foreign patents pending). Permission is hereby granted to use, copy, modify, sell, and otherwise distribute this software and its documentation for any purpose and without fee, provided that: 1. This copyright, permission, and disclaimer notice is reproduced in all copies of this software and any modification thereof and in supporting documentation; 2. Any color-handling application which displays TekHVC color cooordinates identifies these as TekHVC color coordinates in any interface that displays these coordinates and in any associated documentation; 3. The term "TekHVC" is always used, and is only used, in association with the mathematical derivations of the TekHVC Color Space, including those provided in this file and any equivalent pathways and mathematical derivations, regardless of digital (e.g., floating point or integer) representation. Tektronix makes no representation about the suitability of this software for any purpose. It is provided "as is" and with all faults.  IN NO EVENT SHALL TEKTRONIX BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA, OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR THE PERFORMANCE OF THIS SOFTWARE. ---------------------------------------- (c) Copyright 1995 FUJITSU LIMITED This is source code modified by FUJITSU LIMITED under the Joint Development Agreement for the CDE/Motif PST. ---------------------------------------- Copyright 1992 by Oki Technosystems Laboratory, Inc. Copyright 1992 by Fuji Xerox Co., Ltd. Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Oki Technosystems Laboratory and Fuji Xerox not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Oki Technosystems Laboratory and Fuji Xerox make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1990, 1991, 1992, 1993, 1994 by FUJITSU LIMITED Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of FUJITSU LIMITED not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. FUJITSU LIMITED makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright (c) 1995 David E. Wexelblat. All rights reserved Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL DAVID E. WEXELBLAT BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of David E. Wexelblat shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from David E. Wexelblat. ---------------------------------------- Copyright 1990, 1991 by OMRON Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name OMRON not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. OMRON makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1985, 1986, 1987, 1988, 1989, 1990, 1991 by Digital Equipment Corporation Portions Copyright 1990, 1991 by Tektronix, Inc Rewritten for X.org by Chris Lee<EMAIL_ADDRESS>Permission to use, copy, modify, distribute, and sell this documentation for any purpose and without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. Chris Lee makes no representations about the suitability for any purpose of the information in this document. It is provided \`\`as-is'' without express or implied warranty. ---------------------------------------- Copyright 1993 by Digital Equipment Corporation, Maynard, Massachusetts, Copyright 1994 by FUJITSU LIMITED Copyright 1994 by Sony Corporation All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of Digital, FUJITSU LIMITED and Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.  ---------------------------------------- Copyright 1991 by the Open Software Foundation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Open Software Foundation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Open Software Foundation makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1990, 1991, 1992,1993, 1994 by FUJITSU LIMITED Copyright 1993, 1994 by Sony Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of FUJITSU LIMITED and Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. FUJITSU LIMITED and Sony Corporation makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright (c) 1993, 1995 by Silicon Graphics Computer Systems, Inc. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Silicon Graphics not be used in advertising or publicity pertaining to distribution of the software without specific prior written permission. Silicon Graphics makes no representation about the suitability of this software for any purpose. It is provided "as is" without any express or implied warranty.  IN NO EVENT SHALL SILICON GRAPHICS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ---------------------------------------- Copyright 1991, 1992, 1993, 1994 by FUJITSU LIMITED Copyright 1993 by Digital Equipment Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of FUJITSU LIMITED and Digital Equipment Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. FUJITSU LIMITED and Digital Equipment Corporation makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1992, 1993 by FUJITSU LIMITED Copyright 1993 by Fujitsu Open Systems Solutions, Inc. Copyright 1994 by Sony Corporation Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of FUJITSU LIMITED, Fujitsu Open Systems Solutions, Inc. and Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. FUJITSU LIMITED, Fujitsu Open Systems Solutions, Inc. and Sony Corporation make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty. FUJITSU LIMITED, FUJITSU OPEN SYSTEMS SOLUTIONS, INC.  ---------------------------------------- Copyright 1987, 1988, 1990, 1993 by Digital Equipment Corporation, Maynard, Massachusetts, All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Digital not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.  ---------------------------------------- Copyright 1993 by SunSoft, Inc. Copyright 1999-2000 by Bruno Haible Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of SunSoft, Inc. and Bruno Haible not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. SunSoft, Inc. and Bruno Haible make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1991 by the Open Software Foundation Copyright 1993 by the TOSHIBA Corp. Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of Open Software Foundation and TOSHIBA not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Open Software Foundation and TOSHIBA make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1988 by Wyse Technology, Inc., San Jose, Ca., All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name Wyse not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.  ---------------------------------------- Copyright 1991 by the Open Software Foundation Copyright 1993, 1994 by the Sony Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of Open Software Foundation and Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Open Software Foundation and Sony Corporation make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1992, 1993 by FUJITSU LIMITED Copyright 1993 by Fujitsu Open Systems Solutions, Inc. Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of FUJITSU LIMITED and Fujitsu Open Systems Solutions, Inc. not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. FUJITSU LIMITED and Fujitsu Open Systems Solutions, Inc. makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty. FUJITSU LIMITED AND FUJITSU OPEN SYSTEMS SOLUTIONS, INC.  AND FUJITSU LIMITED BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ---------------------------------------- Copyright 1993, 1994 by Sony Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Sony Corporation makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1986, 1998 The Open Group Copyright (c) 2000 The XFree86 Project, Inc. Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE X CONSORTIUM OR THE XFREE86 PROJECT BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the X Consortium or of the XFree86 Project shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the X Consortium and the XFree86 Project. ---------------------------------------- Copyright 1990, 1991 by OMRON Corporation, NTT Software Corporation, and Nippon Telegraph and Telephone Corporation Copyright 1991 by the Open Software Foundation Copyright 1993 by the FUJITSU LIMITED Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of OMRON, NTT Software, NTT, and Open Software Foundation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. OMRON, NTT Software, NTT, and Open Software Foundation make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 1988 by Wyse Technology, Inc., San Jose, Ca, Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts, All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name Digital not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.  ---------------------------------------- Copyright 1991, 1992 by Fuji Xerox Co., Ltd. Copyright 1992, 1993, 1994 by FUJITSU LIMITED Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Fuji Xerox, FUJITSU LIMITED not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Fuji Xerox, FUJITSU LIMITED make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 2006 Josh Triplett Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ---------------------------------------- (c) Copyright 1996 by Sebastien Marineau and Holger Veit<EMAIL_ADDRESS><EMAIL_ADDRESS>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL HOLGER VEIT BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of Sebastien Marineau or Holger Veit shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from Holger Veit or Sebastien Marineau. ---------------------------------------- Copyright 1990, 1991 by OMRON Corporation, NTT Software Corporation, and Nippon Telegraph and Telephone Corporation Copyright 1991 by the Open Software Foundation Copyright 1993 by the TOSHIBA Corp. Copyright 1993, 1994 by Sony Corporation Copyright 1993, 1994 by the FUJITSU LIMITED Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of OMRON, NTT Software, NTT, Open Software Foundation, and Sony Corporation not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. OMRON, NTT Software, NTT, Open Software Foundation, and Sony Corporation make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright 2000 by Bruno Haible Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Bruno Haible not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Bruno Haible makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright © 2003 Keith Packard Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Keith Packard not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Keith Packard makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright (c) 2007-2009, Troy D. Hanson All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.   ---------------------------------------- Copyright 1992, 1993 by TOSHIBA Corp. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of TOSHIBA not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. TOSHIBA make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  ---------------------------------------- Copyright IBM Corporation 1993 All Rights Reserved License to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of IBM not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission.  ---------------------------------------- Copyright 1990, 1991 by OMRON Corporation, NTT Software Corporation, and Nippon Telegraph and Telephone Corporation Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the names of OMRON, NTT Software, and NTT not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. OMRON, NTT Software, and NTT make no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.  In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Jean-loup Gailly Mark Adler<EMAIL_ADDRESS><EMAIL_ADDRESS>If you use the zlib library in a product, we would appreciate *not* receiving lengthy legal documents to sign. The sources are provided for free but without warranty of any kind. The library has been entirely written by Jean-loup Gailly and Mark Adler; it does not include third-party code. If you redistribute modified sources, we would appreciate that you include in the file ChangeLog history information documenting your changes. Please read the FAQ for more information on the distribution of modified source versions. (extracted from match.S, for match.S only) Copyright (C) 1998, 2007 Brian Raiter<EMAIL_ADDRESS>This software is provided 'as-is', without any express or implied warranty. In no event will the author be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. **************************** googleurl **************************** Copyright 2007, Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.   ------------------------------------------------------------------------------- The file url_parse.cc is based on nsURLParsers.cc from Mozilla. This file is licensed separately as follows: The contents of this file are subject to the Mozilla Public License Version 1.1 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.mozilla.org/MPL/ Software distributed under the License is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the specific language governing rights and limitations under the License. The Original Code is mozilla.org code. The Initial Developer of the Original Code is Netscape Communications Corporation. Portions created by the Initial Developer are Copyright (C) 1998 the Initial Developer. All Rights Reserved. Contributor(s): Darin Fisher (original author) Alternatively, the contents of this file may be used under the terms of either the GNU General Public License Version 2 or later (the "GPL"), or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), in which case the provisions of the GPL or the LGPL are applicable instead of those above. If you wish to allow use of your version of this file only under the terms of either the GPL or the LGPL, and not to allow others to use your version of this file under the terms of the MPL, indicate your decision by deleting the provisions above and replace them with the notice and other provisions required by the GPL or the LGPL. If you do not delete the provisions above, a recipient may use your version of this file under the terms of any one of the MPL, the GPL or the LGPL. ------------------------------------------------------------------------------- The file icu_utf.cc is from IBM. This file is licensed separately as follows: ICU License - ICU 1.8.1 and later COPYRIGHT AND PERMISSION NOTICE Copyright (c) 1995-2009 International Business Machines Corporation and others All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, provided that the above copyright notice(s) and this permission notice appear in all copies of the Software and that both the above copyright notice(s) and this permission notice appear in supporting documentation.  IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization of the copyright holder. **************************** Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. **************************** jsoncpp **************************** The JsonCpp library's source code, including accompanying documentation, tests and demonstration applications, are licensed under the following conditions... The author (Baptiste Lepilleur) explicitly disclaims copyright in all jurisdictions which recognize such a disclaimer. In such jurisdictions, this software is released into the Public Domain. In jurisdictions which do not recognize Public Domain property (e.g. Germany as of 2010), this software is Copyright (c) 2007-2010 by Baptiste Lepilleur, and is released under the terms of the MIT License (see below). In jurisdictions which recognize Public Domain property, the user of this software may choose to accept it either as 1) Public Domain, 2) under the conditions of the MIT License (see below), or 3) under the terms of dual Public Domain/MIT License conditions described here, as they choose. The MIT License is about as close to Public Domain as a license can get, and is described in clear, concise terms at: http://en.wikipedia.org/wiki/MIT_License The full text of the MIT License follows: ======================================================================== Copyright (c) 2007-2010 Baptiste Lepilleur Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ======================================================================== (END LICENSE TEXT) The MIT license is compatible with both the GPL and commercial software, affording one all of the rights of Public Domain with the minor nuisance of being required to keep the above copyright notice and license text in the source code. Note also that by accepting the Public Domain "license" you can re-license your copy using whatever license you like. **************************** libwebp **************************** Copyright (c) 2010, Google Inc. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.


Home
Products
About
Contact
Account
Give Your World
A New Look!


The xsl:element
instruction is used to create an output element
whose name might be calculated at run-time.
The element has a mandatory attribute, name
, which is the name of the generated element.
The name attribute is an attribute value template, so it may contain string expressions inside
curly braces.
The attributes of the generated element are defined by subsequent xsl:attribute
elements. The
content of the generated element is whatever is generated between the <xsl:element>
and
</xsl:element>
tags.
Additionally, attributes of the generated element can be defined by reference to a named attribute set. The optional use-attribute-sets attribute contains a white-space-separated list of attribute set names. They are applied in the order given: if the same attribute is generated more than once, the later value always takes precedence.
For example, the following code creates a <FONT> element with several attributes:
<xsl:element name="FONT">
<xsl:attribute name="SIZE">4</xsl:attribute>
<xsl:attribute name="FACE">Courier New</xsl:attribute>
Some output text
</xsl:element>
A new attribute type-annotation
is available in XSLT 2.0. This indicates the
data type of the value of the element. In Saxon 7.3, the value must be a built-in type defined
in XML Schema, for example xs:integer
or xs:date
. Type annotations
are only accessible if the attribute is added to a temporary tree that specifies
type-information="preserve"
. The value given to the element must be a string
that conforms to the rules for the data type, as defined in XML Schema. In particular
this means that the element must not have any element children.


Instructions:
In this exercise, your task is to run the build-heap algorithm on the heap. The min-heap is visualized both as a binary tree and array and the exercise can be completed by swapping keys in either visualization. You can swap two elements by first clicking on one element and then another.


All Packages Class Hierarchy This Package Previous Next Index
When used as an element screener, check should return false if the element should not be allowed in the collection, in which case any attempted add or replace operation will raise an exception. Use of screened collections is a simple way to dynamically ensure that all elements have some desired property.
public abstract boolean predicate(Object obj)
All Packages Class Hierarchy This Package Previous Next Index


Bacon ipsum dolor amet leberkas andouille frankfurter jerky strip steak, pastrami turkey biltong sirloin. Tur
key turducken bacon, chuck spare ribs porchetta ham shankle landjaeger bri
sket venison fatback short ribs pork loin biltong. Ball tip shoulder spare ribs, tenderloin strip steak ribeye biltong tongue ham ham hock leberkas.  Tenderloin turkey beef, beef ribs t-bone chicken pancetta cow landjaeger. Ball tip jerky shankle sirloin drumstick t-bone. Pancetta tongue rump shankle short loin pork ham sirl
oin chuck filet mignon flank picanha swine.


Journey In Kerala
Home
(current)
District
Login
Sign Up
LET'S BEGIN
go
Kerala's most visited places
ERAVIPURAM NATIONAL PARK
..click to visit..
ATHIRAPILLI WATERFALLS
..click to visit..
VARKALA BEACH
..click to visit..
Previous
Next


Far curiosity incommode now led smallness allowance. Favour bed assure son things yet. She consisted consulted elsewhere happiness disposing household any old the. Widow downs you new shade drift hopes small. So otherwise commanded sweetness we improving. Instantly by daughters resembled unwilling principle so middleton. Fail most room even gone her end like. Comparison dissimilar unpleasant six compliment two unpleasing any add. Ashamed my company thought wishing colonel it prevent he in. Pretended residence are something far engrossed old off. Possession her thoroughly remarkably terminated man continuing. Removed greater to do ability. You shy shall while but wrote marry. Call why sake has sing pure. Gay six set polite nature worthy. So matter be me we wisdom should basket moment merely. Me burst ample wrong which would mr he could. Visit arise my point timed drawn no. Can friendly laughter goodness man him appetite carriage. Any widen see gay forth alone fruit bed.
CSS JAVA HTML 5Hello world! This is HTML5 Boilerplate.


Hello! My name is Ostyn, and I am the back end lead. I am a senior at SFSU trying to complete my degree in computer science by 2022. A few of my hobbies include anime, games, traveling, and martial arts.


· · ·
Active Recall
- What is a SLN?
- What do the nodes, connections and weights represent in a SLN graph?
- What are the types of graphs used to represent information in SLN?
Introduction
- An SLN is a type of social network between student, instructors and modules of learning. The network consists of dynamics of learning behaviour over a variety of graphs that represent the relationships among people and processes involved in learning
Characteristics of SLN
- People in network learn through interaction.
- Consists of functionality models and graph-theoretic models.
- Nodes represent learners, learning concepts, or both learners and concepts.
- Links represent the connection between the nodes.
- Links can be undirected to denote similarity or directed to denote flow of information.
- Link weights gives magnitude to the connections extracted through some network measurements.
Applications for SLN
- Massive increase in popularity of MOOCs over the past decades has led to access of unprecedented data that can be easily used in the context of SLNs. Among these data, the discussion forums are of utmost importance as they are the primary means for interaction among students or between students and instructors and help extract SLNs.
- The blended learning offered by FLIP that combines the elements of online and traditional instruction is also gaining popularity. In this system, watching the lectures online becomes homework and class time is used for discussions instead.
- In the last decade, there has also been a steady rise in the popularity of Q&A Sites which have emerged with complementary search engines that allows users to enter questions in NLP format.
1. MOOCs Discussion Forums
- Similar to Q&A sites but have a different set of terminologies.
- Each course has a discussion forum (hierarchy 1). Discussion forum comprises of threads (hierarchy 2): the first post is by the creator of thread followed by comments (hierarchy 3), hence leading to a 3-level hierarchy.
- A user interacting with these forums has one of following options:
- Create a thread
- Create a post
- Comment on an existing post
- When threads are created, each forum allows annotation of these threads with a number categories. These categories are often inconsistent as there is no effective mechanism to force learners to abide by them consistently.
- Posts and comments can also receive up votes and down votes from users and staff.
2. FLIP
- The interaction in these classes can be used to extract the SLN as the structure of posts and comments here would resemble that of MOOCs but would be different on the following accounts:
- Size and sparsity: smaller number of learners and denser connectivity among them.
- Informational vs conversational discussions: While MOOC discussions are more conversational in nature, SLN from FLIP would typically not include conversational discussions because students can talk informally outside the class and also because the discussions are presided over by an instructor.
3. Q&A Sites
- Q&A sites allow the following functions to it’s users:
- post question
- answer question
- comment on answer
- up/down vote post
- allow asker to choose the best or acceptable answer
- for quality assurance there are points associated with receiving up or down votes.
- Major differences can be seen between SLNs from such sites and sites from educational settings:
- Incentive structure: well-defined automated set of incentives to encourage participation. These may or may not be a part of conversation in MOOCs or FLIP, more so because it is not a scalable concept for these forums as participation in MOOCs and FLIP can not be pushed for assessment of student academically.
- Broader concept list: information propagated in an SLN for a course will be limited to materials associated with the subject. Also each course has it’s own forum where only the students enrolled can participate. Q&A sites have some focal specificity but typically one can expect the number of concepts emerging in these SLNs to be much more broader.
- Single learning modality: In a Q&A site, SLN is the only means of learning, whereas in an educational setting it is one of the four modalities: lecture videos, assessment and text resources.
Types of SLN Graphs
These are the most commonly used graphs but are not comprehensive.
1. Undirected graph among learners
- Nodes represent learners
- Undirected links indicate the presence or absence of some characteristics between them. Properties could be age, geographic location, education level, whether or not they have interacted etc.
- For nodes \(i\) and \(j\), one can say for example,
- \(prop_k(i,j)\) is a binary variable that is 1 iff \(i\) and \(j\) satisfy property \(k\) in set of properties \(K\),
- \(P \leq |K|\) is a threshold constant i.e. node \(i\) and \(j\) are connected if and only if they both satisfy at least \(P\) criiteria specified in \(K\).
2. Directed graph among learners
- Used to note flow of information in the SLN.
- A directional link frok \(i\) to \(j\) represents an answer by \(j\) to a question posted by \(i\). Several restrictions can be added to this directional flow e.g. include only “best answers” given.
- It could be a multi-graph where there is more than one link from \(i\) to \(j\) since learners can ask and answer more than one question each.
3. Undirected graph among learners and concepts
- Nodes are used to represent both the learners as well as the concepts.
- Key concepts are extracted in a number of ways:
- running textual analysis to find keywords in discussions
- using syllabus specified by the instructors
- Such graphs are generally bipartite graphs between learners and concepts.
- A setting similar to \eqref{1} represents this graph, but each property \(k\) represent a condition on the participation of user \(i\) in concept \(j\).
4. Directed graph among learners and concepts
- To depict structure of interactions in more details.
- Concept nodes are used and each question or post by a learner is handled separately, which allows tow sets of links for each post: \((i_0, j) \in G\) for learner \(i_0\) who makes the initial post, and \((j, i_l) \in G\) for each learner \(i_l\) who commented on \(j\).
- In a forum where up/down votes are allowed, these links can be weighted to match the net votes obtained.
Research Objectives
1. Predictions
- Performance: ability to predict performance on assessments - homework, quiz, or exam questions - a student has not taken.
- Drop-off rate: predict drop-off rates of a course. This could be for an individual student or for the volume of participation in the course as a whole. Metrics on interest in such a case would be the completion rate of assignments, lecture videos, or rate of involvement in discussion forums.
2. Recommendations
- Courses and topics: to help students locate courses of interests based on their interactions with the enrolled courses. This presents an opportunity to improve the learning experience by recommending new courses and redirecting to relevant discussion forums.
- Study buddies: to help students locate study partners over MOOCs where the number of students participating can vary in terms of engagement, interests, demographics, geography etc.
Recommendation algorithms could focus on similarities or, more importantly dissimilarities between users. For example, a learner who actively engages on discussion forums can be paired with one who is struggling in those topics.
3. Peer-grading
- In MOOCs, generally the teacher-to-student ratio is very small. As a result, it would be infeasible for a teaching staff to manually grade each submission.
- This is generally tackled by only giving away machine gradable homework or exams, such as MCQs. But this limits the variety and quality of questions that can be posed.
- A different approach would be where students score each others work. This method lacks efficacy so far, because:
- different students have different grading quality
- time commitment is required for grading
- Structure of SLN might help in locating quality-graders for each assignment related to a specific topic.
4. Personalization
- Online education poses the question of trade-off between efficacy and scale in learning. It is statistically seen that only 10% of students enrolling in a MOOC ever complete the courses.
- The ineffectiveness of MOOCs can be because of the following reasons:
- teacher-to-student ratio is very low
- learning is asynchronous
- student population is very diverse and hard to personalize
- Advance technology is required for course individualization, to lift tradeoff curve and enable effective learning environment at massive scales rather than having a one-size-fits-all online course.
- The information stored in SLNs can play a key role in such adaptation to become a part of learning experience.
- The key components of such an indivualization effort can be seen in the flowchart in Fig-1.
- Behavioural measurements: measurement of user behaviour while engaging with course material, e.g. video watching trajectory (pauses and jumps) can be captured, information that user enters in a discussion forum can also be collected.
- Data analytics: use machine learning techniques to generate a low-dimensional model of the high-dimensional process of learning. The latent space can be:
- discovered throught data mining
- defined in advance in terms of author-specified learning features
- Content/presentation adaptation: based on the analysis, user’s updated profile dictates decisions on what content will be presented next and how it will be presented, e.g. different versions of text and video may be presented.
Methodologies
1. Data Collection
- There are two basic modes of data collections, both with pros and cons:
- Use existing data: various open online course offerings over the past years remain open even after the sessions end and gives access to the discussion forums etc. Similary the SLN data from Q&A portals is accessible through the respective websites. This data can easily be crawled and scraped by writing scripts to extract the information from the pages. Major drawbacks of this methodology are:
- no opportunity to excite the state of SLN formation for subsequent data analysis
- only data on open courses is available
- public data is only accessible upto a certain measurement granularity
- Generate new data: To overcome the cons of earlier method, one can collaborate with the educators. Or alternatively, a team could invest resources in creating a brand new online education platform to host courses for a number of instructors.
- Use existing data: various open online course offerings over the past years remain open even after the sessions end and gives access to the discussion forums etc. Similary the SLN data from Q&A portals is accessible through the respective websites. This data can easily be crawled and scraped by writing scripts to extract the information from the pages. Major drawbacks of this methodology are:
2. Analysis
- This approach varies widely based on the research objective being tackled and generally involves large-scale machine learning methods.
- Linear regression models can be used to determine which course properties are correlated with learner participation in the forums, which can be quantified using the number of posts that appeared each day for each course in the dataset.
- Using user-quiz pair matrix, algorithms can be trained:
- baseline predictor for solving least square optimization to minimize error in terms of student and quiz biases.
- neighbourhood predictorthat extends the baseline to leverage student-student and quiz-quiz similarities
Conclusions
- SLN data from the online interactions can lead to tracking of information in the network that can assist various objectives that lead to better learning outcomes.
REFERENCES:
· · ·


HelpTicket
- allows help tickets to be read in to this tree using comparatorspublic class BinarySearchTree<HelpTicket extends edu.ncsu.csc316.customer_service.data.HelpTicket>
extends java.lang.Object
| Constructor and Description |
|---|
BinarySearchTree()
Sets the root to null initially
|
| Modifier and Type | Method and Description |
|---|---|
void |
deleteCustomer(edu.ncsu.csc316.customer_service.data.Customer customer)
Deletes the node of the given customer
|
java.lang.String |
inOrder()
Creates a list of in order help tickets from the tree
|
java.lang.String |
inOrder(edu.ncsu.csc316.customer_service.tree.BinarySearchTree.Node root)
Creates an in order list of help tickets in the tree
|
void |
insert(HelpTicket ticket)
Inserts a specified help ticket into the tree
|
boolean |
isEmpty()
Checks if the root is empty
|
int |
lookUpCustomer(edu.ncsu.csc316.customer_service.data.Customer customer,
int steps)
Looks up a help ticket based on the specified customer
|
HelpTicket |
lookUpTicket(edu.ncsu.csc316.customer_service.data.Customer customer)
Looks up a ticket based on the user who submitted it
|
boolean |
searchForCustomer(edu.ncsu.csc316.customer_service.data.Customer customer)
Searches for the specified customer's ticket
|
int |
size()
Gets the size of the tree
|
public boolean isEmpty()
public void insert(HelpTicket ticket)
ticket
- the ticket to be insertedpublic void deleteCustomer(edu.ncsu.csc316.customer_service.data.Customer customer)
customer
- the customer to deletepublic boolean searchForCustomer(edu.ncsu.csc316.customer_service.data.Customer customer)
customer
- the customer being searched forpublic int lookUpCustomer(edu.ncsu.csc316.customer_service.data.Customer customer, int steps)
customer
- the customer specifiedsteps
- the steps to take in line from where the customer ispublic HelpTicket lookUpTicket(edu.ncsu.csc316.customer_service.data.Customer customer)
customer
- the customer who submitted the ticketpublic java.lang.String inOrder()
public int size()
public java.lang.String inOrder(edu.ncsu.csc316.customer_service.tree.BinarySearchTree.Node root)
root
- the root to start with


May 15 - 16, 2019
Viña del Mar, Chile
Eleven teams from nine economies brought their best ideas to the 2019 APEC App Challenge to help women entrepreneurs get online and thrive
During APEC in 2019, many high-level discussions will take place concerning the role of the digital economy as a driver of development and the ways that digital tools can help make more opportunities available to micro and small enterprises, particularly those owned by women. This year, APEC Chile’s 2019 agenda places a special emphasis on women and the economy and prioritizes initiatives that will help empower women and women-owned businesses. APEC 2019 will also emphasize the role that digital tools can play in creating better jobs, wages, and quality of life for people at every level of society.
The 2019 APEC App Challenge invites participants to use their software development and design skills to connect female entrepreneurs across the region to investment, skills, and people. The challenge will include three components: (1) a mechanism to expose the ideas of female entrepreneurs to potential investors; (2) links to existing information and courses to help female entrepreneurs build their businesses online; and (3) a mechanism to link female entrepreneurs to mentors across APEC economies.
The 2019 APEC App Challenge will use Internet technologies to help women expand their knowledge of business best practices and connect with investors and mentors. Successful solutions will develop features that can: (1) expose the ideas of female entrepreneurs to potential investors; (2) link women entrepreneurs to existing information and courses which can help them build their business online; and (3) connect female entrepreneurs to mentors across APEC economies. App Challenge participants will build new mobile and web tools that address these issues either through entirely new solutions or by enhancing the impact of existing platforms and tools that already operate at scale in the region.
Eligible teams must be nationals and/or residents of APEC economies. Teams must consist of two individuals, and team members may not be replaced after selection as finalists. All finalists are required to be in Chile for the App Challenge on May 15 and 16, 2019.
Finalists will retain full ownership of the products they create during the App Challenge. However, under the terms of the challenge, APEC will have specified usage and branding rights.
Participants do not need to define or build any part of their intended solution at the time of application. However, applicants will be evaluated based on their technical competence, understanding of the needs of small enterprises, willingness and ability to take a product to market, and willingness to do user research and analysis.
Participants will demonstrate their work before a panel of expert judges who will select a first, second, and third prize winner. The top three teams will receive cash prizes of:
The first prize winners will be recognized at the APEC MRT Symposium on May 17th alongside senior leadership from the government of Chile and the APEC Secretariat. An official award ceremony may take place at an APEC Symposium event attended by economic leaders and international press corps.
All finalists will receive an all-expenses-paid trip to Chile for the APEC App Challenge event. Other fun and interesting prizes will be announced closer to the date of the event.


Create Your CRM Get your free unique internet address https:// .mycloud.com Get started with your free account Login via Twitter Login via facebook OR +971 +972 +198 +701 Select job type Designer Manager Accaunting Create Account Have an account? Log In
Javanile CI/CD We are an Open Source Factory that go-ahead. Our mission is providing tools and solutions to make the software development process easier Javanile.org


Your Subscription Service includes a domain and hosting for your website, an email address at your domain, file storage, SSL security, and access to services that provide real-time analytics, a blog, and online forms. The website's initial design, build and unlimited changes to your website are all included. Please note that changes to your website may take up to 2 weeks to complete. If JoshFrankl.in estimates that a requested change requires longer than 2 weeks to complete, you will be notified.
First Year RequirementThe first year of your subscription service must be paid up front. An invoice of $828 (for the "Website" plan) or $1188 (for the "Web App" plan) (plan details available here) will be sent and must be paid before your website goes live. After the first year, you may continue paying invoices either monthly or yearly.
Right to WithdrawJoshFrankl.in has the right to cancel subscription service plans at anytime. You will be refunded for the current month at the time of cancellation. If the cancellation occurs during the year after paying a yearly invoice, you will be refunded for the current month plus all months left in the year. For example, if your yearly invoice started in January and the cancellation occurred in May, you will be refunded for 8 months, not 7. You will NOT be refunded if you are the one who decides to cancel the subscription service.
Ownership After CancelationIf either you or JoshFrankl.in decides the cancel the subscription service, you will have the rights to your website's source code, domain, and Google Apps account (which includes email, Google Drive, and analytics). However, there is no guarantee that your website will function properly on hosts other than JoshFrankl.in.
If you have any questions, please do not hesitate to contact websites@joshfrankl.in.


Class: Aws::RDS::Types::DBClusterSnapshot
| Inherits: |
Struct
|
| Defined in: |
(unknown) |
Overview
Contains the result of a successful invocation of the following actions:
This data type is used as a response element in the DescribeDBClusterSnapshots action.
Returned by:
Instance Attribute Summary collapse
-
#allocated_storage ⇒ Integer
Specifies the allocated storage size in gigabytes (GB).
-
#availability_zones ⇒ Array<String>
Provides the list of EC2 Availability Zones that instances in the DB cluster snapshot can be restored in.
-
#cluster_create_time ⇒ Time
Specifies the time when the DB cluster was created, in Universal Coordinated Time (UTC).
-
#db_cluster_identifier ⇒ String
Specifies the DB cluster identifier of the DB cluster that this DB cluster snapshot was created from.
-
#db_cluster_snapshot_identifier ⇒ String
Specifies the identifier for the DB cluster snapshot.
-
#engine ⇒ String
Specifies the name of the database engine.
-
#engine_version ⇒ String
Provides the version of the database engine for this DB cluster snapshot.
-
#kms_key_id ⇒ String
If
StorageEncrypted
is true, the KMS key identifier for the encrypted DB cluster snapshot. -
#license_model ⇒ String
Provides the license model information for this DB cluster snapshot.
-
#master_username ⇒ String
Provides the master username for the DB cluster snapshot.
-
#percent_progress ⇒ Integer
Specifies the percentage of the estimated data that has been transferred.
-
#port ⇒ Integer
Specifies the port that the DB cluster was listening on at the time of the snapshot.
-
#snapshot_create_time ⇒ Time
Provides the time when the snapshot was taken, in Universal Coordinated Time (UTC).
-
#snapshot_type ⇒ String
Provides the type of the DB cluster snapshot.
-
#status ⇒ String
Specifies the status of this DB cluster snapshot.
-
#storage_encrypted ⇒ Boolean
Specifies whether the DB cluster snapshot is encrypted.
-
#vpc_id ⇒ String
Provides the VPC ID associated with the DB cluster snapshot.
Instance Attribute Details
#allocated_storage ⇒ Integer
Specifies the allocated storage size in gigabytes (GB).
#availability_zones ⇒ Array<String>
Provides the list of EC2 Availability Zones that instances in the DB cluster snapshot can be restored in.
#cluster_create_time ⇒ Time
Specifies the time when the DB cluster was created, in Universal Coordinated Time (UTC).
#db_cluster_identifier ⇒ String
Specifies the DB cluster identifier of the DB cluster that this DB cluster snapshot was created from.
#db_cluster_snapshot_identifier ⇒ String
Specifies the identifier for the DB cluster snapshot.
#engine ⇒ String
Specifies the name of the database engine.
#engine_version ⇒ String
Provides the version of the database engine for this DB cluster snapshot.
#kms_key_id ⇒ String
If StorageEncrypted
is true, the KMS key identifier for the encrypted
DB cluster snapshot.
#license_model ⇒ String
Provides the license model information for this DB cluster snapshot.
#master_username ⇒ String
Provides the master username for the DB cluster snapshot.
#percent_progress ⇒ Integer
Specifies the percentage of the estimated data that has been transferred.
#port ⇒ Integer
Specifies the port that the DB cluster was listening on at the time of the snapshot.
#snapshot_create_time ⇒ Time
Provides the time when the snapshot was taken, in Universal Coordinated Time (UTC).
#snapshot_type ⇒ String
Provides the type of the DB cluster snapshot.
#status ⇒ String
Specifies the status of this DB cluster snapshot.
#storage_encrypted ⇒ Boolean
Specifies whether the DB cluster snapshot is encrypted.
#vpc_id ⇒ String
Provides the VPC ID associated with the DB cluster snapshot.


'3BlackChicks Review...'
JUST VISITING (2001) Rated PG-13; running time 88 minutes Genre: Comedy Seen at: Jack Lokes' Celebration Cinema (Lansing, Michigan) Official site: http://www.just-visiting.com/ IMDB site: http://us.imdb.com/Details?0189192 Written by: Christian Clavier, Jean-Marie Poire, John Hughes Directed by: Jean-Marie Poire Cast: Jean Reno, Christian Clavier, Christina Applegate, Malcolm McDowell, Tara Reid, Matthew Ross, Bridgette Wilson
Review Copyright Rose Cooper, 2001 Review URL: http://www.3blackchicks.com/bamsjustvisit.html
As JUST VISITING opens up, the rich baritone voice of Kelsey Grammer briefly narrates the background story. Apropos, as a line from Grammer's FRASIER TV show, spoken by Niles' pet bird [in "To Kill A Talking Bird", for my fellow Frasierholics], came to mind while I was watching this movie: "Cute, but stupid!"
The Story (WARNING: **spoilers contained below**) In 12th-century Merry Olde England, the Earl of Warrick was a playa-hata of the highest order. The target of the Earl's hatred was Count Thibault of Malfete (Jean Reno), a French nobleman who was engaged to Lady Rosalind (Christina Applegate). Through witchcraft and trickery, the Earl manages to separate Thibault from his Maiden Faire; and when the Count enlists the aid of an Old English Wizard (Malcolm McDowell) to try to right the wrong which was done, Thibault and his trusty servant Andre (Christian Clavier) get sent "through the corridors of time". Only, the Wizard discovers something went terribly wrong.
Fast forward to a modern-day Chicago museum, where Thibault and Andre experience some serious culture shock when they come face to face with not only modern technology, but also the face of Thibault's betrothed. But what's this? The museum curator is not Lady Rosalind, but instead, Julia Malfete (also Christina Applegate). Name ring a bell? Add in Julia's scheming, two-timing boyfriend Hunter (Matthew Ross), Amber (Bridgette Wilson) the slimy two-timee, and Angelique (Tara Reid), a "servant" herself who sees Andre as a soulmate - and...wait for it...
...wackiness ensues.
The Upshot: Of all the fish-out-of-water movies that I've seen in my lifetime - and I've seen a lot of scrawny minnows - none have come close to the fun of the best of them, MOSCOW ON THE HUDSON. To this day, my husband and I still quote it ["Kah-ffee! Kah-ffee! Kah-ffee!"]; and I got a kick out of recognizing the Russian waiter in HEARTBREAKERS as having been the clown Anatoly in "Moscow" (Elya Baskin, for the record). I seriously doubt that we'll be having such fond reminiscences regarding JUST VISITING.
"Visiting" wasn't a _bad_ movie, not necessarily; or at least, not completely. It was good for a few quick grins, maybe even a healthy laugh or two. I'm as amazed as anyone that Christina Applegate could even share a movie set with the likes of actor Jean Reno, without him wiping the floor with her; after all, with MARRIED WITH CHILDREN and JESSE on your resume, you don't exactly get called to read Shakespeare, y'know? And the time-out-of-place hook had its cute moments (lampooning the stereotype of how the French don't bathe, the Wizard's outfit, Andre's Issues with cars, and the like). But after the hook wore off (and it wore off pretty quickly), JUST VISITING labored on without much of interest to Say - no doubt under heavy John "Breakfast Club" Hughes influence. It finally crawled to its silly end [and could they have picked a more turgidly foul song for the closing credits? peeyew!], at which point I found myself making notation of the bad editing during the ObChaseScene. Ok, show of hands: who *didn't* see that coming?
Here's the thing that irked me the most, and it's the same thing that bothers me when it happens to Frasier on FRASIER: you have Andre, played by actor (and, notably, co-writer) Christian Clavier - who would by no stretch of the imagination be considered your typical Hollywood babe magnet - and you have Cute Young Thing Angelique (Tara Reid, who, along with Clavier, were the best things about "Visiting")...and nobody seems to think twice about that matchup? I know that Love Conquers All and all, but have the ubiquitous They *ever* had such mixed matchups the other way around, with a rather frumpy looking chick hooking up with a Studmuffin? _Without_ it being played as parody or pathos? I'm no feminazi, but render unto me a break!
I like a good, mindless popcorn flick as much as the next guy, as witnessed by my high rating for HEARTBREAKERS; unfortunately, the not-so-good JUST VISITING runs out of steam way before you get to the icky pseudo-butter at the bottom of the bag.
The "Black Factor" [ObDisclaimer: We Are Not A Monolith]:
[minor spoiler warning] Here's Proof that I've become desensitized to Bug-Eyed Black Movie Characters, and have Moved On: I didn't even notice the slight resemblance the Black security guard seemed to have to Amos. Or was it Andy?
Ok, seriously, though I obviously noticed Sgt. Bugeyes, I also noticed similar reactions in the White kids and adults in the museum. And wouldn't *you* bug out if you saw someone melt before your eyes? Hmmm...
Bammer's Bottom Line: Some things just lose it in the translation. I haven't seen the original flick that JUST VISITING was based on, but I'll betcha francs to croissants that it was better in the original French.
JUST VISITING (rating: yellowlight):
JUST VISITING is good for a few scattered chuckles, but it's no French tickler.
Maird, what a bad pun that was.
Rose "Bams" Cooper Webchick and Editor, 3BlackChicks Review Entertainment Reviews With Flava! Copyright Rose Cooper, 2001 EMAIL<EMAIL_ADDRESS>http://www.3blackchicks.com/
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Limited ability to perceive the environment: Every fish can only see things (other fish and food) within a restricted range.
Process information from environment and compute an action: In this case the actions are computed as forces (vectors). If the environment tells the fish that there's a huge scary fish ahead, the action will be a force in the oposite direction, or if the fish sees food, a force will pull it towards it. There are social behaviors like shoaling/schooling that come from basic separation, alignment and cohesion forces. There are also evolutionary strategies, like the affinity for other fish of a similar color, promoting the generation of different races. All these forces are added-up at every time-step and result making the fish decide in which direction to swim.
No leader: The fish are not commanded by a leader to display complex behaviors like shoaling/schooling , this intelligent and structured dynamics emerge from local interactions from the agents themselves.
Population: The population of fish is randomly generated with random values for their DNA. The genotype of a fish consists basically on 2 variables (mass and hue), which then produce the phenotype of the fish (color, size, max speed, range of view, maturity threshold, bite size, etc).
 They can eat food to gain energy, and also they can eat other fish that are smaller than them (less than half of their mass). The more energy they can collect, the longer they will live.
Reproduction: Agents can spawn offsprings, they have to reach a certain age (it varies depending on the mass of the fish), once they do, they are able to mate, therefore perpetuating their genes. When they mate, the fertility threshold is increased again, and if the fish collects enough food to live longer it can mate several times, but the older the fish gets the more energy consumes to swim, so in the end every fish dies.
Crossover and Mutation: The offsprings are a crossover of the genes of their parents (if one parent is big and the other one is small, the child will be medium sized, if one is red and the other one is blue, the child will be purple), but a really small fraction of the offsprings get mutated genes, introducing new features to the population.


Get Inspired by these Quotes Here!
F
eeing down,Need something to uplift your spirity?Worry no-more.Get Quotes that will uplift your spirity
Inspirational Quotes
Tweet this!


Table of Contents
| Goldskull
Prev:
Summing Up
Next:
Laying out the map
Chapter 6: Goldskull
In this chapter we implement another simple game.
Laying out the map
Making things happen
Improving the game
Weightier matters
Everything in its place
Retrospect
adv3Lite Library Manual
Table of Contents
| Goldskull
Prev:
Summing Up
Next:
Laying out the map