text:
La saga de Alien es una saga cinematográfica de ciencia ficción y terror que relata la historia de la teniente Ellen Ripley (protagonizada por Sigourney Weaver) y su lucha contra una forma de vida alienígena, conocida simplemente como «el alien» o xenomorfo. La serie comenzó en 1979 con la película de 20th Century Fox Alien, el octavo pasajero y a partir de esta se produjeron tres secuelas y dos precuelas, al igual que numerosos cómics, libros y videojuegos basados en la franquicia.

Relacionadas con la serie están las películas de Alien vs. Predator (Alien vs. Predator y Alien vs. Predator: Requiem), que se basan en la franquicia que hace la combinación del universo de Alien con el de la saga cinematográfica de Depredador.

Películas

Películas originales

Alien, el octavo pasajero (1979)

La nave espacial Nostromo visita un planetoide desolado después de recibir una señal desconocida de una nave extraterrestre abandonada y en ruinas. Mientras la tripulación del Nostromo explora la nave, uno de ellos encuentra lo que parece ser un nido de huevos, uno de ellos se abre y sale una criatura que se adhiere a su rostro y lo deja inconsciente. Un tiempo después, el parásito muere y el miembro de la tripulación despierta, aparentemente en buen estado de salud. Más tarde, sin embargo, una criatura extraterrestre sale violentamente de su pecho, matándolo, y luego de crecer rápidamente hasta 2,5 metros, comienza a matar a otros miembros de la tripulación.

Luego de terminar la película Dark Star (1974), Dan O'Bannon pensó en expandir sobre algunas de sus ideas (en especial el concepto de un «extraterrestre cazando a la tripulación de una nave espacial dentro de ella») y crear una película de ciencia ficción y terror. El proyecto fue llamado provisionalmente Memory (lit. 'memoria'). El guionista Ronald Shusett colaboró con O'Bannon en el proyecto, añadiendo elementos de un guion anterior de O'Bannon llamado Gremlins, en el cual los gremlins causaban desastres a bordo de un bombardero de la Segunda Guerra Mundial y aterrorizaban a su tripulación. El dúo concluyó el guion, inicialmente llamado Star Beast (lit. 'bestia estelar'), y O'Bannon se percató de la gran cantidad de veces que la palabra Alien se repetía, por lo que nombró a la película Alien. Los escritores pensaban inicialmente en hacer una película de bajo presupuesto, pero el éxito de Star Wars llevó a Fox a invertir millones en la producción.

En el guion original la nave tiene una tripulación compuesta exclusivamente por hombres (aunque en la sección de reparto del guion se indicaba que todos los personajes eran unisex y que todas las partes eran «intercambiables entre hombres o mujeres»), incluyendo al personaje de Ripley, quién hubiese sido protagonizado por Tom Skerritt. Más adelante, cuando los productores Alan Ladd Jr., Walter Hill y David Giler, escucharon rumores de que Fox estaba trabajando en otros proyectos con protagonistas femeninas fuertes, Sigourney Weaver fue seleccionada para protagonizar el papel de Ellen Ripley y Skerrit se convirtió en el capitán Dallas.

El pintor y escultor suizo H.R. Giger diseñó al xenomorfo adulto y al facehugger, mientras que Moebius creó los aspectos visuales de los trajes espaciales y Ron Cobb proveyó casi todo el diseño en el set.

Aliens, el regreso (1986)

La teniente Ellen Ripley, la única superviviente del Nostromo, despierta del hipersueño 57 años después de los eventos de Alien, el octavo pasajero a bordo de una nueva estación espacial. Poco tiempo después, descubre que el planetoide de la primera película (ahora conocido como LV-426) es ahora una colonia de terraformación. Cuando se pierde el contacto con la colonia, Ripley acompaña a un escuadrón de infantes de marina que se dirige a LV-426 a bordo del Sulaco para investigar la situación.

Pese a que la primera película de la serie, dirigida por Ridley Scott, había sido exitosa, Fox no consideró hacer una secuela hasta 1983, cuando James Cameron expresó su interés en producir una continuación de la historia de Alien de David Giler. Luego del éxito de la película de Cameron, The Terminator, Cameron recibió, junto a Gale Anne Hurd, la aprobación para dirigir y producir la secuela de Alien que sería lanzada en 1986. Cameron escribió el guion para la película a partir de una historia que el desarrolló junto a Giler y Walter Hill.

Alien 3 (1992)

Debido a un incendio a bordo del Sulaco, la nave en la que Ripley y los sobrevivientes de Aliens se dirigían a la Tierra desde LV-426, una de las cápsulas de escape es expulsada de la nave. La cápsula termina cayendo en el planeta refinería/prisión Fiorina Fury 161, siendo Ripley la única superviviente. Sin que ella lo haya sabido, un huevo había estado a bordo de la nave en todo momento. Una vez en tierra, la criatura utiliza un perro (un buey en la Versión Extendida) como huésped, nace en la prisión y comienza a matar a todos los reos que encuentra. Ripley luego descubre que también hay una alien reina creciendo dentro de ella.

Luego de la segunda película, Aliens, el regreso, Weaver no estaba interesada en volver a la franquicia por lo que los productores David Giler y Walter Hill comisionaron una tercera película de Alien sin el personaje de Ripley. La premisa era traer de vuelta a Ripley para una cuarta entrega de la saga, pero el presidente de Fox Joe Roth no estuvo de acuerdo con retirar al personaje, por lo que Weaver finalmente fue contactada para su participación en Alien 3.

Lanzada en 1992, la película tuvo problemas desde un principio; sin siquiera tener el guion terminado y habiendo gastado un millón de dólares antes de hacerlo, el director de videos de música pop David Fincher, el tercer director considerado para el filme, fue contratado para hacerse cargo del proyecto. Luego de que la producción fue completada a finales de 1991, el estudio realizó cambios en la película sin involucrar o recibir el consentimiento de Fincher. Giler, Hill y Larry Ferguson escribieron el guion, basándose en una historia de un guion anterior escrito por Vincent Ward.

Alien: Resurrection (1997)

Doscientos años después de los eventos de Alien 3, Ellen Ripley es clonada y una alien reina es extraída quirúrgicamente de su cuerpo por el United Systems Military (lit. 'ejército de los Sistemas Unidos'). El ejército pretende criar xenomorfos para estudiarlos a bordo de la nave espacial USM Auriga, usando humanos raptados y llevados a ellos por mercenarios para usarlos como «huéspedes» de las criaturas. Aunque tienen éxito en la clonación de Ripley y el nacimiento de los xenomorfos, una vez éstos llegan a edad adulta escapan de sus jaulas provocando el caos dentro de la nave; al mismo tiempo que Ripley y los mercenarios tratan de escapar y destruir el Auriga antes de que llegue a su destino, la Tierra.

Pese a que la recepción de Alien 3 entre los fans y los críticos no fue buena, la película recaudó millones a nivel mundial y provocó interés en Fox en continuar con la franquicia. Esto llevó a que en 1996 se iniciara la producción del cuarto film de la saga, Alien: Resurrección. Pese a que Ripley no fue incluida en el primer borrador del guion, y Weaver no estaba interesada en volver a protagonizar el rol, se unió al proyecto después de que le ofrecieran un salario de un millón de dólares y mayor control creativo (incluyendo la potestad de aprobar al director Jean-Pierre Jeunet). El filme, lanzado en 1997, experimentó un extendido periodo de producción y, según el guionista Joss Whedon, prácticamente destruyeron su guion original en este proceso..

Precuelas

Prometheus (2012)

Prometheus (conocida como Prometeo, en Hispanoamérica) es una película estrenada en el 2012, dirigida por Ridley Scott, el director de Alien, el octavo pasajero. Si bien la película no es una secuela directa de ninguna de las películas anteriores de la serie, ni tampoco tiene xenomorfos en ella, toma lugar en el mismo universo de la saga, años antes de los eventos de Alien, el octavo pasajero, y hace alusiones a la existencia y origen de la criatura de las películas de Alien y a importantes eventos que involucran a la corporación Weyland. La trama de la película, que trae consigo su propia mitología e ideas, sigue a la tripulación de la nave espacial Prometheus en el año 2094 en su exploración de los restos de una avanzada civilización extraterrestre y la búsqueda de los orígenes de la humanidad. La película se estrenó el 8 de junio del 2012, en los Estados Unidos, el 7 de junio en algunos países de América Latina y el 3 de agosto en España.

Alien: Covenant (2017)

A mediados de 2014 se confirmó el proyecto de una secuela de Prometheus, cuyo rodaje daría inicio finalmente en febrero de 2016. Ridley Scott dio a conocer los pormenores de la cinta que aunque inicialmente llevaría el título de Alien: Paradise Lost finalmente aludió a él como Alien: Covenant.

Proyectos futuros

Series de TV
A mediados de 2018 surgió el rumor de que Fox prepara una supuesta serie de televisión basada en Alien que podría ser anunciada a lo largo de 2019, coincidiendo con el 40.º aniversario de la saga. La misma podría estar inspirada en el popular videojuego Aliens: Colonial Marines o Alien: Isolation, cuya protagonista era la hija de Ellen Ripley. En octubre de 2018 se rumoreó con que una plataforma de streaming, todavía no identificada, habría dado luz verde al proyecto. En enero de 2019 Fox confirmó la cancelación definitiva de la saga de precuelas, lo que alimentó aún más el rumor de que una posible serie de televisión estaba en marcha.

En febrero de 2019 HN Entertainment desveló que se estaba trabajando en dos series y no una, como se había especulado en un principio, y que Ridley Scott estaría involucrado en al menos en una de ellas, como productor ejecutivo. Esta serie sería lanzada por streaming para la plataforma HULU. La otra serie recibiría el nombre de "Criado por lobos" y se centraría en los sintéticos, y en este caso sería emitida por TNT. Días después ING aseguró que James Cameron estaba trabajando en algo relacionado con Alien, y algunos ya lo relacionan con esta segunda serie.

Proyectos cancelados

Precuelas de Ridley Scott
En un principio, Ridley Scott había propuesto a Fox realizar otras dos secuelas de Alien: Covenant, que servirían de enlace para Alien: el octavo pasajero. La primera debía comenzar a filmarse en 2018 y se estrenaría presumiblemente en 2019. Sin embargo, tras la mala taquilla obtenida por Alien: Covenant, Fox se replanteó la continuación de la saga de precuelas impulsada por Ridley Scott. El proyecto se complicó cuando, en diciembre de 2017, Disney hizo oficial la compra de 21st Century Fox por 52 000 millones de dólares. Finalmente en enero de 2019 Fox confirmó la cancelación definitiva de la saga de precuelas.

Alien 5
A principios del 2015, el director de cine Neill Blomkamp publicó en su cuenta de Instagram una serie de Concept Arts en las que muestra su idea de cómo sería la quinta entrega de la franquicia si pasara por sus manos. Estas imágenes fueron objeto de rumores hasta que el 19 de febrero de 2015 20th Century Fox confirmó que la idea de Blomkamp se llevará a cabo con Sigourney Weaver de nuevo en el papel de la teniente Ripley. Días después Ridley Scott fue anunciado como productor del proyecto.

Se rumoreó la inclusión de Michael Biehn como el Cabo Dwayne Hicks. A principios de marzo del 2015, Weaver declaró que Alien 5 «romperá con el pasado de la saga» al situarse tras Aliens: el regreso (1986), ignorando Alien³ (1992) y Alien: Resurrección (1997). El 23 de marzo de 2015, Blomkamp afirmó que modificó el guion para que su historia no interfiriera con la de Alien: Covenant (2017). Sin embargo, este proyecto quedó cancelado debido a que la productora entró a priorizar el filme de Ridley Scott hasta que iniciasen las filmaciones. Finalmente a decisión de apoyar la continuidad del Universo creado por Riddley Scott, Alien 5 no vio la luz y fue descartada.

Crossover

Alien vs. Predator (AVP) (2004)

