Cozi is a family organization website and mobile app designed to streamline household management. It offers shared calendars, to-do lists, shopping lists, and messaging tools, allowing multiple users to coordinate under one account. Founded in 2005 by former Microsoft employees, Cozi has evolved through acquisitions and now operates under OurFamilyWizard. The app is available in both free and premium versions on iOS, Android, and desktop platforms. == History == Cozi was founded in 2005 by Robbie Cape and Jan Miksovsky, two former Microsoft employees who sought to simplify family logistics with technology. The company's first product, Cozi Central, was released on September 25, 2006, and included a family calendar, shopping lists, family messaging and a photo collage screensaver. The company is based in Seattle, Washington. Cozi has both a freemium version, and a paid version called Cozi Gold. Cozi Gold's additional features include Cozi Contacts, a birthday tracker, more reminders, mobile month view, and change notifications. The software can be used on desktop or mobile applications for iOS and Android. On June 5, 2011, Cozi set a Guinness World Record for the longest line of ducks in a row. The line stretched for one mile and was made up of 17,782 rubber ducks. Cozi was acquired by Time Inc. in 2014. After the Meredith Corporation acquired Time in 2018, Cozi was moved into the Parents Network division. On May 4, 2022, Cozi was acquired by OurFamilyWizard of Minneapolis, Minnesota, reporting more than 20 million registered users.
Spanish Network of Excellence on Cybersecurity Research
The Spanish Network of Excellence on Cybersecurity Research (RENIC), is a research initiative to promote cybersecurity interests in Spain. == Members == === Board of Directors (2018) === President: Universidad de Málaga Vice president: CSIC Treasurer: Universidad Politécnica de Madrid Secretary: Universidad de Granada Vocals: Tecnalia, Universidad de La Laguna and Universidad de Modragón === Board of Directors (2016) === President: Universidad Carlos III de Madrid Vice president: Universidad Politécnica de Madrid Treasurer: Universidad de Granada Secretary: Universidad de León Vocals: Gradiant, Tecnalia, Universidad de Málaga === Founding Members === Centro Andaluz de Innovación y Tecnologías de la Información y las Comunicaciones (CITIC). Consejo Superior de Investigaciones Científicas (CSIC). Centro Tecnolóxico de Telecomunicaciones de Galicia (Gradiant). Instituto Imdea Software. Instituto Nacional de Ciberseguridad (INCIBE). Mondragón Unibertsitatea. Tecnalia. Universidad Carlos III de Madrid. Universidad Castilla la Mancha. Universidad de Granada. Universidad de la Laguna. Universidad de León. Universidad de Málaga. Universidad de Murcia. Universidad de Vigo. Universidad Internacional de la Rioja. Universidad Politécnica de Madrid. Universidad Rey Juan Carlos. === Members === Consejo Superior de Investigaciones Científicas (CSIC). Centro Tecnolóxico de Telecomunicaciones de Galicia (Gradiant). Instituto Imdea Software. Instituto Nacional de Ciberseguridad (INCIBE). Mondragón Unibertsitatea. Tecnalia. Universidad Carlos III de Madrid. Universidad de Castilla-La Mancha. Universidad de Granada. Universidad de la Laguna. Universidad de León. Universidad de Málaga. Universidad de Murcia. Universidad de Vigo. Universidad Politécnica de Madrid. Universidad Rey Juan Carlos. Universitat Oberta de Catalunya. IKERLAN. === Honorary Members === Centre for the Development of Industrial Technology (CDTI). (2017) Instituto Nacional de Ciberseguridad (INCIBE). (2016) == Initiatives and Participations == RENIC is ECSO member, and is also a member of its board of directors. A collaboration agreement between RENIC and the Innovative Business Cluster on Cybersecurity (AEI Cybersecurity) has been signed. RENIC is pleased to sponsor the Cybersecurity Research National Conferences (JNIC) JNIC2017 edition, organized by Universidad Rey Juan Carlos. RENIC is pleased to announce the publication of the online version of the Catalog and knowledge map of cybersecurity research
Residuated Boolean algebra
In mathematics, a residuated Boolean algebra is a residuated lattice whose lattice structure is that of a Boolean algebra. Examples include Boolean algebras with the monoid taken to be conjunction, the set of all formal languages over a given alphabet Σ {\displaystyle \Sigma } under concatenation, the set of all binary relations on a given set X {\displaystyle X} under relational composition, and more generally the power set of any equivalence relation, again under relational composition. The original application was to relation algebras as a finitely axiomatized generalization of the binary relation example, but there exist interesting examples of residuated Boolean algebras that are not relation algebras, such as the language example. == Definition == A residuated Boolean algebra is an algebraic structure ( L , ∧ , ∨ , ¬ , 0 , 1 , ∙ , I , / , ∖ ) {\displaystyle (L,\wedge ,\vee ,\neg ,0,1,\bullet ,\mathbf {I} ,/,\backslash )} such that An equivalent signature better suited to the relation algebra application is ( L , ∧ , ∨ , ¬ , 0 , 1 , ∙ , I , ▹ , ◃ ) {\displaystyle (L,\wedge ,\vee ,\neg ,0,1,\bullet ,\mathbf {I} ,\triangleright ,\triangleleft )} where the unary operations x ∖ {\displaystyle x\backslash } and x ▹ {\displaystyle x\triangleright } are intertranslatable in the manner of De Morgan's laws via x ∖ y = ¬ ( x ▹ ¬ y ) {\displaystyle x\backslash y=\neg (x\triangleright \neg y)} , x ▹ y = ¬ ( x ∖ ¬ y ) {\displaystyle x\triangleright y=\neg (x\backslash \neg y)} , and dually / y {\displaystyle /y} and ◃ y {\displaystyle \triangleleft y} as x / y = ¬ ( ¬ x ◃ y ) {\displaystyle x/y=\neg (\neg x\triangleleft y)} , x ◃ y = ¬ ( ¬ x / y ) {\displaystyle x\triangleleft y=\neg (\neg x/y)} , with the residuation axioms in the residuated lattice article reorganized accordingly (replacing z {\displaystyle z} by ¬ z {\displaystyle \neg z} ) to read ( x ▹ z ) ∧ y = 0 ⇔ ( x ∙ y ) ∧ z = 0 ⇔ ( z ◃ y ) ∧ x = 0 {\displaystyle (x\triangleright z)\wedge y=0\ \Leftrightarrow \ (x\bullet y)\wedge z=0\ \Leftrightarrow \ (z\triangleleft y)\wedge x=0} This De Morgan dual reformulation is motivated and discussed in more detail in the section below on conjugacy. Since residuated lattices and Boolean algebras are each definable with finitely many equations, so are residuated Boolean algebras, whence they form a finitely axiomatizable variety. == Examples == Any Boolean algebra, with the monoid multiplication ∙ {\displaystyle \bullet } taken to be conjunction and both residuals taken to be material implication x → y {\displaystyle x\to y} . Of the remaining 15 binary Boolean operations that might be considered in place of conjunction for the monoid multiplication, only five meet the monotonicity requirement, namely 0 , 1 , x , y {\displaystyle 0,1,x,y} and x ∨ y {\displaystyle x\vee y} . Setting y = z = 0 {\displaystyle y=z=0} in the residuation axiom y ≤ x ∖ z ⇔ x ∙ y ≤ z {\displaystyle y\leq x\backslash z\ \Leftrightarrow \ x\bullet y\leq z} , we have 0 ≤ x ∖ 0 ⇔ x ∙ 0 ≤ 0 {\displaystyle 0\leq x\backslash 0\ \Leftrightarrow \ x\bullet 0\leq 0} , which is falsified by taking x = 1 {\displaystyle x=1} when x ∙ y = 1 {\displaystyle x\bullet y=1} , x {\displaystyle x} , or x ∨ y {\displaystyle x\vee y} . The dual argument for z / y {\displaystyle z/y} rules out x ∙ y = y {\displaystyle x\bullet y=y} . This just leaves x ∙ y = 0 {\displaystyle x\bullet y=0} (a constant binary operation independent of x {\displaystyle x} and y {\displaystyle y} ), which satisfies almost all the axioms when the residuals are both taken to be the constant operation x / y = x ∖ y = 1 {\displaystyle x/y=x\backslash y=1} . The axiom it fails is x ∙ I = x = I ∙ x {\displaystyle x\bullet \mathbf {I} =x=\mathbf {I} \bullet x} , for want of a suitable value for I {\displaystyle \mathbf {I} } . Hence conjunction is the only binary Boolean operation making the monoid multiplication that of a residuated Boolean algebra. The power set 2 X 2 {\displaystyle 2^{X^{2}}} made a Boolean algebra as usual with ∩ {\displaystyle \cap } , ∪ {\displaystyle \cup } and complement relative to X 2 {\displaystyle X^{2}} , and made a monoid with relational composition. The monoid unit I {\displaystyle \mathbf {I} } is the identity relation { ( x , x ) | x ∈ X } {\displaystyle \{(x,x)|x\in X\}} . The right residual R ∖ S {\displaystyle R\backslash S} is defined by x ( R ∖ S ) y ⇔ ∀ z ∈ X , z R x ⇒ z S y {\displaystyle x(R\backslash S)y\ \Leftrightarrow \ \forall z\in X,zRx\Rightarrow zSy} . Dually the left residual S / R {\displaystyle S/R} is defined by y ( S / R ) x ⇔ ∀ z ∈ X , x R z ⇒ y S z {\displaystyle y(S/R)x\ \Leftrightarrow \ \forall z\in X,xRz\Rightarrow ySz} . The power set 2 Σ ∗ {\displaystyle 2^{\Sigma ^{}}} made a Boolean algebra as for Example 2, but with language concatenation for the monoid. Here the set Σ {\displaystyle \Sigma } is used as an alphabet while Σ ∗ {\displaystyle \Sigma ^{}} denotes the set of all finite (including empty) words over that alphabet. The concatenation L M {\displaystyle LM} of languages L {\displaystyle L} and M {\displaystyle M} consists of all words u v {\displaystyle uv} such that u ∈ L {\displaystyle u\in L} and v ∈ M {\displaystyle v\in M} . The monoid unit is the language { ε } {\displaystyle \{\varepsilon \}} consisting of just the empty word ε {\displaystyle \varepsilon } . The right residual M ∖ L {\displaystyle M\backslash L} consists of all words w {\displaystyle w} over Σ {\displaystyle \Sigma } such that M w ⊆ L {\displaystyle Mw\subseteq L} . The left residual L / M {\displaystyle L/M} is the same with w M {\displaystyle wM} in place of M w {\displaystyle Mw} . == Conjugacy == The De Morgan duals ▹ {\displaystyle \triangleright } and ◃ {\displaystyle \triangleleft } of residuation arise as follows. Among residuated lattices, Boolean algebras are special by virtue of having a complementation operation ¬ {\displaystyle \neg } . This permits an alternative expression of the three inequalities y ≤ x ∖ z ⇔ x ∙ y ≤ z ⇔ x ≤ z / y {\displaystyle y\leq x\backslash z\ \Leftrightarrow \ x\bullet y\leq z\ \Leftrightarrow \ x\leq z/y} in the axiomatization of the two residuals in terms of disjointness, via the equivalence x ≤ y ⇔ x ∧ ¬ y = 0 {\displaystyle x\leq y\ \Leftrightarrow \ x\wedge \neg y=0} . Abbreviating x ∧ y = 0 {\displaystyle x\wedge y=0} to x # y {\displaystyle x\#y} as the expression of their disjointness, and substituting ¬ z {\displaystyle \neg z} for z {\displaystyle z} in the axioms, they become with a little Boolean manipulation ¬ ( x ∖ ¬ z ) # y ⇔ x ∙ y # z ⇔ ¬ ( ¬ z / y ) # x {\displaystyle \neg (x\backslash \neg z)\#y\ \Leftrightarrow \ x\bullet y\#z\ \Leftrightarrow \ \neg (\neg z/y)\#x} Now ¬ ( x ∖ ¬ z ) {\displaystyle \neg (x\backslash \neg z)} is reminiscent of De Morgan duality, suggesting that x ∖ {\displaystyle x\backslash } be thought of as a unary operation f {\displaystyle f} , defined by f ( y ) = x ∖ y {\displaystyle f(y)=x\backslash y} , that has a De Morgan dual ¬ f ( ¬ y ) {\displaystyle \neg f(\neg y)} , analogous to ∀ x ϕ ( x ) = ¬ ∃ x ¬ ϕ ( x ) {\displaystyle \forall x\phi (x)=\neg \exists x\neg \phi (x)} . Denoting this dual operation as x ▹ {\displaystyle x\triangleright } , we define x ▹ z {\displaystyle x\triangleright z} as ¬ x ∖ ¬ z {\displaystyle \neg x\backslash \neg z} . Similarly we define another operation z ◃ y {\displaystyle z\triangleleft y} as ¬ ( ¬ z / y ) {\displaystyle \neg (\neg z/y)} . By analogy with x ∖ {\displaystyle x\backslash } as the residual operation associated with the operation x ∙ {\displaystyle x\bullet } , we refer to x ▹ {\displaystyle x\triangleright } as the conjugate operation, or simply conjugate, of x ∙ {\displaystyle x\bullet } . Likewise ◃ y {\displaystyle \triangleleft y} is the conjugate of ∙ y {\displaystyle \bullet y} . Unlike residuals, conjugacy is an equivalence relation between operations: if f {\displaystyle f} is the conjugate of g {\displaystyle g} then g {\displaystyle g} is also the conjugate of f {\displaystyle f} , i.e. the conjugate of the conjugate of f {\displaystyle f} is f {\displaystyle f} . Another advantage of conjugacy is that it becomes unnecessary to speak of right and left conjugates, that distinction now being inherited from the difference between x ∙ {\displaystyle x\bullet } and ∙ x {\displaystyle \bullet x} , which have as their respective conjugates x ▹ {\displaystyle x\triangleright } and ◃ x {\displaystyle \triangleleft x} . (But this advantage accrues also to residuals when x ∖ {\displaystyle x\backslash } is taken to be the residual operation to x ∙ {\displaystyle x\bullet } .) All this yields (along with the Boolean algebra and monoid axioms) the following equivalent axiomatization of a residuated Boolean algebra. y # x ▹ z ⇔ x ∙ y # z ⇔ x # z ◃ y {\displaystyle y\#x\triangleright z\ \Leftrightarrow \ x\bullet y\#z\ \Leftrightarrow \ x\#z\triangleleft y} With this signature it remains the case that this axiomatization can be expressed as
Take Us to Your Chief: and Other Stories
Take Us to Your Chief: and Other Stories is a collection of nine short stories by Canadian author, playwright, and journalist Drew Hayden Taylor published in 2016 by Douglas & McIntyre. Taylor, who is part Caucasian, part Ojibwe, explains in the acknowledgments section of the book that the origin of the project lies in several failed attempts "to compile an anthology of Native sci-fi from Canada’s best First Nations writers." The stories explore contemporary First Nations social issues through employing a number of 1950s-era science fiction tropes and themes in these stories, including time travel, alien contact, and superpowers. Many reviews of the books have noted Taylor's use of humor to examine dark subject matter, such as the heritage of Canadian Indian residential schools, First Nations suicide rates, or the water quality crisis on Canadian reserves. == The Stories == "Andrei nas" "I Am...Am I" "Lost in Space" "Dreams of Doom" "Mr. Gizmo" "Petropaths" "Stars" "Superdisappointed" "Take Us to Your Chief" == Story summaries == === Foreword === In his foreword, Taylor describes the genesis of Take Us to Your Chief: and Other Stories and invites readers into, in his term, a “new terra nullius.” He begins by describing his biracial upbringing and heritage. He points out that First Nations people are rarely associated with technology or science fiction, in part because Indigenous peoples were often at a technological disadvantage against European colonizers. He references the few examples that he can think of from popular culture, such as the Star Trek episode called “The Paradise Syndrome,” in which First Nations people are portrayed as stereotypical Indians in hippie clothing. He also elaborates on his fascination with the world of sci-fi, which first started in comic books. He enjoyed the literary work of H.G. Wells, such as The Time Machine and The Invisible Man. Since sci-fi is a world of endless opportunities, he intends that these short stories help people explore science fiction through Native peoples’ minds, something that needs to be explored more thoroughly. === "A Culturally Inappropriate Armageddon" === “A Culturally Inappropriate Armageddon” is set on a Haudenosaunee reserve, towards the end of the Oka Crisis, with a handful of people that work at its first ever radio station, C-RES, which opens in 1991. Part 1, titled “C-Res Is on the Air,” depicts Emily, Aaron, and Tracey on their first days at the station. Within the group, there is a constant debate between broadcasting popular programming, including science fiction and film reviews, and culturally-relevant programming meant to aid in cultural revitalization efforts. One night, Aaron is late to work but once he shows up he can't stop talking about radio transmissions broadcasting into deep space, an event that has been occurring since the initial discovery of the radio waves by Heinrich Hertz. The story then skips ahead seven years to 1998, when Emily is struggling to find better content for her station until Tracey stumbles upon an old anthropological record named “The Calling Song” that they decide to broadcast to their audience. The story then jumps to the year 2018 where they are all huddled around a television watching a news station reporting that extraterrestrial life is heading towards them. The discussion of what is going to happen comes into the picture and they all decide it would either be like Contact or The Day the Earth Stood Still. A year later in 2019, the aliens have invaded the planet and destroyed everything. As the three former radio station employees suffer from radioactive fallout, they realize that the aliens received the broadcast of “The Calling Song” and took it as a message to come to Earth. They thus realize that the Haudenosaunee people were inadvertently responsible for the destruction of the Earth. Part 2, titled “Old Men and Old Sayings,” tells us of an elderly man that is watching the news and listening to the radio about a spaceship coming to earth. He knows that he and everyone will die, but the people around him are excited. He finds a book on his night stand and flips to a page where he underlined a sentence a long time ago about the European colonization of the Americas. That sentence reads “those who cannot remember the past are condemned to repeat it” (23). He closes the book and Taylor concludes the story by writing, “he hated it when white people were right." === "I Am...Am I" === “I Am...Am I” chronicles the accidental creation and unexpected ending of artificial intelligence. Professor Mark King has a plethora of degrees and works for a research firm called FUTUREVISION. One night as Professor King searches the lab for his car keys—a common occurrence for him—he notices something unusual in the Matrix room. He reads on a computer the phrase “I am.” First believing it to be a prank, King later comes to the realization that his Matrix project has evolved into a responsive Artificial Intelligence. After this realization, Professor King calls his peer Dr. Gayle Chambers to further investigate this miraculous event. After receiving approval from their superiors, Professor King and Dr. Chambers move forward in feeding the AI information, with Chambers serving as the lead communicator. With more information, it becomes increasingly concerned with its own existence and the concept of whether it has a soul. After several days of conversation with the AI, Chambers and King begin to feel uneasy about the AI's responses, which show signs of neuroses. Despite this behavior, Chambers decides to feed the AI information about the culture and history of the human race. Upon receiving this information, the AI becomes obsessed with Indigenous spirituality prior to the colonization of the Americas, and it requests more information on First Nations people. Dr. Chambers is hesitant at first, but gives in and continues to feed the AI the information with the intention to return to it in the morning. This leads to the AI finding out about colonization and genocide of Indigenous peoples. Upon her arrival the next day, Chambers discovers that the code for the AI has been completely wiped from the hard drive and a single message is left on the screen—"I was”—that signifies the AI's suicide. === "Lost in Space" === "Lost in Space" is told from the perspective of Mitchell, an Anishinabe astrosurveyor who is aboard a space shuttle on a two-year tour collecting rocks from an asteroid belt. He is accompanied by an Artificial general intelligence named Mac, short for “machine.” Mac is aboard this tour in order to accompany Mitchell and keep him sane; however, his company is a burden because for Mitchell, “true space exploration consists largely of boredom.” In the midst of Mitchell seeking a way to occupy his downtime, Mac interrupts with news about his grandfather, Papa Peter, dying. Papa Peter was Mitchell's only real tie to his Indigenous identity. After receiving the news Mitchell begins to reminisce on all of the things Papa Peter had taught him throughout his life. He constantly posed questions concerning the world above (Father Sky) and how it is more important than the land they live on (Mother Earth), which eventually led Mitchell to the selection of his career. During his state of mourning, Mitchell begins to go through all the videos his grandfather had sent him throughout his space tours. Papa Peter had sent Mitchell videos from Otter Lake, a First Nations reserve; these videos are about controversial topics regarding being both native and an astronaut. In the midst of Mitchell's grieving, Mac tries to relieve the situation by finding an online video of Mitchell's grandfather participating in a drum ceremony at Ottawa’s National Aboriginal Day festival. He reconnects to his roots and his grandfather’s spirit as he listens to the Indigenous music by feeling the drum beat and humming along. Mac’s small act of kindness leads Mitchell to gain a new-found appreciation for his presence. Mitchell feels responsible to moving forward in his life in memory of Papa Peter. === "Dreams of Doom" === "Dreams of Doom" is narrated by an Ojibway reporter named Pamela Wanishin who works for an aboriginal newspaper called the West Wind. One day she receives a mysterious package with a broken dreamcatcher and a flash drive containing highly classified files. As she reads the files, she keeps seeing the term “Project Nightlight,” and out of curiosity, she Googles it. Once she Googles this, she is contacted by a nameless agent from Indigenous and Northern Affairs Canada and told that she must be relocated because the knowledge she now possesses must never be released to the public. She quickly flees the area to a cabin at Otter Lake, owned by a family member, to lie low for a few days. Eventually, the government organization tracks her down using drones, which forces her to fight back and flee once again. Pamela then runs to her friend and coworker Sally's hous
Fuzzy electronics
Fuzzy electronics is an electronic technology that uses fuzzy logic, instead of the two-state Boolean logic more commonly used in digital electronics. Fuzzy electronics is fuzzy logic implemented on dedicated hardware. This is to be compared with fuzzy logic implemented in software running on a conventional processor. Fuzzy electronics has a wide range of applications, including control systems and artificial intelligence. == History == The first fuzzy electronic circuit was built by Takeshi Yamakawa et al. in 1980 using discrete bipolar transistors. The first industrial fuzzy application was in a cement kiln in Denmark in 1982. The first VLSI fuzzy electronics was by Masaki Togai and Hiroyuki Watanabe in 1984. In 1987, Yamakawa built the first analog fuzzy controller. The first digital fuzzy processors came in 1988 by Togai (Russo, pp. 2–6). In the early 1990s, the first fuzzy logic chips were presented to the public. Two companies which are Omron and NEC have announced the development of dedicated fuzzy electronic hardware in the year 1991. Two years later, the Japanese Omron Cooperation has shown a working fuzzy chip during a technical fair.
Zhura
Zhura ( ZUR-ə) is a free, web-based screenwriting software application for writing and formatting screenplays to the film industry standard, as well as other formats. Zhura allows users to collaborate on scripts in public or private groups and uses Creative Commons Licensing for all work in the public workspace. On March 29, 2010, Zhura announced its merger with Scripped. Scripped's CEO, Sunil Rajaraman, remains the company's Chief Executive Officer (CEO) as of 2022. The Zhura CEO was Eric MacDonald, a former Cascade Communications engineer. Scripped later closed on April 1, 2015 after a catastrophic, irrecoverable data loss. == Script editor == Screenplay Template – The script editor provides a built-in screenplay template which formats the document to a standard for scripts as recommended by the AMPAS. The screenplay document is composed of seven elements: scene, action, character, dialogue, parenthetical, transition, and shot (see image). Each element has a specific style to which the script editor conforms as you type.Script Formats – Other major script formats for stage play, sitcom, audio drama and comic book are also supported as well as the ability to switch between them.Auto-Complete – Characters, scene headings and custom transitions are “remembered” as they are written and “recalled” with tab-completion when a writer starts a new character, scene heading or transition, respectively.Multiple Editors – With a collaborative editing model comparable to Google Docs, two or more users can edit the same script simultaneously, regardless of having a different operating system or web browser. Import/Export – A screenplay written in another program can be imported into the script editor and automatically conformed to the screenplay template. The closer the original script has adhered to the standard format, the better it will appear when imported. Supported import/export formats include Text (.txt) Word (.doc) Rich Text (.rtf) and OpenDocument (.odt). Scripts can also be exported as a PDF file with additional options.Tracking Changes – Similar to the “tracking” feature in Microsoft Word, a user can review all changes made to a script in the revision history as well as highlight the contributions of each writer. Offline Mode – The Google Gears-based offline functionality is in the process of being updated and is not available for new subscribers, according to the company founders. == Community == Scripped supports typical social networking features such as discussion boards, comments, user profiles, public and private writing groups, internal web mail and instant messaging within the script editor. There is also the option to share scripts with others outside of Scripped by making scripts externally viewable. Scripped is made up entirely of user-generated scripts that other users can share, critique and edit, offering creative support to a community of writers. == Licensing of user-created work == There are three types of work-spaces on Scripped (personal, group and public) with unique copyright and licensing management for the work created in each area. Any work a user originates may be moved from the personal area to a public or group area at any time. Once another user edits a script, however, it cannot be moved into the originator’s personal area. Personal Workspace – Any script created or video uploaded in the user’s personal workspace remains copyrighted to that user. Until the user moves that script or video from their personal area into a group or public area, no other user shares a copyright or license to that work. Private Group Workspace – The copyright to any script created or video uploaded in a private group workspace is allocated by the individual members of the group, however they see fit. Public Workspace – Any script created or video uploaded in the public workspace is assigned a Creative Commons license by the originator of that work. The originator of a script may select one of four Creative Commons licenses before introducing that script to the public. The selection of the license is determined by what the author wants to allow others to do with the work. Below is a list of Creative Commons licenses available for all scripts and videos in the public workspace. Share Alike (BY-SA) This license lets others remix, tweak, and build upon your work even for commercial reasons, as long as they credit the original user and license their new creations under the identical terms. This license is often compared to open source software licenses. All new works based on the original user's will carry the same license, so any derivatives will also allow commercial use. No Derivatives (BY-ND) This license allows for redistribution, commercial and non-commercial, as long as it is passed along unchanged and in whole, with credit to the original user. Non-Commercial, No Derivatives (BY-NC-ND) This license is the most restrictive of the four licenses, allowing redistribution. This license is often called the "free advertising" license because it allows others to download the original user work and share them with others as long as they mention the original user and link back to them, but they can't change them in any way or use them commercially. Non-Commercial, Share Alike (BY-NC-SA) This license lets others remix, tweak, and build upon the original user's work non-commercially, as long as they credit the original user and license their new creations under the identical terms. Others can download and redistribute the original user's work just like the BY-NC-ND license, but they can also translate, make remixes, and produce new stories based on the original user's work. All new work based on the original user's work will carry the same license, so any derivatives will also be non-commercial in nature. == Events == In April 2008, Zhura partnered with Improv Asylum, a comedy troupe in Boston, Massachusetts to produce a live sketch comedy show called "You Wrote It, Live" entirely written by the public on Zhura. Another show was produced in June.
Evolutionary computation
Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated. Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes as well as, depending on the method, mixing parental information. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection), mutation and possibly recombination. These biological functions serve as role models for the genetic operators - mutation, crossover, and selection - used in the EC procedures. As a result, the population will gradually evolve to increase in fitness, in this case the chosen fitness function of the algorithm. Evolutionary computation techniques can produce highly optimized solutions in a wide range of problem settings, making them popular in computer science. Many variants and extensions exist, suited to more specific families of problems and data structures. Evolutionary computation is also sometimes used in evolutionary biology as an in silico experimental procedure to study common aspects of general evolutionary processes. == History == The concept of mimicking evolutionary processes to solve problems originates before the advent of computers, such as when Alan Turing proposed a method of genetic search in 1948 . Turing's B-type u-machines resemble primitive neural networks, and connections between neurons were learnt via a sort of genetic algorithm. His P-type u-machines resemble a method for reinforcement learning, where pleasure and pain signals direct the machine to learn certain behaviors. However, Turing's paper went unpublished until 1968, and he died in 1954, so this early work had little to no effect on the field of evolutionary computation that was to develop. Evolutionary computing as a field began in earnest in the 1950s and 1960s. There were several independent attempts to use the process of evolution in computing at this time, which developed separately for roughly 15 years. Three branches emerged in different places to attain this goal: evolution strategies, evolutionary programming, and genetic algorithms. A fourth branch, genetic programming, eventually emerged in the early 1990s. These approaches differ in the method of selection, the permitted mutations, and the representation of genetic data. By the 1990s, the distinctions between the historic branches had begun to blur, and the term 'evolutionary computing' was coined in 1991 to denote a field that exists over all four paradigms. In 1962, Lawrence J. Fogel initiated the research of Evolutionary Programming in the United States, which was considered an artificial intelligence endeavor. In this system, finite state machines are used to solve a prediction problem: these machines would be mutated (adding or deleting states, or changing the state transition rules), and the best of these mutated machines would be evolved further in future generations. The final finite state machine may be used to generate predictions when needed. The evolutionary programming method was successfully applied to prediction problems, system identification, and automatic control. It was eventually extended to handle time series data and to model the evolution of gaming strategies. In 1964, Ingo Rechenberg and Hans-Paul Schwefel introduce the paradigm of evolution strategies in Germany. Since traditional gradient descent techniques produce results that may get stuck in local minima, Rechenberg and Schwefel proposed that random mutations (applied to all parameters of some solution vector) may be used to escape these minima. Child solutions were generated from parent solutions, and the more successful of the two was kept for future generations. This technique was first used by the two to successfully solve optimization problems in fluid dynamics. Initially, this optimization technique was performed without computers, instead relying on dice to determine random mutations. By 1965, the calculations were performed wholly by machine. John Henry Holland introduced genetic algorithms in the 1960s, and it was further developed at the University of Michigan in the 1970s. While the other approaches were focused on solving problems, Holland primarily aimed to use genetic algorithms to study adaptation and determine how it may be simulated. Populations of chromosomes, represented as bit strings, were transformed by an artificial selection process, selecting for specific 'allele' bits in the bit string. Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms. While previous methods only tracked a single optimal organism at a time (having children compete with parents), Holland's genetic algorithms tracked large populations (having many organisms compete each generation). By the 1990s, a new approach to evolutionary computation that came to be called genetic programming emerged, advocated for by John Koza among others. In this class of algorithms, the subject of evolution was itself a program written in a high-level programming language (there had been some previous attempts as early as 1958 to use machine code, but they met with little success). For Koza, the programs were Lisp S-expressions, which can be thought of as trees of sub-expressions. This representation permits programs to swap subtrees, representing a sort of genetic mixing. Programs are scored based on how well they complete a certain task, and the score is used for artificial selection. Sequence induction, pattern recognition, and planning were all successful applications of the genetic programming paradigm. Many other figures played a role in the history of evolutionary computing, although their work did not always fit into one of the major historical branches of the field. The earliest computational simulations of evolution using evolutionary algorithms and artificial life techniques were performed by Nils Aall Barricelli in 1953, with first results published in 1954. Another pioneer in the 1950s was Alex Fraser, who published a series of papers on simulation of artificial selection. As academic interest grew, dramatic increases in the power of computers allowed practical applications, including the automatic evolution of computer programs. Evolutionary algorithms are now used to solve multi-dimensional problems more efficiently than software produced by human designers, and also to optimize the design of systems. == Techniques == Evolutionary computing techniques mostly involve metaheuristic optimization algorithms. Broadly speaking, the field includes: Agent-based modeling Ant colony optimization Particle swarm optimization Swarm intelligence Artificial immune systems Artificial life Digital organism Cultural algorithms Differential evolution Dual-phase evolution Estimation of distribution algorithm Evolutionary algorithm Genetic algorithm Evolutionary programming Genetic programming Gene expression programming Grammatical evolution Evolution strategy Learnable evolution model Learning classifier system Memetic algorithms Neuroevolution Self-organization such as self-organizing maps, competitive learning Over recent years many dubious algorithms have been proposed, that are often just copies of existing algorithms (frequently Particle Swarm Optimization), where only the metaphor changed, but the algorithm itself is not new at all. A thorough catalogue with many of these dubious algorithms has been published in the Evolutionary Computation Bestiary. It is also important to note that many of these dubiously 'novel' algorithms have poor experimental validation. == Evolutionary algorithms == Evolutionary algorithms form a subset of evolutionary computation in that they generally only involve techniques implementing mechanisms inspired by biological evolution such as reproduction, mutation, recombination and natural selection. Candidate solutions to the optimization problem play the role of individuals in a population, and the cost function determines the environment within which the solutions "live" (see also fitness function). Evolution of the population then takes place after the repeated application of the above operators. In this process, there are two main forces that form the basis of evolutionary systems: Recombination (e.g. crossover) and mutation create the necessary diversity and thereby facilitate novelty, while selection acts as a force increasing quality. Many aspects of such an evolutionary process are stochastic. Changed pieces of information due to recombination and mutati