Ambientada en 2004, la película sigue a un grupo de paleontólogos, arqueólogos y otros, reunidos por el multimillonario Charles Bishop Weyland (Lance Henriksen) para una expedición cerca de la Antártida para investigar una señal de calor misterioso. Weyland espera para reclamar como suyo el hallazgo, y su grupo descubre una pirámide debajo de la superficie de una abandonada estación de caza de ballenas. Los jeroglíficos y esculturas revelan que la pirámide es un coto de caza para los depredadores que matan a los aliens como un rito de paso. Los seres humanos están atrapados en medio de una batalla entre las dos especies y deben evitar que los Aliens lleguen a la superficie.

La película dirigida por Paul W. S. Anderson y producida por 20th Century Fox es heredera de la influencia de las series cinematográficas iniciadas con las películas Alien (1979) y Predator (1987), a partir de un concepto originado en un cómic de Dark Horse de 1989. Anderson y Shane Salerno al adaptar el guion estuvieron influidos por la mitología azteca, la serie de cómics y los escritos de Erich von Däniken. El filme recibió elogios por sus efectos especiales y escenografía, además fue un éxito en taquillas, recaudando más de 172 millones de dólares en contra de su presupuesto de producción de $ 60 millones.

El primer actor en formar parte del elenco en Alien vs Predator fue Lance Henriksen, quien interpretó el personaje de Bishop en Aliens y Alien 3. Aunque la película de Alien está hecha 150 años en el futuro, Anderson quería mantener la continuidad de la serie incluyendo un actor conocido. Henriksen interpreta al millonario Charles Bishop Weyland, un personaje relacionado con Weyland-Yutani Corporation. De acuerdo con Anderson, Weyland se inicia con el descubrimiento de la pirámide, así como serán los creadores de los modelos androides de Weyland-Yutani Corporation en la película Alien; "cuando el androide de Bishop es creado 150 años después, está hecho con la cara del fundador. Es como si Microsoft construyera un androide 100 años después, y que tuviese la cara de Bill Gates".

Alien vs. Predator 2: Requiem (2007)

Secuela de la película del 2004, que salió en los cines en 2007 y que muestra cómo una nave Predator se estrella contra la Tierra después de que un Predalien (híbrido de un Alien y un Predator) aniquilase a la tripulación. Un último sobreviviente de la nave consigue enviar un comunicado a su planeta antes de morir, comenzando así una lucha entre los Aliens y el Predalien contra el Predator que quiere aniquilar por completo cualquier rastro de vida Alien.

Recepción crítica

Taquilla

Reseñas y premios

Alien, el octavo pasajero fue nominada a dos premios de la academia, ganando la estatuilla por «mejores efectos visuales». Aliens, el regreso recibió siete nominaciones, incluyendo «mejor actriz» para Sigourney Weaver, y ganó premios por «mejores efectos visuales» y «mejores efectos de sonido». Alien3  también fue nominada para el premio por «mejores efectos visuales».

En 2008, IGN nombró a Alien como la decimotercera mejor franquicia de películas de la historia. Alien, el octavo pasajero también ha sido inducida al Registro Nacional de Cine de la Biblioteca del Congreso de Estados Unidos para preservación histórica como una película que es «cultural, histórica o estéticamente significativa». El American Film Institute nombró a Alien, el octavo pasajero como la sexta película estadounidense más emocionante y la séptima mejor del género de ciencia ficción de los últimos 100 años, mientras que en el ranking de héroes y villanos, Ripley se encuentra en el puesto número ocho entre los héroes y el xenomorfo es el decimocuarto entre los villanos.

Lanzamiento en formatos de Home Video
Ha habido decenas de lanzamientos de las películas por separado en varios formatos, incluyendo Beta, VHS, Laserdisc y DVD. En cuanto al formato Blu-ray, solamente la compilación de la serie, que incluye varias versiones de cada película, ha sido lanzada (el paquete incluye ocho versiones diferentes, véase Alien Antholgy abajo).

Hubo lanzamientos en formato Laserdisc de las versiones de sala de las películas en forma separada, al igual que dos cajas recopilatorias que solo contenían una película (hubo dos lanzamientos por separado, uno para Alien, el octavo pasajero y otro para Aliens, el regreso) pero contaban con una gran cantidad de material extra y un costo de aproximadamente de 100 dólares. El filme Aliens, el regreso incluía una nueva «edición especial» de la primera película completada por James Cameron exclusivamente para este lanzamiento, la cual extendía en forma significativa a la versión de sala cinematográfica de Alien, el octavo pasajero.

En los lanzamientos en DVD, las películas estuvieron, en un principio, disponibles solo en cajas recopilatorias (véase Alien Legacy más abajo) pero luego fueron lanzados en forma separada (Aliens, el regreso solo tuvo en el primer lanzamiento en DVD la «edición especial» y no la versión teatral original). El mismo patrón se continuó cuando las ediciones especiales de dos discos de las películas fueron lanzadas luego de Alien Quadrilogy (ver abajo), con cada película siendo lanzada en forma individual en las versiones de dos discos incluidas en esa caja compilatoria. Desde entonces, ha habido múltiples lanzamientos de las películas, tanto de sus versiones de sala o extendidas, aunque algunos lanzamientos individuales de las películas han incluido ambas versiones.

Además de los lanzamientos de cada película por separado, ha habido siete cajas compilatorias de la serie completa en diferentes momentos de su historia. Con la excepción de la versión en DVD del Alien Triple Pack, cada lanzamiento incluía todas las películas que habían salido al momento de su lanzamiento. Las siete cajas compilatorias tuvieron características únicas que luego fueron reusadas en otras cajas o lanzamientos por separado en una forma u otra, más notablemente la compilación en Blu-ray que incluye un archivo detallado de varios lanzamientos anteriores, incluyendo las cajas compilatorias en Laserdisc.

 Alien Triple Pack (versión VHS), lanzada en VHS en 1992, incluye las primeras dos películas de la serie y una tercera cinta con una previa de 23 minutos de Alien 3, la cual se estrenó poco tiempo después en cines. (No confundir con la compilación en DVD de 2008 del mismo nombre, ver abajo.)
 Alien Trilogy, lanzada en VHS en 1993, es un paquete de tres cintas de las versiones de sala originales de Alien, el octavo pasajero, Aliens, el regreso y Alien 3..
 Alien Saga, fue una versión de Laserdisc exclusiva para Japón que contenía las tres primeras películas, lanzada en 1999. (una versión para Estados Unidos fue cancelada debido a que los DVD estaban desplazando rápidamente el mucho más pequeño mercado doméstico del Laserdisc en ese país).
 Alien Legacy, fue una compilación de cuatro volúmenes lanzada tanto en formato DVD y VHS en 1999 que incluía la «edición especial» de Aliens, el regreso del Laserdisc de 1991 (por primera vez en otro formato), las versiones de sala de las otras tres películas, y en la versión en DVD se crearon varios materiales suplementarios además de varios otros que fueron reutilizados de la versión de Laserdisc.
 Alien Quadrilogy, lanzada exclusivamente en formato DVD en 2003, considerada una de las compilaciones más exhaustivas de la era del DVD en términos de contenido y material extra, incluye nueve discos: cuatro discos (un disco cada una) para las versiones de sala y extendidas de cada película (nuevas versiones de 2003 de Alien, el octavo pasajero, Alien 3 y Alien: Resurrección y la «edición especial» de Aliens, el regreso lanzada en 1991), cuatro discos con material específico de cada película y un disco extra con documentales y otro material suplementario.
Las películas fueron re-lanzadas en forma individual en paquetes de dos discos como parte de la «Serie de Coleccionistas» de 20th Century Fox.
 Alien Triple Pack (versión DVD), lanzada en DVD en 2008, es un paquete de tres discos que incluye las versiones de sala de Alien, el octavo pasajero y Alien 3, además de la «edición especial» de Aliens, el regreso, volviendo a usar el mismo nombre de la compilación de VHS de 1992 (este fue un lanzamiento inusual en el cual Alien: Resurrección no fue incluida, haciendo de esta la primera compilación en la que la película no era incluida luego de su lanzamiento en el cine)..
 Alien Anthology, es un lanzamiento exclusivo de 2010 para Blu-ray de seis discos que incluye dos versiones de cada película (de sala y las mismas ediciones extendidas usadas en la caja compilatoria de 2003 Alien Quadrilogy - con excepción del trabajo adicional hecho en 2003 a Alien 3 que incluía la grabación mal hecha de las voces de algunos de los actores originales de la película para unas escenas nuevas que habían sido insertadas)  y prácticamente todo el contenido extra de anteriores lanzamientos (incluyendo un archivo de la edición especial de la caja compilatoria en Laserdisc con todas las galerías de imágenes y otro contenido inédito). Al igual que en Quadrilogy, las dos versiones de cada película están cargadas en un mismo disco, mientras que la capacidad de almacenamiento del Blu-ray permitió que el contenido especial que se encontraba en los otros cinco DVD fuera incluido en los otros dos discos de la compilación, los cuales incluyen aproximadamente 60 horas de vídeo y 12 000 imágenes.
 Prometheus To Alien : La Evolución , lanzamiento el 5 de diciembre de 2012 con 9 discos en Blu-ray y 5 en la versión DVD. Incluía en su versión Blu-ray "Prometheus 3D" , "Prometheus 2D" , disco de extras , Alien: El Octavo Pasajero (Ridley Scott, 1979) en sus edición cinematográfica y el montaje del director de 2003, Aliens (James Cameron, 1986) en su edición de cines y la especial de 1991, Alien 3 (David Fincher, 1992) en su versión de cines y la especial de 2003 y Alien Resurrección (Jean-Pierre Jeunet, 1997) también en la edición original y la especial de 2003 y dos discos de extras lo que hacen los 9 discos, con 65 horas de material extra.

Secuelas
Ha habido un importante número de spin-offs en otros medios además de un gran número de crossovers dentro del universo de Alien. Entre ellos se encuentran:

Películas
Alien vs Depredador (AVP) (2004) es una película dirigida por Paul W. S. Anderson y producida por 20th Century Fox. Heredera de la influencia de las series cinematográficas iniciadas con las películas Alien (1979) y Predator (1987), a partir de un concepto originado en un cómic de Dark Horse de 1989. Anderson y Shane Salerno al adaptar el guion estuvieron influidos por la mitología azteca, la serie de cómics y los escritos de Erich von Däniken. Fue estrenada el 13 de agosto de 2004, en América del Norte y recibió elogios por sus efectos especiales y escenografía, además fue un éxito en taquillas, recaudando más de 172 millones de dólares en contra de su presupuesto de producción de $ 60 millones, convirtiéndola en el filme más exitoso de la saga de Predator y el segundo más taquillero de la saga de Alien solo por detrás de Aliens: el regreso (1986).

El éxito comercial de la película dio lugar a una secuela en 2007 titulada Aliens vs. Predator: Requiem, dirigida por los Hermanos Strause, la cual fue un fracaso en la crítica.

Novelas
Además de la novelización de las cuatro películas (incluyendo las novelas de las primeras tres, escritas por Alan Dean Foster), ha habido una serie de novelas basadas en la serie:

Novelizaciones de las películas:
Alien, el octavo pasajero por Alan Dean Foster, Warner Books, junio de 1979, ISBN 0-446-82977-3
Aliens, el regreso por Alan Dean Foster, Warner Books, junio de 1986, ISBN 0-446-30139-6
Alien 3 por Alan Dean Foster, Warner Books, junio de 1992, ISBN 0-446-36216-6
Alien: Resurrección por A. C. Crispin, Aspect Books, diciembre de 1997, 0-446-60229-9
 Basadas en la serie Aliens:
Earth Hive (por Steve Perry, Bantam, octubre de 1992, ISBN 0-553-56120-0)
Nightmare Asylum (por Steve Perry, Bantam, mayo de 1993, ISBN 0-553-56158-8)
The Female War (por Steve Perry y Stephani Perry, Bantam, agosto de 1993, ISBN 0-553-56159-6)
Genocide (por David Bischoff, Bantam, enero de 1994, ISBN 0-553-56371-8)
Alien Harvest (por Robert Sheckley, Bantam Spectra, de 1995, ISBN 0-553-56441-2)
Rogue (por Dean Wesley Smith & Kristine Kathryn Rusch, ambos escribiendo como Sandy Schofield, Bantam Spectra, 1995, ISBN 0-553-56442-0)
Laporrinth (por Stephani Perry, Bantam Spectra, 1996, ISBN 0-553-57491-4)
Music of the Spears (por Yvonne Navarro, Bantam Spectra, de 1996, ISBN 0-553-57492-2)
Berserker (por Stephani Perry, Bantam Spectra, 1998, ISBN 0-553-57731-X)
Original Sin (por Michael Jan Friedman, DH Press, octubre de 2005, ISBN 1-59582-015-9)
DNA War (por Diane Carey, DH Press, mayo de 2006, ISBN 1-59582-032-9)
Cauldron (por Diane Carey, DH Press, mayo de 2007)
Steel Egg (por John Shirley, DH Press, octubre de 2007, ISBN 1-59582-114-7)
Criminal Enterprise (por Stephani Perry, DH Press, enero de 2008, ISBN 1-59582-003-5)
No Exit (por Brian Evenson, DH Press, julio de 2008, ISBN 1-59582-004-3)

Cómics
Alien ha sido parte de numerosos cómics, entre ellos:

Alien:The Illustrated Story;
Aliens;
Alien Loves Predator, un webcomic satírico;
Aliens vs. Predator;
Aliens vs. Predator vs. The Terminator;
Batman/Aliens;
Green Lantern Versus Aliens;
Judge Dredd vs. Aliens;
Superman vs. Aliens;
Superman & Batman vs. Aliens & Predator;
WildC.A.T.s/Aliens.

Videojuegos
El universo de Alien, al igual que los xenomorfos, han sido el objeto de muchos videojuegos desde la década de 1980 hasta el día de hoy. El primer juego basado en la franquicia fue Alien para el Atari 2600 en 1982, un juego basado en gran parte en Pac-Man. Un juego de estrategia basado en la primera película fue lanzado en 1984.

Aliens, el regreso fue adaptada en cuatro videojuegos diferentes, un Matamarcianos arcade hecho por Konami, una colección de minijuegos desarrollados por Activision, un first-person shooter de Software Studios, y un juego de plataforma de Square.

Acclaim creó tres juegos diferentes basados en Alien3, dos juegos de plataforma estilo contra (uno para varias plataformas en 1992, y otro para el SNES un año después) y un juego de aventura para Game Boy en 1993. Sega también lanzó un juego arcade de pistola de luz en 1993 llamado, Alien 3: The Gun.

Uno de los últimos juegos basados en una película de Alien fue Alien Resurrection en el año 2000, un first-person shooter para PlayStation.

Otros juegos de Alien incluyen el de aventura de Mindscape, Aliens: A Comic Book Adventure de 1995, el juego FPS de Acclaim, Alien Trilogy en 1996, el FPS Aliens Online en 1998, el juego de acción para Game Boy Color Aliens: Thanatos Encounter de 2001, y el juego para dispositivos móviles Aliens: Unleashed de 2003. El último juego de Alien fue lanzado el 2006, el juego arcade Aliens: Extermination.

En 1994, Atari lanzó el videojuego de disparos en primera persona desarrollado por Rebellion, Alien vs Predator para el Atari Jaguar, en el cual el jugador podía elegir jugar como un infante de marina, un depredador o un xenomorfo. Años después Rebellion desarrolló Aliens versus Predator para la PC. Éste fue seguido, entre otros, por Aliens versus Predator 2 y la expansión Aliens versus Predator 2: Primal Hunt. Una reedición de los juegos AvP, nuevamente desarrollada por Rebellion y publicada por Sega, Aliens vs. Predator fue lanzada en el año 2010. Sega también lanzó el juego de Nintendo DS, Aliens: Infestation, en octubre de 2011.

En diciembre de 2006, Sega llegó a un acuerdo con Fox Licensing para lanzar dos juegos nuevos basados en la franquicia de Alien para la PC, Xbox 360 y PS3. Solo uno de los juegos del acuerdo inicial será lanzado, un videojuego de disparos en primera persona de Gearbox Software, Aliens: Colonial Marines. El juego fue lanzado el 12 de febrero de 2013 con calificaciones abismales tanto por parte de los usuarios como de la prensa especializada.

En octubre de 2014, Sega terminó lanzando un segundo juego basado en la franquicia Alien, esta vez un juego de survival horror desarrollado por The Creative Assembly titulado Alien: Isolation. A diferencia de los anteriores videojuegos basados en la franquicia, este no es un juego de acción, sino que sigue líneas similares a los ambientes ofrecidos en las películas Alien, el octavo pasajero y Alien 3.

En enero de 2019 Fox confirmó que se está trabajando en varios videojuegos de Alien. El primero en anunciarse fue Alien: Blackout, un juego de survival horror para móviles que tendrá como protagonista a Amanda Ripley y seguirá la estela de Alien: Isolation; la trama se desarrollará en una estación espacial de la Weyland-Yutani, y en esta ocasión Ripley tendrá que guiar a una tripulación mientras son acechados por la criatura. Por otra parte, también se confirmó que se está desarrollando un MMO para PC y consolas.

En el mundo académico
El personaje de Bishop (Aliens, el regreso y Alien 3) ha sido sujeto de análisis literario y filosófico como un importante personaje androide que se apega a las Tres leyes de la robótica del autor de ciencia ficción Isaac Asimov, así como un modelo de una máquina dócil y potencialmente autoconsciente. La representación de los androides en la franquicia de Alien —Ash en Alien, el octavo pasajero, Bishop en Aliens, el regreso, y Call (Winona Ryder) en Alien: Resurrección— ha sido estudiada por las implicaciones en las relaciones de los seres humanos en presencia de un "Otro", ya que Ripley los trata con miedo y sospecha, y una especie de «racismo de alta tecnología y apartheid androide»" existe a lo largo de la serie. Esto es visto como parte de una tendencia tecnófoba en películas de antes de los años 1990, con el rol de Bishop siendo especialmente importante ya que él se redime al final de Aliens, el regreso, confundiendo las expectativas de Ripley.

Referencias

Películas de Alien
Alien
Películas de Estados Unidos
Series de películas de ciencia ficción
Series de películas de acción


text:
Promise of Place
What is PBE?
What is Place-Based Education?
Principles of Place-Based Education
Curriculum & Planning
Planning an Evaluation
PBE in the News
Grounds for Improvement Secondary Action Research Programme: Final report
Rickinson, Mark
Over the last three years (2001-2004), Learning through Landscapes (LTL), the national school grounds charity, has been working in partnership with Sport England and the New Opportunities Fund to deliver a targeted programme of school grounds improvements throughout England. With funding of 4.6m [British pounds], the Grounds for Improvement Programme has involved some 350 schools nationally with the aim of improving the use, design and management of their grounds for the benefit of the schools and their local communities.
As part of this programme, a group of six secondary schools has participated in a more concentrated scheme called the Grounds for Improvement Secondary Action Research Programme (SARP). These schools received the highest level of award from the Grounds for Improvement Programme (50,000 [British pounds] each), to enable their staff and students to develop and implement a new approach to school grounds improvement through action research supported by LTL facilitators. The research aspects of SARP were coordinated by the National Foundation for Educational Research (NFER), and this document outlines the insights that have emerged from this work over the past three years. It builds upon earlier interim reports produced by NFER during the programme (Rickinson, 2002; Rickinson et al. 2003a; 2003b).
Aims and Research Questions
The stated aim of SARP was 'to develop and demonstrate the value of a new approach to the education and motivation of young people in secondary schools, through their full and meaningful participation in the design and management of their own school grounds environment'.
More specifically, the programme sought to generate innovative approaches and research-based evidence on improving secondary school grounds in ways that engage and empower young people. This was shaped by two key research questions:
How can secondary schools engage their students in school grounds improvement?
What are the impacts of school grounds projects on students and schools?
These questions took account of the fact that very little research has been undertaken on school grounds improvement in the secondary school context. Most of what is known either relates to primary schools, or simply has not been documented.
Pedagogical Area
place-based education, environment as integrating context (EIC)
physical education, outdoor recreation
Participant Area
Age Area
elementary (6-11 years old)
middle school (12-14 years old)
Shelburne Farms
New Hampshire Charitable Foundation

redpajama_set_name: RedPajamaCommonCrawl


Aero-Motion's Newton Yo-Yo's™ are a universally popular classic toy. They are high quality and have been crafted from hardwood for over 25 years. Sleep, walk the dog, & around the world all while keeping a nostalgic feel.
Your guaranteed to get a one of a kind experience with this old fashioned wooden yo-yo!


When a bride as unique as this one goes looking for a wedding venue, you know she's going to want something as original as she is!
There are many wedding venues in and around the New Hope area of Pennsylvania, but none as quirky and original as Holly Hedge Estate.
Holly Hedge Estate is rustic, charming, and jaw-droppingly elegant. This 18th Century estate was first built in the 1780's. The buildings that compose the estate were crafted by hand, using local timber and field stones.
The most famous of these estate buildings is probably the "Old Barn", which is the most popular location at Holly Hedge for weddings and wedding receptions.
This venue is perfectly designed for the area, and is a delightfully quirky Bucks County wedding venue. New Hope is a charmingly artistic town, close to equally darling Lambertsville, and Holly Hedge Estate fits right into that community.
I love that the Inn at Holly Hedge has fifteen rooms that can be used on your wedding weekend for family and bridal party lodging!
It's so helpful to have lodging right on site, something that many New Hope wedding venues do not have. If you're also looking for further lodging for guests, you can check out the Lumberville 1740 House.
Holly Hedge has a wonderful frequently asked questions section on their website that is incredibly helpful! They really go above and beyond to to make sure that you can find as much information as possible online. That's great if you're planning a wedding, as it can often be hard to source the information that you're looking for.
For over twenty years, the team at Holly Hedge Estate has helped brides and grooms throw wonderful wedding parties in the Bucks County area. They have in-house planners, catering, and local services. Their customer service goes above and beyond to ensure that their clients are happy and have the best weddings they possibly can!
Towards the end of this Holly Hedge Estate wedding the bride and groom asked me if we could go outside for a few additional images around the property.
My assistant and I headed out with our off-camera flash and video light in tow, not knowing what the circumstances would require.
We went to the english courtyard for these portraits … and it immediately began raining!
Two wonderful staff members from Holly Hedge followed us outside with umbrellas for the bride and groom and they're actually holding them in this picture.
You can't see it because I cropped out the umbrellas and the staff members but just off to the right and left of the frame are people and just out of sight at the top of the frame are two huge black golf umbrellas!
I positioned the bride and groom between two tall trees wrapped in fairy lights. You can see the softly indistinct lights in the background.
You can also see the lights in the foreground more prominently because my lens is quite close to the lights themselves.
I loved the final image (and these marvelous client!) so much that it was actually my full page ad in the 2014 issue of New York Weddings Magazine.
Want to talk more about your Holly Hedge wedding and photography? Click below to get in touch!
Location: 6987 Upper York Rd, New Hope, PA 18938.
Keywords: Holly Hedge (12), New Hope (12). 1/400; f/2.8; ISO 1000; 200.0 mm.


text:
\section{Introduction}

Anatomical trees like blood vessels, dendrites or airways, carry information about the organs they are part of, and if we can meaningfully compare anatomical trees and measurements made along them, then we can learn more about aspects of disease related to the anatomical trees~\cite{hasegawa,washko}. For example, airway wall thickness is known to be a biomarker for Chronic Obstructive Pulmonary Disease (COPD), and in order to compare airway wall thickness measurements in different patients, a typical approach is to compare average airway wall area percentage measurements for given airway tree generations of particular subtrees~\cite{hasegawa,hackx}. These approaches assume that measurements made in different locations of the lung are comparable on a common scale, which is not always the case~\cite{hasegawa,hackx}. If we can compare tree structures attributed with measurements made along them in a way which respects the structure and geometry of the tree, then we can be more robustly compare measurements whose values are location sensitive. In this paper we present a family of kernels for comparing anatomical trees endowed with vector attributes, and use these to get a more detailed understanding of how COPD correlates with airway structure and geometry.

\vspace{2mm}

\noindent {\bf Related work.} Several approaches to statistics on attributed (geometric) trees have recently appeared, and some of them were applied to airway trees~\cite{feragen_iccv11,feragen_miccai,nye,sturmmean}. These methods only consider branch length or shape and do not allow for using additional measurements along the airway tree, such as branch radius or airway wall area percentage. Moreover, these methods are computationally expensive~\cite{feragen_sspr}, or need a set of leaf labels~\cite{nye,feragen_miccai}, making them less applicable for general trees. S\o{}rensen~\cite{lauge} treats the airway tree as a set of attributed branches which are matched and then compared using a dissimilarity embedding  combined with a $k$-NN classifier. The matching introduces an additional computational cost and makes the approach vulnerable to incorrect matches.

\emph{Kernels} are a family of similarity measures equivalent to inner products between data points implicitly embedded in a Hilbert space. Kernels are typically designed to be computationally fast while discriminative for a given problem, and often give nonlinear similarity measures in the original data space. Using the Hilbert space, many Euclidean data analysis methods are extended to kernels, such as classification~\cite{libsvm} or hypothesis testing~\cite{gretton}. Kernels are popular because they give computational speed, modeling flexibility and access to linear data analysis tools for data with nonlinear behavior.

There are kernels available for structured data such as strings~\cite{rational,leslie}, trees~\cite{vis_smola}, graphs~\cite{randomwalk,weisfeiler_lehman,karsten_icdm} and point clouds~\cite{bach}. The current state-of-the-art graph kernel in terms of scalability is the Weisfeiler-Lehman (WL)~\cite{weisfeiler_lehman} kernel, which compares graphs by counting isomorphic labeled subtrees of a particular type and ``radius'' $h$. The WL scales linearly in $h$ and the number of edges, but the scalability depends on algorithmic constructions for finite node label sets. Thus, the WL kernel, like most fast kernels developed in natural language processing and bioinformatics~\cite{leslie,vis_smola,rational}, does not generalize to vector-valued branch attributes.

Walk- and path based kernels~\cite{randomwalk,bach,karsten_icdm}, which reduce to comparing sub-walks or -paths of the graphs, are state-of-the-art among kernels which include continuous-valued graph attributes. Random walk-type kernels~\cite{randomwalk,bach} suffer from several problems including tottering~\cite{mahe} and high computational cost. The shortest path kernel~\cite{karsten_icdm} by default only considers path length, and some of the kernels developed in this paper can be viewed as extensions of the shortest path kernel.

\vspace{2mm}

\noindent {\bf Contributions.} We develop a family of kernels which are computationally fast enough to run on large datasets, and can incorporate any vectorial attributes on nodes\footnote{Our formulation allows both node and edge attributes, as edge attributes are equivalent to node attributes on rooted trees: assign each edge attribute to its child node.}, e.g., shape or airway wall measurements. Using the kernels in classification and hypothesis testing experiments, we show that classification of COPD can be substantially improved by taking geometry into account. This illustrates, in particular, that airway wall area percentage measurements made at different locations in the airway tree are not comparable on a common scale.

We compare the developed kernels to state-of-the-art methods. We see, in particular, that COPD can also be detected from combinatorial airway tree structure using state-of-the-art kernels on tree structure alone, but we show that these contain no more information than a branch count kernel, as opposed to the geometric tree kernels.

\section{Geometric trees and geometric tree kernels}

Anatomical trees like airways are \emph{geometric trees}: they consist of both combinatorial tree structure and branch geometry (e.g., branch length or shape), where continuous changes in the branch geometry can lead to continuous transitions in the combinatorial tree structure. In addition to its geometric embedding, a geometric tree can be adorned with additional features measured along the tree, e.g., airway branch radius, airway wall thickness, airway wall thickness/branch radius, airway wall area percentage in an airway cross section, etc.

\begin{defn}
A \emph{geometric tree} is a pair $(T, x)$ where $T = (V, E, r)$ is a combinatorial tree with nodes $V$, root $r$ and edges $E \subset V \times V$, and $x \colon V \to \R^n$ is an assignment of (geometric) attributes from a vector space $\R^n$ to the nodes of $T$, e.g. $3D$ position or landmark points. An \emph{attributed geometric tree} is a triple $(T, x, a)$ where $(T, x)$ is a geometric tree and $a \colon x(T) \to \R^d$ is a map assigning a vector valued attribute $a(p) \in \R^d$ to each point $p \in x(T)$.
\end{defn}

A common strategy for defining kernels on structured data such as trees, graphs or strings is based on combining kernels on sub-structures such as strings, walks, paths, subtrees or subgraphs~\cite{rational,leslie,vis_smola,randomwalk,weisfeiler_lehman,karsten_icdm,bach}. These are all instances of the so-called \emph{R-convolution kernels} by Haussler~\cite{haussler}. We shall use \emph{paths} in trees as building blocks for defining kernels on trees.

Let $(T, x)$ be a geometric tree. Given vertices $v_i, v_j \in V$ there is a unique path $\pi_{ij}$ from $v_i$ to $v_j$ in the tree, defined by the sequence of visited nodes:
\[
\pi_{ij} = \left[v_i, p^{(1)}(v_i), p^{(2)}(v_i), \ldots, w, \ldots, p^{(2)}(v_j), p^{(1)}(v_j), v_j\right],
\]
where $p^{(0)}(v) = v$, $p^{(1)}(v) = p(v)$ is the parent node of $v$, more generally $p^{(k)}(v) = p(p^{(k-1)}(v))$, and $w$ is the highest level common ancestor of $v_i$ and $v_j$ in $T$. We call $\pi_{ij}$ the \emph{node-path} from $v_i$ to $v_j$ in $T$ and for each $j$ let the \emph{node-rootpath} $\pi_{jr}$ be  the node-path from $v_j$ to the root.

If the geometric node attributes $x(v) \colon I \to \R^n$ denote embeddings of the edge $(v, p(v))$ into the ambient space $\R^n$, a continuous path $x_{ij} \colon [0, 1] \to \R^n$ can be defined, connecting the embedded nodes $x(v_i), x(v_j) \in \R^n$ along the embedded tree $x(V) \subset \R^n$. We call $x_{ij}$ the \emph{embedded path} from $x_i$ to $x_j$ in $T$.

Throughout the rest of this section, we shall define different kernels for pairs of trees $T_1$ and $T_2$, where $T_i = (V_i, E_i, r_i, x_i, a_i)$ are attributed geometric trees (including non-attributed geometric trees as a special case with $a_i \equiv 1$), $i = 1, 2$. All kernels defined in this section are positive semidefinite, as they are sums of linear and Gaussian kernels composed with known feature maps. This is a necessary condition for a kernel to be equivalent to an inner product in a Hilbert space~\cite{bishop}, needed for the analysis methods used in Sec.~\ref{experiment}.

\subsection{Path-based tree kernels}

\noindent {\bf All-pairs path kernels.} The all-pairs path kernel is a basic path-based tree kernel. Given two geometric trees, it is defined as
\begin{equation} \label{allpaths_kernel}
K_{a} \left( T_1, T_2 \right) = \sum_{ \begin{array}{c}(v_i, v_j) \in V_1 \times V_1,\\ (v_k, v_l) \in V_2 \times V_2\end{array}} k_p(p_{ij}, p_{kl}),
\end{equation}
where $k_p$ is a kernel defined on paths, and $p_{ij}$, $p_{kl}$ are paths connecting $v_i$ to $v_j$ and $v_k$ to $v_l$ in $T_1$ and $T_2$, respectively -- for instance, $\pi_{ij}$ and $\pi_{kl}$, or $x_{ij}$ and $x_{kl}$, as defined above. Note that if the path kernel $k_p$ is a path length kernel, then the all-pairs path kernel is a special case of the shortest path kernel on graphs~\cite{karsten_icdm}.

The kernel $k_p$ should take large values on paths that are geometrically similar, and small values on paths which are not, giving a measure of the alignment of the two tree-paths $p_{ij}$ and $p_{kl}$, making $K_a$ an overall assessment of the similarity between the two geometric trees $T_1$ and $T_2$. The all-pairs path kernel is nice in the sense that it takes every possible choice of paths in the trees into account. It is, however, expensive: The computational cost is $\mathcal{O}(|V|^4) \cdot \mathcal{O}(k_p)$, where $|V| = \max \{ |V_1|, |V_2| \}$ and $\mathcal{O}(k_p)$ is the cost of the path kernel $k_p$.

\vspace{2mm}

\noindent {\bf Rootpath kernels.} The computational complexity can be reduced by only considering rootpaths, giving a rootpath kernel $K_r$ defined as:
\begin{equation} \label{rootpath_kernel}
K_r \left( T_1, T_2 \right) = \sum_{v_i \in V_1, v_j \in V_2} k_p(p_{ir}, p_{jr})
\end{equation}
where $k_p$ is a path kernel as before, and $p_{ir}$ is the path from $v_i$ to the root $r$. This reduces the computational complexity to $\mathcal{O}(|V|^2)  \mathcal{O}(k_p)$.

\subsection{Path kernels}

The modeling capabilities and computational complexity of the kernels $K_a$ and $K_r$ depend on the choices of path kernel $k_p$ and path representation $p$.

\vspace{2mm}
\noindent {\bf Landmark point representation of embedded paths.} From a shape modeling point of view, equidistantly sampled landmark points give a reasonable representation of a path through the tree. Representing paths by $N$ equidistantly sampled landmark points $x_{ij} \in (\R^n)^N$, the path kernel $k_p = k_x$ is either a linear or Gaussian kernel:
\begin{equation} \label{geo_pathwise_kernel}
k_x(x_{ij}, x'_{kl}) =
\left\{
\begin{array}{ll}
\langle x_{ij} , x'_{kl} \rangle & \textrm{(linear, i.e., dot product)}\\
e^{-\lambda\|x_{ij} - x'_{kl}\|^2_2} & \textrm{(Gaussian)}
\end{array} \right.
\end{equation}
for a scaling parameter $\lambda$ which regulates the width of the Gaussian.

\vspace{2mm}

\noindent {\bf Node-path kernels.} The landmark point kernels are expensive to compute (see Table~\ref{computational_complexities}). In particular, two embedded tree-paths may have large overlapping segments without having a single overlapping equidistantly sampled landmark point, as the distance between landmark points depends on the length of the entire path. Thus, most landmark points will only appear in one path, giving little opportunity for recursive algorithms or dynamic programming that take advantage of repetitive structure. To enable such approaches, we use node-paths.

Assume that $\pi^1 = [\pi^1(1), \pi^1(2), \ldots, \pi^1(m)]$ and $\pi^2 = [\pi^2(1), \pi^2(2), \ldots, \pi^2(l)]$ are node-paths in $T_1, T_2$, respectively, as defined above, that is, sequences of consecutive nodes $\pi^i(j) \in V_i$ in $T_i$. We define
\begin{equation} \label{nodepath}
k_\pi(\pi^1, \pi^2) = \left\{
\begin{array}{ll}
\sum_{i = 1}^L k_n\left( x_1(\pi^1(i)), x_2(\pi^2(i)) \right) &  \textrm{ if } |\pi^1| = |\pi^2| = L\\
0 & \textrm{ otherwise}
\end{array}
\right.
\end{equation}
where $k_n$ is a node kernel. In this paper $k_n(v_1, v_2)$ is either a linear kernel without/with additional attributes $a_i$:
\[
\langle x_1(v_1) , x_2(v_2) \rangle, \quad \langle x_1(v_1) , x_2(v_2)\rangle \langle a_1(v_1) , a_2(v_2) \rangle
\]
or a Gaussian kernel with/without attributes $a_i$
\[
e^{- \lambda_1 \|x_1(v_1) - x_2(v_2)\|^2}, \quad e^{- \lambda_1\|x_1(v_1) - x_2(v_2)\|^2} \cdot e^{- \lambda_2 \|a_1(v_1) - a_2(v_2) \|^2},
\]
where the Gaussian weight parameters are heuristically set to the inverse dimension of the relevant feature space, i.e., $\lambda_1 = \frac{1}{n}$ and $\lambda_2 = \frac{1}{d}$.

Now the node-rootpath tree kernel $K_r$ can be rewritten as:
\begin{equation} \label{node_decomp_1}
K_r(T_1, T_2) = \sum_{l=1}^h \sum_{v_1 \in V_1^l} \sum_{v_2 \in V_2^l} \sum_{i=1}^l k_n \left( x_1(\pi_1(i)), x_2(\pi_2(i)) \right),
\end{equation}
where $h = \min \{\textrm{height}(T_i), i = 1,2\}$. This can be reformulated as a weighted sum of node kernels, giving substantially improved computational complexity:

\begin{prop} \label{desdecomp}
For each $l \le h$, let $V_i^l$ be the set of vertices at level $l$ in $T_i$. Then
\begin{equation} \label{des_decomp}
K_r(T_1, T_2) = \sum_{i = 1}^h \sum_{v_1 \in V_1^l} \sum_{v_2 \in V_2^l} \langle \des_{v_1} , \des_{v_2} \rangle k_n \left(v_1, v_2\right),
\end{equation}
where $\des_{v_i}$ is an $h$-dimensional vector whose $j^{\textrm{th}}$ coefficient counts the number of descendants of $v_i$ at level $j$ in $T_i$, respectively. The complexity of computing $K_r$ is $\mathcal{O}(h \max_l |V^l|^2  (n + h))$.

When $k_n$ is a linear kernel $\langle x_1(v_1), x_2(v_2) \rangle$ or $\langle x_1(v_1), x_2(v_2) \rangle  \langle a_1(v_1), a_2(v_2) \rangle$, the kernel $K_r$ can be further decomposed as
\begin{equation}
\begin{array}{c}
K_r(T_1, T_2) = \sum_{l = 1}^h \langle \gamma(T_1, l), \gamma(T_2, l)\rangle,\\
\gamma (T_i, l) = \left\{
\begin{array}{ll}
\sum_{v \in V_i^l} x_i(v) \otimes \des(v), & \textrm{\emph{no} } a_i\\
\sum_{v \in V_i^l} a_i(v) \otimes x_i(v) \otimes \des(v), & \textrm{\emph{with} } a_i
\end{array} \right.
\end{array}
\end{equation}
at total complexity  $\mathcal{O} (|V|  h  n)$ / $\mathcal{O} (|V|  h  n  d)$ (without/with attributes $a_i$). Here, $\otimes$ denotes the Kronecker product.
\end{prop}

\begin{proof}
Eq.~\eqref{des_decomp} follows from the fact that the terms $k_n(v_1, v_2)$ in kernel~\eqref{node_decomp_1} will be counted once for every pair $(w_1, w_2)$ of descendants of $v_1$ and $v_2$, respectively, which are at the same level. The descendant vectors $\des(v_i)$ for all $v_i \in V_i$ can be precomputed using dynamical programming at computational cost $\mathcal{O}(|V|  h)$, since $\des(v) = [1, \oplus_{p(w) = v} \des(w)]$, where $\oplus$ is defined as left aligned addition of vectors\footnote{e.g., $[a, b, c] \oplus [d, e] = [a  + d, b + e, c]$.}. The cost of computing $K_r$ is thus
\[
\mathcal{O}(|V|h + h\max_l |V^l|^2(h+n)) = \mathcal{O}(h \max_l |V^l|^2(n+h)),
\]
where $\mathcal{O}(n)$ is the cost of computing each node kernel $k_n(v_1, v_2)$.

To prove~\eqref{des_decomp} without attributes $a_i$, let $x_1(v_1), x_2(v_2), \des(v_1)$ and $\des(v_2)$ be column vectors and use the Kronecker trick ($\langle a_i, a_j\rangle \langle b_i, b_j\rangle = \langle b_i \otimes a_i, b_j \otimes a_j \rangle$):
\[\begin{array}{ll}
K(T_1, T_2) & = \sum_{l = 1}^h \sum_{v_1 \in V_1^l} \sum_{v_2 \in V_2^l} \langle \des(v_2), \des(v_1)\rangle \langle x_1(v_1),  x_2(v_2) \rangle\\
 & = \sum_{l = 1}^h \langle \sum_{v_2 \in V_2^l} \left( x_2(v_2) \otimes \des(v_2) \right), \sum_{v_1 \in V_1^l} x_1(v_1) \otimes \des(v_1)\rangle\\
 & = \sum_{l = 1}^h \langle \gamma(T_1, l), \gamma(T_2, l) \rangle.
\end{array}
\]
The total complexity is thus $\mathcal{O} (\max_{l, i} |V_i^l|  h  n) + \mathcal{O}(|V|  h) =  \mathcal{O} (|V|  h  n)$. Similar analysis proves the attributed case.
\qed \eop
\end{proof}

\vspace{-0.3cm}

\subsection{Pointcloud kernels} \label{sec:pointcloud}

Anatomical measurements can also be weighed by location using $3D$ position alone in a pointcloud kernel. The pointcloud kernel does not use the tree structure but treats each edges in the tree as a point and compares all points:
\begin{equation} \label{pointcloud_global}
K_{PC}(T_1, T_2) = \sum_{e_1 \in E_1} \sum_{e_2 \in E_2} k_e(e_1, e_2)
\end{equation}
where $k_e$ is a kernel on attributed edges. We use a Gaussian edge kernel (GPC):
\begin{equation}
k_e(e_1, e_2) = \underbrace{e^{- \lambda_1 \left\|x(e_1) - x(e_2) \right\|^2}}_{c_1} \underbrace{e^{- \lambda_2 \left\|a(e_1) - a(e_2) \right\|^2}}_{c_2}.
\end{equation}
The kernel is designed to weight the contribution to the total kernel $K_{PC}$ of the airway wall area percentage kernel value $c_1$ between edges $e_1$ and $e_2$ by the geometric alignment of the same edges, defined by the geometric kernel value $c_2$

\begin{table}[b]
\centering
\begin{tabular}{|c|c|c|}
\hline
 & Embedded paths & Node-path\\
 & ($m$ landmark points)  & \\
 \hline
All-paths & $\mathcal{O}(|V|^4  m  n)$ & $\mathcal{O}(|V|^2  h  \max_l |V^l|^2(n + h)$\\
\hline
Root-paths & $\mathcal{O} (|V|^2  m  n)$ & $\mathcal{O}(h  \max_l |V^l|^2)  (n + h)$\\
\hline
Attributed all-paths  & N/A & $\mathcal{O}(h  |V|^2  \max_l |V^l|^2)  (n + d + h)$ \\
\hline
Attributed root-paths & N/A & $\mathcal{O}(h  \max_l |V^l|^2)  (n + d + h)$ \\
\hline
Attributed linear root-paths & N/A &  $\mathcal{O} (|V|  h  n  d)$\\
\hline
Pointcloud kernel & N/A & $\mathcal{O}(|V|^2  n  d)$\\
\hline
\end{tabular}
\caption{Computational complexities for the considered kernels. Trees are assumed to be embedded in $\R^n$ and admit additional vector valued measurements in $\R^d$.}
\label{computational_complexities}
\end{table}

\subsection{Baseline kernels}

The kernels presented in this paper are compared to a set of baseline kernels. Standard airway wall area percentage measurements are often compared by using an average measure over parts of the tree or a vector of average measures in chosen generations. We use two baseline airway wall area percentage kernels:
\begin{equation} \label{eq:aaw}
K_{AAW\%}(T_1, T_2) = e^{- \|\hat{a}_1 - \hat{a}_2 \|^2},
\end{equation}
\begin{equation} \label{eq:agaw}
K_{AgAW\%}(T_1, T_2) = e^{- \|(\hat{a}_1)_{(3-6)} - (\hat{a}_2)_{(3-6)} \|^2}
\end{equation}
where $\hat{a}_i$ is the average airway wall area percentage averaged over all centerline points in the tree, and $(\hat{a}_i)_{(3-6)}$ is a $4$-dimensional vector of average airway wall area percentages averaged over all centerline points in generations $3-6$ in tree $T_i$. For these kernels (AAW\%, AgAW\%), linear versions were also computed (i.e. $e^{-\|w_1 - w_2\|^2}$ replaced with $\langle w_1, w_2 \rangle$), but the corresponding classification results are not reported as they were consistently weaker than the Gaussian kernels.

Airway segmentation is likely more difficult in diseased as opposed to healthy subjects, as also observed by~\cite{lauge}. In order to check whether the number of detected branches may be a bias in the studied kernels, we compare our kernels to a linear and a Gaussian branchcount kernel (LBC/GBC) defined by
\begin{equation} \label{eq:lbc}
K_{LBC}(T_1, T_2) = \sharp(V_1) \cdot \sharp(V_2), \quad K_{GBC}(T_1, T_2) = e^{-\| \sharp(V_1) - \sharp(V_2) \|^2}.
\end{equation}
The linear kernel LBC is the most natural, since the Hilbert space associated to a linear kernel on $w \in \R^n$ is just $\R^n$. However, a linear kernel on $1$-dimensional input cannot be normalized, as \eqref{normalize_kernel} produces a kernel matrix with entries $\equiv 1$, and the GBC kernel is used for comparison in Table~\ref{kernelres} to show that the geometric tree kernels are, indeed, measuring something other than branch count.

Several state-of-the-art graph kernels were also used. The random walk kernel~\cite{randomwalk} did not finish computing within reasonable time. The shortest path kernel~\cite{karsten_icdm} was computed with edge number as path length, and the Weisfeiler-Lehman kernel~\cite{weisfeiler_lehman} was computed with node degree as node label. Results are reported in Tables~\ref{comp_time},~\ref{perm_test} and~\ref{kernelres}.

\section{Experiments} \label{experiment}

\vspace{-2mm}

Analysis was performed on airway trees segmented from CT-scans of $1966$ subjects from a national lung cancer screening trial. Triangulated mesh representations of the interior and exterior wall surface were found using an optimal surface based approach \cite{petersen2011}, and centerlines were extracted from the interior surface using front propagation \cite{exact}. As the resulting centerlines are disconnected at bifurcation points, the end points were connected using a shortest path search within an inverted distance map of the interior surface. The airway centerline trees were normalized using person height as an isotropic scaling parameter. Airway wall thickness and airway radius were estimated from the shortest distance from each surface mesh vertex to the centerline. The measurements were grouped and averaged along the centerline by each nearest landmark point.

Out of the $1966$ participants, $980$ were diagnosed with COPD level 1-3 based on spirometry, and $986$ were symptom free. The minimal/maximal/average number of branches in an airway tree was $29/651/221.5$, respectively.

\begin{table}[t]
\centering
\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\hline
Kernel & Linear & Gaussian & average & average & Shortest & Weisfeiler \\
 & root-node- & branchcount & AW \% & generation & path & Lehman\\
 & path & & & AW \% & &  ($h = 10$)\\
\hline
Comp.~time & $46$ m $43$ s & $23$ m $3$ s & $0.87$ s & $ 1.61$ s & $42$ m $26$ s & $59$ m $23$ s \\
\hline
\end{tabular}
\caption{Runtime for selected kernels on a larger set of $9710$ airway trees.}
\label{comp_time}
\end{table}

\subsection{Kernel computation and computational time} \label{kernelcomp}

The kernels listed in table~\ref{kernelres} were implemented in Matlab~\footnote{Software: \url{http://image.diku.dk/aasa/software.php}; published software was used for SP, WL~\cite{weisfeiler_lehman}.} and computed on a 2.40GHz Intel Core i7-2760QM CPU with 32 GB RAM. Each kernel matrix was normalized to account for difference in tree size:
\begin{equation} \label{normalize_kernel}
K_{\text{norm}}(T_1, T_2) = \frac{K(T_1, T_2)}{\sqrt{K(T_1, T_1) K(T_2, T_2)}}.
\end{equation}
An exception was made for linear kernels between scalars (LBC and AAW\%), since normalization such kernels results gives matrix coefficients $ \equiv 1$.

Computation times for the different kernels used in the classification experiments in Section~\ref{classification} on $1966$ airway trees are shown in Table~\ref{kernelres}. To demonstrate scalability, some of the kernels were ran on $9710$ airways from a longitudinal study of the $1966$ participants, see Table~\ref{comp_time}. The slower kernels were not included.

For classification and hypothesis testing, a set of $1966$ airway trees from $1966$ distinct subjects was used ($980$ diagnosed with COPD at scan time).

\subsection{Hypothesis testing: Two-sample test for means} \label{hypothesis}

Let $\mathcal{X}$ denote a set of data objects. Given any positive semidefinite kernel $k \colon \mathcal{X} \times \mathcal{X}$ there exists an implicitly defined feature map $\phi \colon \mathcal{X} \to \mathcal{H}$ into a reproducing kernel Hilbert space $(\mathcal{H}, \langle \cdot \rangle )$ such that $k(x_1, x_2) = \langle \phi(x_1), \phi(x_2) \rangle$ for all $x_1, x_2 \in \mathcal{X}$~\cite{bishop}. Hypothesis tests can be defined in $\mathcal{H}$ to check whether two samples $A, B \subset \mathcal{X}$ are implicitly embedded by $\phi$ into distributions on $\mathcal{H}$ that have, e.g., the same means $\mu_A = \mu_B$~\cite{gretton}. Denote by $\hat{\mu}_A$ and $\hat{\mu}_B$ the sample means of $\phi(A)$ and $\phi(B)$ in $\mathcal{H}$, respectively; we use as a test statistic the distance
\[
T(A, B) = \|\hat{\mu}_A - \hat{\mu}_B\|_\mathcal{H}
\]
between the sample means and check the null hypothesis using a permutation test. Writing $|A| = a$ and  $|B| = b$, we divide $\mathcal{X} = A \cup B$ into $N$ random partitions $A_i, B_i$ of size $|A_i| = a$ and $|B_i| = b$, $i = 1 \ldots N$, compute the test statistic $T_i$ for each partition, and compare it with the statistic $T_0$ obtained for the original partition $\mathcal{X} = A \cup B$. An approximate $p$-value giving the probability of $\phi(A)$ and $\phi(B)$ coming from distributions with identical means $\mu_A = \mu_B$ is now given by $p = \frac{|\{T_i | T_i \ge T_0, i = 1 \ldots N\}| + 1}{N + 1}$. The $T$ statistic can be computed from a kernel matrix since distances in $\mathcal{H}$ can be derived directly from the values of $k(\mathcal{X}, \mathcal{X})$ using the binomial formula:
\[
\begin{array}{ll}
\|\hat{\mu}_A - \hat{\mu}_B\|^2 & = \langle \frac{1}{a} \sum_{i =1}^a \phi(a_i) - \frac{1}{b} \sum_{j=1}^b \phi(b_j), \frac{1}{a} \sum_{i =1}^a \phi(a_i) - \frac{1}{b} \sum_{j=1}^b \phi(b_j) \rangle\\
 & = \frac{1}{a^2} \sum_{i = 1}^a \sum_{m = 1}^a \langle \phi(a_i), \phi(a_m) \rangle - \frac{2}{ab} \sum_{i = 1}^a \sum_{j = 1}^b \langle \phi(a_i), \phi(b_j) \rangle\\
 & + \frac{1}{b^2} \sum_{j = 1}^b \sum_{n = 1}^b  \langle \phi(b_j), \phi(b_jn) \rangle\\
 & = \frac{1}{a^2} \sum_{i = 1}^a \sum_{m = 1}^a k\left(a_i, a_m\right) - \frac{2}{ab} \sum_{i = 1}^a \sum_{j = 1}^b k\left( a_i, b_j \right)\\
 & + \frac{1}{b^2} \sum_{j = 1}^b \sum_{n = 1}^b  k\left(b_j, b_n \right).
\end{array}
\]

Using the test with selected kernels we show that healthy airways and COPD airways do not come from the same distributions (Table~\ref{perm_test}).

\begin{table}[b]
\centering
\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|}
\hline
Kernel & Gaussian & Gaussian & Average  & Generation-\\
 & pointcloud & branchcount & AW-wall \% & average AW-wall \% \\
\hline
$p$-value & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$\\
\hline
\hline
Kernel & Linear & Linear & Shortest & Weisfeiler\\
 & all-node-path & Root-node-path & path & Lehman\\
\hline
$p$-value & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$ & $9.99 \cdot 10^{-5}$ \\
\hline
\end{tabular}
\caption{Permutation tests for the means of the COPD patient and healthy subject samples. All permutation tests are made with $10.000$ permutations.}
\label{perm_test}
\end{table}

\subsection{COPD classification experiments} \label{classification}

\begin{table}[t]
\centering
\begin{tabular}{|c|c|c|c|}
\hline
\bf Kernel type & \bf Mean class. & \bf Kernel matrix & \bf Mean class.\\
 & \bf accuracy & \bf computation time & \bf accuracy\\
 & & &  $\bf K + K_{GBC}$\\
\hline
Rootpath, linear~\eqref{rootpath_kernel},~\eqref{geo_pathwise_kernel} &  $62.4 \pm 0.7 \%$ & $9$ h $9$ m $20$ s & $\bf 66.8 \pm 0.4 \%$\\
\hline
Rootpath, Gaussian~\eqref{rootpath_kernel},~\eqref{geo_pathwise_kernel} &  $\bf64.9 \pm 0.4 \%$ & $6$ h $53$ m $21$ s & $\bf 68.2 \pm 0.5 \%$ \\
\hline
All-node-paths, linear~\eqref{allpaths_kernel},~\eqref{nodepath} & $62.0 \pm 0.6 \%$ & $3$ h $7$ s & $63.2 \pm 0.5 \%$\\
\hline
Root-node-path, linear~\eqref{rootpath_kernel},~\eqref{nodepath} & $61.8 \pm 0.7 \%$ & $4$ m $24$ s & $62.9 \pm 0.8 \%$\\
\hline
Root-node-path, Gaussian~\eqref{rootpath_kernel},~\eqref{nodepath} &  $\bf 64.4 \pm 0.8 \%$ & $97$ h $21$ m $45$ s & $\bf 64.9 \pm 0.6 \%$\\
\hline
Root-node-path, linear, $a_i$~\eqref{rootpath_kernel},~\eqref{nodepath} & $58.6 \pm 0.6 \%$ & $19$ m $44$ s & $62.3 \pm 0.8 \%$\\
airway wall area \% attribute & & & \\
\hline
Pointcloud, Gaussian~\eqref{pointcloud_global} & $\bf 64.4 \pm 0.6 \%$ & $18$ h $40$ m $26$ s & $\bf 66.5 \pm 0.6 \%$\\
\hline
Branchcount, linear~\eqref{eq:lbc} & $62.3 \pm 1.0 \%$ & $0.08$ s & N/A \\
\hline
Branchcount, Gaussian & $63.3 \pm 0.4 \%$ & $0.2$ & N/A \\
\hline
Linear kernel on $\%$ & $56.2 \pm 0.6 \%$ & $0.62$ s & $63.3 \pm 0.5 \%$\\
average airway wall area~\eqref{eq:aaw} & & & \\
\hline
Gaussian kernel on average & $60.3 \pm 0.2 \%$ & $0.35$ s & $63.3 \pm 0.5 \%$\\
airway wall area \%, & & & \\
generations $3-6$~\eqref{eq:agaw} & & & \\
\hline
Shortest path~\cite{karsten_icdm} & $62.6 \pm 0.4 \%$ & $20$ m $24$ s & $63.4 \pm 0.4 \%$\\
\hline
Weisfeiler Lehman ($h = 10$)~\cite{weisfeiler_lehman} & $62.1 \pm 0.5 \%$ & $14$ m $40$ s & $62.9 \pm 0.5 \%$\\
\hline
\end{tabular}
\caption{Classification results for COPD on $1966$ individuals, of which $893$ have COPD.}
\vspace{-0.5cm}
\label{kernelres}
\end{table}
Based on the kernel matrices corresponding to the kernels described in Sec.~\ref{kernelcomp} for a set of $1966$ airway trees, classification into COPD/healthy was done using a support vector machine (SVM)~\cite{libsvm}. The SVM slack parameter was trained using cross validation on $90 \%$ of the entire dataset, and tested on the remaining $10\%$. This experiment was repeated $10$ times and the mean accuracies along with their standard deviations are reported in Table~\ref{kernelres}. All kernel matrices were combined with the GBC kernel matrix in order to check whether the kernels were, in fact, detecting something other than branch number.

\section{Discussion}

We have constructed a family of kernels that operate on geometric trees, and seen that they give a fast way to compare large sets of trees. We have applied the kernels to hypothesis testing and classification of COPD based on airway tree structure and geometry, along with state-of-the-art methods. We show that there is a connection between COPD and airway wall area percentage, and the COPD detected based on our weighted airway wall area percentage kernels is stronger than what can be found using average airway wall area percentage measurements over different airway tree generations, which is commonly done~\cite{hasegawa,hackx}.

Efficient kernels for trees with vector-valued node attributes are difficult to design because algorithmically, similarity of vector-valued attributes is more challenging to efficiently quantify than equality of discrete-valued attributes. Nevertheless, some of the defined kernels for vector-attributed trees are fast enough to be applied to large datasets from clinical trials.

Vector-valued attributes are important from a modeling point of view, as they allow inclusion of geometric information such as branch shape or clinical measurements in the trees. However, there is a tradeoff between computational speed and optimal use of the attributes. The efficient node paths are less robust than the embedded paths in airway segmentations with missing or spurious branches, and we observe a small drop in classification performance in Table~\ref{kernelres}. Rootpath kernels are introduced to improve computational speed. However, they do introduce a bias towards increased weighting of parts of the tree close to the root, which are contained in more root-paths. Gaussian local kernels perform significantly better than linear ones (Table~\ref{kernelres}), which is particularly pronounced in the pointcloud kernel. In convolution kernels based on quantification of substructure similarity rather than isomorphic substructure, all the dissimilar substructures are still contributing to the total value of the kernel, and the Gaussian local kernel downscales the effect of dissimilar substructures much more efficiently than the linear kernel. This is particularly pronounced in kernels that use geometric weighting of airway wall measurement comparison. Unfortunately, however, algorithmic constructions like the Kronecker trick (Prop.~\ref{desdecomp}) do not work for the Gaussian kernels, which do not scale well to larger datasets.

Using hypothesis tests for kernels we show that the healthy and COPD diagnosed airway trees come from different distributions. Using SVM classification we show that COPD can be detected by kernels that depend on tree geometry, tree geometry attributed with airway wall area percentage measurements, or combinatorial airway tree structure. Another efficient detector of COPD is the number of branches detected in the airway segmentation. It is thus important to clarify that our defined kernels are not just sophisticated ways of counting the detected branches. Combining the GBC kernel with the other kernels improves classification performance of the geometrically informed tree and pointcloud kernels, showing that these kernels must necessarily contain independent information, and the connection between COPD and airway shape is more than differences in detected airway branch numbers. In contrast, graph kernels that only use the tree structure are not significantly improved by combination with the branch count kernel. Future work includes efficient ways of computing all-paths kernels with linear node attributes, efficient kernels for trees with errors in them, as well replacing the Gaussian local kernels with more efficient RBF type kernels.

\section*{Acknowledgements}

This research was supported by the Danish Council for Independent Research $|$ Technology and Production Sciences; the Lundbeck Foundation; AstraZeneca; The Danish Council for Strategic Research; Netherlands Organisation for Scientific Research; and the DFG project ''Kernels for Large, Labeled Graphs (LaLa)''.

\bibliographystyle{plain}

redpajama_set_name: RedPajamaArXiv


text:
'use strict'
/**
 * ## Imports
 * The InitialState for auth
 * fieldValidation for validating the fields
 * formValidation for setting the form's valid flag
 */
const InitialState = require('../initialState').default
import formValidation from './formValidation'
const fieldValidation = require('../../../common/reducers/fieldValidation').default

const {
  //create
  <%= moduleName_upperCase%>_CREATE_REQUEST_START,
  <%= moduleName_upperCase%>_CREATE_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_CREATE_REQUEST_FAILURE,

  //find
  <%= moduleName_upperCase%>_FIND_REQUEST_START,
  <%= moduleName_upperCase%>_FIND_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_FIND_REQUEST_FAILURE,

  //findById
  <%= moduleName_upperCase%>_FINDBYID_REQUEST_START,
  <%= moduleName_upperCase%>_FINDBYID_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_FINDBYID_REQUEST_FAILURE,

  //findOne
  <%= moduleName_upperCase%>_FINDONE_REQUEST_START,
  <%= moduleName_upperCase%>_FINDONE_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_FINDONE_REQUEST_FAILURE,

  //exists
  <%= moduleName_upperCase%>_EXISTS_REQUEST_START,
  <%= moduleName_upperCase%>_EXISTS_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_EXISTS_REQUEST_FAILURE,

  //count
  <%= moduleName_upperCase%>_COUNT_REQUEST_START,
  <%= moduleName_upperCase%>_COUNT_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_COUNT_REQUEST_FAILURE,

  //update
  <%= moduleName_upperCase%>_UPDATE_REQUEST_START,
  <%= moduleName_upperCase%>_UPDATE_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_UPDATE_REQUEST_FAILURE,

  //upsert
  <%= moduleName_upperCase%>_UPSERT_REQUEST_START,
  <%= moduleName_upperCase%>_UPSERT_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_UPSERT_REQUEST_FAILURE,

  //updateAttributes
  <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_START,
  <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_FAILURE,

  //delete
  <%= moduleName_upperCase%>_DELETE_REQUEST_START,
  <%= moduleName_upperCase%>_DELETE_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_DELETE_REQUEST_FAILURE,

  //getChangeStream
  <%= moduleName_upperCase%>_GETCHANGESTREAM_REQUEST_START,
  <%= moduleName_upperCase%>_GETCHANGESTREAM_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_GETCHANGESTREAM_REQUEST_FAILURE,

  //createChangeStream
  <%= moduleName_upperCase%>_CREATECHANGESTREAM_REQUEST_START,
  <%= moduleName_upperCase%>_CREATECHANGESTREAM_REQUEST_SUCCESS,
  <%= moduleName_upperCase%>_CREATECHANGESTREAM_REQUEST_FAILURE,

  <%= moduleName_upperCase%>_LIST,
  <%= moduleName_upperCase%>_LIST_INIT_START,

  <%= moduleName_upperCase%>_ITEM,
  <%= moduleName_upperCase%>_ITEM_INIT_START,
  <%= moduleName_upperCase%>_FORMFIELD_CHANGE

} = require('../../common/constants').default

const initialState = new InitialState

/**
 * ## reducer function
 * @param {Object} state - initialState
 * @param {Object} action - type and payload
 */
export default function reducer(state = initialState, action) {
  if (!(state instanceof InitialState)) {
    return initialState.mergeDeep(state)
  }

  switch (action.type) {

    // case <%= moduleName_upperCase%>_DELETE_START:
    case <%= moduleName_upperCase%>_ITEM:
     let newState = state.setIn(['form','isFetching'], false)
        .setIn(['form','fields','id'], action.payload.fields.id)
        .setIn(['form','fields','text'], action.payload.fields.text)
        .setIn(['form','fields','completed'], action.payload.fields.completed)
        .setIn(['form','fields','createdAt'], action.payload.fields.createdAt)
        .setIn(['form','fields','updatedAt'], action.payload.fields.updatedAt)
        .setIn(['form','title'], action.payload.title)
        //console.log('<%= moduleName_upperCase%>_ITEM newState:',newState)
        return newState

    //create
    case <%= moduleName_upperCase%>_CREATE_REQUEST_START:
     return state.setIn(['form','error'], null)
       .setIn(['form','isFetching'], true)

    case <%= moduleName_upperCase%>_CREATE_REQUEST_SUCCESS:
        return state.setIn(['form','isFetching'], false)
         .setIn(['form','error'], null)
         .setIn(['form','fields','id'], action.payload.res.id)
         .setIn(['form','fields','text'], action.payload.res.text)
         .setIn(['form','fields','completed'], action.payload.res.completed)
         .setIn(['form','fields','createdAt'], action.payload.res.createdAt)
         .setIn(['form','fields','updatedAt'], action.payload.res.updatedAt)

    case <%= moduleName_upperCase%>_CREATE_REQUEST_FAILURE:
      return state.setIn(['form','isFetching'], false)
        .setIn(['form','error'], action.payload)

    //updateAttributes
    case <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_START:
     return state.setIn(['form','isFetching'], true)
       .setIn(['form','error'], null)

    case <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_SUCCESS:
      let item = action.payload.res
      return state.setIn(['form','isFetching'], false)
       .setIn(['form','error'], null)
       .setIn(['form','fields','id'], item.id)
       .setIn(['form','fields','text'], item.text)
       .setIn(['form','fields','completed'], item.completed)
       .setIn(['form','fields','createdAt'], item.createdAt)
       .setIn(['form','fields','updatedAt'], item.updatedAt)
      // return state.setIn(['form','isFetching'], false)
      //  .setIn(['form','error'], null)
      //  .setIn(['form','fields'], action.payload.item)

    case <%= moduleName_upperCase%>_UPDATEATTRIBUTES_REQUEST_FAILURE:
      return state.setIn(['form','isFetching'], false)
        .setIn(['form','error'], action.payload)

    case <%= moduleName_upperCase%>_FORMFIELD_CHANGE: {
      const {field, value} = action.payload
      let nextState =  state.setIn(['form', 'fields', field], value)
            .setIn(['form','error'],null)
      return formValidation(
        fieldValidation(nextState, action)
        , action)
    }
  }
  /**
   * ## Default
   */
  return state
}

redpajama_set_name: RedPajamaGithub


Welcome at the Hotel Sonne in Kirchberg, near Kitzbühel! Your family run wellness hotel with interantional flair and classy casualness! Located in the heart of the impressive Kitzbüheler Alps, our hotel is a recreation area that will enchant you and your family!


Updates to Nellie's profile since your last visit are highlighted in yellow.
We have been married since 1970. I've been a housewife for most of that time. We were married about 10 years before having a child.
Our son is an accountant here in Indianapolis and has a son of his own whom I have spoiled rotten. He is also the youth pastor at our church. He and his wife work hard ministering to the teens. We have been very blessed.Our son is a wonderful musician like his Dad. Elijah wants to be and will be someday.
I remember throwing spit balls at Charles Trotter in Mr. Cooks science class my freshman year. Maybe that is why I sat in the very back of the room. I hated Science but had fun..
Nellie Gibson Anderson has a birthday today.
Nellie Gibson Anderson has left an In Memory comment for Jimmy Anderson.
He was one of the best muscians I have ever heard. He was a wonderful husband and father and will be sadly missed by family and friends. He died In Avon In on Nov. 5th 2014 from colon cancer and other major health problems. He attended New Faith Baptist Church where he was over the music ministry. He left behind one son David Anderson, Daughter in law Debie, Grandson Elijah and wife Nellie.


Have a Straight Shot of Booze Balm!
Chances are your beard is a lot like you and is resistant to falling in line, this balm will give your beard what it needs to keep it in control and well maintained. Beard Booze Original beard balm is made up of all natural oils and butters. This is unscented and will pair well with Beard Booze beard oils or your favorite cologne. The Original balm will leave your beard feeling soft, looking shiny and well groomed. Your beard is thirsty, give it the nourishment it needs for a healthy growing environment!


text:
About CU
Contact CU
Gilmore-Futeral
Kelsey Gilmore-Futeral
Kelsey Gilmore-Futeral is a legislative attorney with Best Friends Animal Society, based in Kanab, Utah. She grew up in South Dakota where she developed her passion for animal welfare
and moved to Charleston, SC to compete on the equestrian team at the College of Charleston where she stayed for law school. Kelsey co-founded the Charleston School of Law's Student Animal Legal Defense Fund chapter and graduated magna cum laude. Kelsey served as the chair of the SC Bar's Animal Law Committee from 2015 - 2018 and served as an officer on the board of directors for Alliance of Therapy Dogs, the nation's premier dog therapy registry, from 2010 until 2022. For Best Friends, Kelsey works to address legislative and policy priorities across the country with the goal of ending the killing of healthy and treatable animals in America's shelters
by 2025. She is an adjunct professor with the Charleston School of Law teaching Animal Law and lives just outside Charleston, SC with her husband, three rescue Japanese Chin dogs, and
horse.
Engaging Public Officials to Empower Shelters
Wednesday, March 1 | 11:00am
© Copyright CarolinasUnite 2017, All Right Reserved


text:
European Technology Platform on Smart Systems Integration (EPoSS e. V.)
The European Technology Platform on Smart Systems Integration (EPoSS) is a European Seventh Framework Programme initiative to improve the competitive situation of the European Union in the field of Smart Systems Technologies and integrated Micro and Nanosystems.

The programme is a joint initiative (Public-Private Partnership) of the European Commission, representing the European Communities, and the industry.

EPoSS, the European Technology Platform on Smart Systems Integration, is an industry-driven policy initiative, defining R&D and innovation needs as well as policy requirements related to Smart Systems Integration and integrated Micro- and Nanosystems.

EPoSS is an international non-profit association according to German law. The EPoSS Association was founded on 18 September 2013. Its structure consists of Board, General Assembly, Executive Committee, Working Groups and Office (EPoSS structure).

A group of major industrial companies and research organisations (EPoSS Members) from more than 20 European Member States intend to co-ordinate their activities in the field of Smart Systems Integration. A main objective is to develop a vision and to set up a Strategic Research Agenda (SRA).

EPoSS brings together European private and public stakeholders in order to create an enduring basis for structuring initiatives, for co-ordinating and bundling efforts, for setting up sustainable structures of a European Research Area on Smart Systems Integration. EPoSS embraces all key players, public and private, in the value chain so as to:

 provide a common European approach on Innovative Smart Systems Integration from research to production, outlining the key issues for a strategic European innovation process,
 define priorities for common research and innovation in the future,
 formulate commonly agreed road maps for action (updating, assembling and completing existing material and approaches) and provide a strategic R&D agenda, and
 mobilise public and private human, infrastructural and financial resources.

The initiative is of immediate importance in view of defining research and technology priorities for the EU Framework Programme for Research and Innovation, for raising more critical mass as well as resources and for coordinating different initiatives (national, regional, EUREKA, European public funding and industry).

EPoSS is a strategic partner of the European Platform for Sport Innovation.

Smart Systems and Smart Systems Integration
Smart Systems affect many aspects of our lives. They are bringing a new generation of diagnostic instruments to clinics. They are bringing innovative automatic safety systems to cars and public transport. They are becoming embedded into consumer goods, into the networks that power and inform society, and they are underpinning the efficient provision of public and private services. Increasingly they sense their surroundings, operate autonomously and collaborate with other Smart Systems.

Smart technologies promise to break the "faster, smaller, cheaper" circle that has for decades now characterised hi-tech commerce and forced the migration of commodity manufacture towards low-cost economies. The reason for this potential break is that Smart Systems extract and condense human skills and knowledge to add not only functionality but also value to products: value that is the skill, knowledge and has historically been the genius of European culture.

A smart medical diagnostic stand-alone instrument encapsulates the skills and expertise of a whole laboratory to provide value far in excess of its component parts. Likewise smart safety systems and smart networks deliver a broad range of expertise, care and attention continuously, tirelessly and invisible to the user.

Smart Systems Integration is an assembly of technologies that build products from components, that combine functions in products and systems, that connect and network systems to other systems, and, importantly, enable systems to receive and store a "knowledge base" – the software that makes them "Smart".

Bringing this set of technologies together is far more ambitious than the "faster, smaller, cheaper" objectives of the past. It needs a concerted effort from education and on through research and development, product design and manufacture, all the way to the development of new business models and markets: a whole "Ecosystem" to nurture competitive advantage for the European Smart Systems community.

EPoSS SRA
The connection between Smart Systems and the many application sectors they serve has been emphasized in the Strategic Research Agendas of EPoSS.

Smart Systems combine cognitive functions with sensing, actuation, data communication and energy management in an integrated way. The enabling principles of these functions include nanoelectronics, micro-electromechanics, magnetism, photonics, chemistry and radiation.

Smart systems are often integrated into the (natural, built and social) environment, networks for power and data and other smart systems. It is a sufficient (or extrinsic) condition for the smartness of a system to provide (and use) cognitive support to (and from) its surroundings.

The EPoSS SRA is a reference document that provides an executive review of the main issues around Smart Systems, then continues with ten self-contained "Mini SRAs" describing the particular issues, prospects, timescales and research priorities of seven application sectors and three cross-sector domains.

The seven applications sectors are Transport & Mobility; Health & Beyond; Manufacturing / Factory Automation; Communications; Energy; Aerospace; Smart Systems for the Environment. The three cross-sector domains are Safety, Security & Reliability; Technologies Supporting Smart Systems; and Production Processes for Smart Systems.

SSI Trademark
EPoSS is an owner of the SSI Trademark: Smart Systems Integrated® is a Collective European Union Trademark, according to Council Regulation (EC) no.207/2009. It is valid for ten years and may be renewed. It has been registered by the EPoSS Association which has been its owner since 2017.

Smart Systems Integrated® concerns Smart Systems Technologies or innovative products integrating Smart Systems (Smart Systems Products) updated according to the EPoSS SRA.

See also
 European Technology Platform
 Joint Technology Initiative

References

 Interrelation between ICT ETPs
 EPoSS (speech)
Akhras, G., "Smart Materials and Smart Systems for the Future", Canadian Military Journal, 08/2000

Internet-of-Things in 2020 – A roadmap for the future, 2008

Electronic Components and Systems, Strategic Research Agenda 2018 (ECS-SRA)

External links
European Technology Platform on Smart Systems Integration

Science and technology in Europe
European Union and science and technology

redpajama_set_name: RedPajamaWikipedia


Recognizing the symptoms of a burst appendix at the right time can save someone's life. To gather some valuable information related to the signs and symptoms of ruptured appendix, you must read this article.
The appendix is a small, finger-shaped organ in the right lower quadrant of the abdomen. The human body does not use this organ for any purpose. The main cause of inflammation in the appendix or appendicitis, is a blockage inside it. This organ tends to get blocked by feces or due to some infections caused by bacteria or virus. As a result, pressure builds up inside it, the normal blood flow gets affected and it swells up. When it is badly inflamed and infected, there is a possibility of a ruptured appendix. This is a life-threatening condition, as bursting of the appendix can result in spread of the infection in the entire abdomen.
The symptoms are more or less the same as appendicitis, but their intensity is far more severe. The sharp abdominal pain caused by burst appendix originates from the belly button and spreads to the right side up to the hip area. However, small children may complain about a stabbing pain in the entire abdomen.
This pain starts all of a sudden (mostly in the middle of the night), and turns severe with every passing hour. It gets aggravated with movements, coughing, sneezing, and deep breaths. In the initial stage of appendicitis, the pain comes and goes, but the pain that starts after the appendix is ruptured is intolerable and refuses to die down in spite of all efforts. Even a gentle touch on the appendix area gives extreme pain.
High fever is another key symptom found in these patients once the appendix ruptures. When there is only a minor swelling in the appendix, one gets a mild fever. However, as the inflammation becomes severe, perforations occur in it. Thus the pus accumulated inside the organ is released into the abdominal cavity. The bacteria present in the pus then attacks the lining of the abdominal wall. The body temperature rises when the infection spreads inside the abdomen.
The digestive system is badly affected due to this condition. It leads to improper bowel movements, and the patient either suffers from diarrhea or constipation. Inflamed and ruptured appendix may lead to intestinal blockage. Nausea, frequent vomiting and swelling in the abdomen accompanied by bloated condition indicate seriously damaged digestive system. For this reason, a person loses appetite and stops feeling hungry.
The only treatment option available for appendicitis is surgery. In case of a burst appendix, an appendiceal abscess is formed surrounding the appendix which is full of pus. The formation of this pus-filled mass is a natural mechanism of the body to prevent any further spread of the infection. Before the surgery, this pus has to be drained out. For this, the exact location of the abscess is identified with the help of a CT scan. Then a drainage tube is placed in the abscess through the abdominal wall to empty the pus from the belly. Usually, it takes a few weeks, during which the patient is given intravenous antibiotics and fluids for the treatment of the infection inside the abdomen.
An inflamed appendix is surgically removed with the help of laparoscopy, where three or four small incisions are made on the abdominal wall for this purpose. Surgery for a burst appendix is a more complicated procedure. The patient is released from the hospital only after the doctors have ensured that all the bacteria inside the abdomen have been destroyed.
Burst appendix is a very serious health condition which you cannot afford to ignore. If you find that any of your near and dear ones is experiencing these symptoms, then that the person should be rushed to the hospital for emergency medical care. Quick diagnosis and treatment can prevent the patient from a severe form of infection called peritonitis, which can lead to death of the patient.


text:
Ielîseiivka (în ) este o comună în raionul Prîmorsk, regiunea Zaporijjea, Ucraina, formată numai din satul de reședință.

Demografie

Conform recensământului din 2001, majoritatea populației comunei Ielîseiivka era vorbitoare de ucraineană (%), existând în minoritate și vorbitori de rusă (%).

Note

Ielîseiivka, Prîmorsk, Zaporijjea
Ielîseiivka, Prîmorsk, Zaporijjea
Ielîseiivka, Prîmorsk, Zaporijjea


text:
Sleeping With Enemy
Posted By: adminon: August 03, 2019 In: ColumnsNo Comments
Baba Rehmata A Political and Economic Analyst
From Quaid e Azam to Imran Khan, all the political leadership of Pakistan seems have been sleeping with the enemy. All but Imran Khan have met their proverbial death, and by the looks of events shaping up, his fate is sealed. Timing will be crucial for so many reasons.
They were not enemies to begin with. They were lovers. How and why they become enemies, and why sleeping became nightmare? It's an open secret.
What happened to Quaid e Azam we got to know about it almost 60 years later. He was given an ambulance with no patrol in it. Father of a nation died on the road but no one spoke about it. But what went wrong? Why he was tragically left to die? Who planned it, and why?
Coming back to Imran Khan the current Quaid e Azam, he was darling till he got elected. May be this has been the cause with everyone else before him. Why Imran Khan's honeymoon ending before it beginning?, needs to be analyzed, though fruitless. As Nawaz Sharif is tasting it and it's being witnessed by all.
Imran's dilemma started when PTI was not even given a simple majority, let alone a comfortable lead in an elections, marred by controversies unheard before. People with any political insight started saying that this government will not last the full term. People started giving it timelines, one year may be two years, some gave it months. But optimism is infectious disease and PTI is suffering from it. I guess political parties anywhere in the world suffer from incurable optimism syndrome, PTI is no exception.
Pakistan, before and after any elections was infected with optimism syndrome, making the outgoing government as incurable virus causing the pessimism syndrome and making people zombies. And incoming government as the only antidote people were waiting for. Then all hell breaks lose. Corrupt, Traitor and Kafir cause infection, and then they become cancer and needed to be dissected with an operation. Sometime with invasive procedure and most times non-invasive procedure, depending on level of resistance to anesthesia assessed. No matter who is on the operation table, it's painful for all involved, except for the surgeon. He is never emotionally involved in the process, doing a job which no one is allowed to do or can do.
Coming back to causes of Imran's current government's negative disposition on display, no matter how voluntary or involuntary. Imran's arrival was knitted with making a New Pakistan. Change. A new beginning. Pakistan, giving equal opportunity to everyone. Pakistan, a power to recon with, and so on and so forth. But how they would achieve it? People thought Imran Khan knew, but now it is clear as sunshine that he doesn't even have the slightest idea. Clueless.
Imran's cabinet gave it away, he was not allowed to change a thing, it seems he reconciled with it momentarily as well. His choice of Finance minister started making things go sideways.
Asad Umer's incompetence is now well documented, perception or reality, debatable? Listen to his brother to make any independent judgment. His departure was talked about in the first month on the job, and it seems Imran Khan wanted him in and he was kicked out any way.
Imran's refusal to given NRO to Nawaz Sharif seems to be his biggest stumbling block right now. He is refusing and they are insisting. Since Nawaz Sharif, in person cannot come to power anymore after two convictions; there is no need to keep him in jail and create another unnecessary Bhutto. Though it seems Bhutto has lost its charm with the arrival of Zardari and running PPP. It's desirable that PMLN may be handed over to someone as uncharismatic as Zardari. Hamza seems better choice than Maryam. Maryam is being equated with Hasina Wajid. She has to improve her acceptability, if she wants any future in politics.
New lovers turn enemies needs to realize that this relationship's end is predictable like all Bollywood movies, happy ending. I guess not for everyone. Is Imran's enemy same as Nawaz Sharif's enemy? Your guess would as accurate as 2+2=——-.
Imran orders restoration of previous naan, roti prices
India's use of cluster bombs: Pakistan to brief envoys of UNSC's permanent five


text:
Mississippi Moving to Ban Deer Importation, Other Steps to Combat Disease
Published by CWD Alliance on February 17, 2003 February 17, 2003
Growing concern over a fatal brain disease in deer reported in some Western states has lawmakers and wildlife officials cooperating to postpone – if not block entirely – its spread into Mississippi.
Chronic wasting disease (CWD) creates sponge-like holes in the deer's brain, causing the animal to grow thin, act abnormal and die.
There's no scientific evidence the disease, currently incurable, can infect humans.
In 2002, Mississippi imposed a brief moratorium on the importation and intrastate movement of all deer and elk within state borders.
The Legislature is now moving to enact a ban on bringing white tailed deer and a moratorium on bringing elk, mule deer and similar animals that are considered susceptible to CWD into the state.
Bills passed last week in the Senate also authorize wildlife officials to conduct intensive testing of dead animals found on public and private lands. The bills now go to the House.
"The legislation gives us a better handle on preventing the disease from coming to the Southeast," said Larry Castle, a wildlife biologist with the Mississippi Department of Wildlife, Fisheries and Parks.
Castle said Mississippi has many landowners who have fenced off areas and stocked them with deer purchased out of state. He said wildlife officials want that to stop while testing for CWD goes on.
He said CWD may take years to reach Mississippi.
"But it could be here tomorrow in the back of trailer. It is a very wise proposition for us to stop it," Castle said.
In the past 10 years, chronic wasting disease has been found in Colorado, Wyoming, Nebraska, Kansas, Montana, New Mexico, Oklahoma, South Dakota, Wisconsin and in Canada.
To combat the disease, many states follow a policy of shooting any deer, even apparently healthy ones, that may have come into contact with a sick animal.
Senate Wildlife Committee Chairman Lynn Posey, D-Union Church, said lawmakers want wildlife officials to have a tough law on the books to attack CWD before it gets to Mississippi.
"A lot of these other states have gotten behind the eight ball and now they're having to try to do things to prevent the spread. Our aim is to get ahead of the game," Posey said.
Castle said killing off a herd when one of the deer is found with CWD is the best science known today. He said there is no test currently approved to detect the disease in live animals.
"We've got the luxury of being able to see what the other states – who have had the disease now for some 20-odd years – have done correctly and incorrectly," Castle said.
DWFP began last year educating its wildlife personnel on what to watch for in potential CWD-carrying deer. Castle said the department is also relying on hunters to report any sick deer.
He said not all sick deer could have CWD because it mimics other sicknesses common to such animals.
"People are going to see sick deer all the time. We don't want them to get alarmed just because they see a sick deer," he said.
Nevertheless, Castle said all dead animals need to be tested.
"We're also encouraging hunters and landowners to avoid practices that could potentially escalate the spread of the disease – like supplemental feeding or mineral licks that bring about an unnatural concentrating of deer," Castle said.
Posey said CWD is highly contagious among the deer and elk populations.
"We're trying to react on the front end of this thing and protect our native game animals from something being brought in here that has already been infected and then spreads the disease," he said.
Castle said the testing begun last year and through the hunting season this year should give biologists a good idea whether CWD has shown up in Mississippi
MS – CWD confirmed in additional Mississippi counties
2/19/2019 3:25:37 PM From MDWFP JACKSON – The Mississippi Department of Wildlife, Fisheries, and Parks (MDWFP) received confirmation a female white-tailed deer from Panola County and a female white-tailed deer from Tallahatchie County tested positive Read more…
MS – UPDATE: Second Issaquena County White-tailed Deer Confirmed for CWD
11/29/2018 8:09:14 AM From MDWFP Issaquena – The Mississippi Department of Wildlife, Fisheries, and Parks (MDWFP) received confirmation from the National Veterinary Services Laboratory that the hunter-harvested 2.5-year-old, female white-tailed deer voluntarily submitted in Issaquena Read more…
MS – Chronic Wasting Disease Confirmed in Pontotoc County
10/30/2018 3:24:47 PM From MDWFP PONTOTOC – The Mississippi Department of Wildlife, Fisheries, and Parks (MDWFP) received confirmation from the National Veterinary Services Laboratory that a white-tailed deer collected in Pontotoc County on October 8, 2018 tested positive for Chronic Wasting Read more…