In databases an index is a data structure, part of the database, used by a database system to efficiently navigate access to user data. Index data are system data distinct from user data, and consist primarily of pointers. Changes in a database (by insert, delete, or modify operations), may require indexes to be updated to maintain accurate user data accesses. Index locking is a technique used to maintain index integrity. A portion of an index is locked during a database transaction when this portion is being accessed by the transaction as a result of attempt to access related user data. Additionally, special database system transactions (not user-invoked transactions) may be invoked to maintain and modify an index, as part of a system's self-maintenance activities. When a portion of an index is locked by a transaction, other transactions may be blocked from accessing this index portion (blocked from modifying, and even from reading it, depending on lock type and needed operation). Index Locking Protocol guarantees that phantom read phenomenon won't occur. Index locking protocol states: Every relation must have at least one index. A transaction can access tuples only after finding them through one or more indices on the relation A transaction Ti that performs a lookup must lock all the index leaf nodes that it accesses, in S-mode, even if the leaf node does not contain any tuple satisfying the index lookup (e.g. for a range query, no tuple in a leaf is in the range) A transaction Ti that inserts, updates or deletes a tuple ti in a relation r must update all indices to r and it must obtain exclusive locks on all index leaf nodes affected by the insert/update/delete The rules of the two-phase locking protocol must be observed. Specialized concurrency control techniques exist for accessing indexes. These techniques depend on the index type, and take advantage of its structure. They are typically much more effective than applying to indexes common concurrency control methods applied to user data. Notable and widely researched are specialized techniques for B-trees (B-Tree concurrency control) which are regularly used as database indexes. Index locks are used to coordinate threads accessing indexes concurrently, and typically shorter-lived than the common transaction locks on user data. In professional literature, they are often called latches.
Bring your own encryption
Bring your own encryption (BYOE), also known as bring your own key (BYOK), is a cloud computing security model that allows cloud service customers to use their own encryption software and manage their own encryption keys. == Overview == BYOE enables cloud service customers to utilize a virtual instance of their encryption software alongside their cloud-hosted business applications to encrypt their data. In this model, hosted business applications are configured to process all data through the encryption software. This software then writes the ciphertext version of the data to the cloud service provider's physical data store and decrypts ciphertext data upon retrieval requests. This approach provides enterprises with control over their keys and the ability to generate their own master key using internal hardware security modules (HSM), which are then transmitted to the cloud provider's HSM. When the data is no longer needed, such as when users discontinue the cloud service, the keys can be deleted, rendering the encrypted data permanently inaccessible. This practice is known as crypto-shredding. == Potential Advantages == Organizations can store data with unique encryption that only they can access. Multiple organizations can share the same hardware infrastructure via cloud services like Amazon Web Services (AWS) or Google Cloud while maintaining encryption to comply with regulations such as HIPAA. == Potential Challenges == Resource utilization may be higher compared to traditional encryption practices when multiple users share the same hardware and use their own encryption. Efforts to minimize resource utilization issues may potentially impact security benefits.
2024 Abu Dhabi Autonomous Racing League
On 27 April 2024, the inaugural race of the Abu Dhabi Autonomous Racing League was held at the Yas Marina Circuit in Abu Dhabi. The race, originally scheduled to last eight laps, was ultimately shortened to six laps due to various complications, including subpar performance. It involved four self-driving race cars, only two of which – German cars Hailey and Constructor AI – finished the race; the other two did not finish. == Background == === Abu Dhabi Autonomous Racing League (A2RL) === The A2RL is an autonomous racing championship based in Abu Dhabi and organized by ASPIRE, part of the Advanced Technology Research Council. It is one of two active autonomous car racing championships, the second being the US-based Indy Autonomous Challenge. Unlike the IAC, which primarily focuses on time trials, simulated races, and challenges for teams, the A2RL's car races are closer to a standard grand prix formula race format. Both use Dallara-supplied racecars; the IAC uses the AV-24 chassis derived from Indy NXT's IL-15, while the A2RL chassis is designated EAV-24 and is derived from the SF-23 chassis used in Japanese Super Formula races. === Entrants === In total, eight teams were part of the A2RL in 2024, but only four would compete in the race proper. The list of teams in 2024 is: Fly Eagle (China/UAE) Code19 Racing (United States) Constructor University (Germany) Kinetiz (Singapore/UAE) Humda Lab (Hungary) PoliMove (Italy) Unimore (Italy) Technical University of Munich (Germany) Most teams come from universities and many, such as PoliMove and TUM, already have experience with autonomous racing, primarily from competing in the IAC. All teams had two months to code and test their AIs. Unlike most international open-wheel racing tournaments, such as Formula 1 or Formula E, no free practice sessions were undertaken. === TII Pre-race demonstration === Prior to the race itself, a mock 1v1 duel between former F1 driver Danill Kvyat and a self-driving car from the non-competing TII Racing team took place; the autonomous car was green and had number 01, while Kvyat's car was red and had number 00. Kvyat spent most of the duel in the pits. Kvyat himself said: "I'm not racing autonomous cars here. It won't be a flat-out race". == Qualifying == === Qualifying report === As only four of the eight entrants would compete in the main event, qualifying time trials were held to determine the four main race competitors, as well as their positions in the grid. Only the cars with the four best lap times over three time trial sessions held on Friday and Saturday would qualify. Multiple errors and setbacks occurred during qualifying. In the first session, Maveric AI, Code19's car, left the track and stopped just after turn 14 due to connectivity issues. Fly Eagle's car, Feiying, had multiple upsets; at one point, Feiying ran into localization issues and began swerving left and right before stopping just before turn 10. Later, Feiying swerved again and nearly hit the wall at the back straight, near the support pits, due to further localization issues. Sparkz, the Kinetiz team's car, swerved and crashed into the wall near yacht berths 51-56 after turn 11, damaging the front right wheel's axle and partially detaching the forward wings. Sparkz would be the only car to not have a set time at the end of the time trials. PoliMove car Eva braked hard without warning at the straight, the LED status indicator turning off, suggesting the AI computer had a system crash or shut itself down. After the sun went down, during the second session, Hailey, the car from the TUM team, went off-track after turn 9 and stopped, its status indicator flashing red, meaning Hailey's AI disengaged itself. Eva had further issues, once again braking hard and spinning out into turn 1. Later, the same thing happened to Feiying; it later swerved left and right and stopped due to further localization issues. The morning after, during the third and final session, Hailey went off-track after turn 5, and were unable to regain the pole position. === Qualifying classification === == Attack/Defend challenge == === Attack/Defend challenge report === In this part of the event, cars would be put on a series of 1v1 duels to see how well they could defend their position or attack to gain one higher. During one such duel, an incident occurred where Hailey rear-ended Eva, sending both off the track and prematurely ending the duel. The challenge was otherwise uneventful. === Attack/Defend challenge results === == Main race == === Race report === Eventually, at around 20:30 Gulf Standard Time on the night of 27 April, the main event (termed the "Grand Final" on-stream) would begin. The starting order was Eva first, Gianna second, Hailey third, and Constructor AI last. The race began with a rolling start. As a safety measure, the first two laps were conducted under virtual safety car (VSC) to make sure the cars stayed together, making them de facto formation laps, even if they counted towards race distance. However, Hailey ended up stopping at the final turn and strayed too far from the cars ahead, and as a result, the VSC conditions were extended for another lap. According to the livestream's on-screen graphics, Hailey was upwards of one minute and 22.3 seconds behind Gianna after the former started moving again. On lap 4, halfway through the planned race, and with Hailey more than 30 seconds behind Gianna, the VSC was lifted, and the green flag finally dropped. At first, the two Italian cars were leading the pack, Eva was the race leader with Gianna 3.2 seconds behind, however, as it entered the chicane, Eva hit the brakes and spun out, with Gianna briefly stopping as it passed Eva. Eva's spin automatically triggered a full-course yellow flag. Normally, under yellow flag conditions, overtaking is not permitted, but with Eva stopped and being moved off the track, it was theoretically permitted to overtake Eva. However, presumably due to an oversight in the AI's code, the cars assumed overtaking Eva, despite being off the track, was not permitted. As a result, both Gianna and Constructor AI stopped as they did not want to overtake Eva due to the yellow flag, with Hailey following suit as it approached. Constructor AI's status indicator was solid red, suggesting the AI had disengaged; however, Gianna's status indicator remained solid purple, showing the AI was still in control. Eva's status indicator was also solid purple, but was soon flashing green, suggesting the AI had disengaged but was ready to take control again. With all cars stalled, and Eva being off the track, the race was effectively red-flagged and suspended. Hailey, Gianna, and Constructor AI drove themselves back to their team's pits; Eva did not, it was towed to the main pits on a flatbed truck. Constructor was the first to arrive at the pits, followed by Gianna and Hailey, in that order. This incident, combined with loss of internet connection, led to Eva retiring - it did not finish the race. Eventually, it was decided to resume the race. With Eva retired, the restart order was Gianna first, Hailey second, and Constructor AI third. The race was also shortened - from eight laps to six. With lap 5 under full-course yellow, this meant all three remaining teams would effectively restart the race on the sixth and final lap. The trio left the pits at 22:25 Gulf Standard Time, and the race resumed two minutes later. At first, Gianna was winning with Hailey 2.6 seconds behind, but then Gianna stopped on turn 5, giving Hailey the lead. Constructor AI also overtook Gianna, but not without briefly stopping. Gianna remained stopped, its status indicator solid red - it did not finish either. With both Italian teams out of the picture, Hailey finished first and won A2RL 2024, with Constructor AI finishing second, 27.2 seconds behind. === Final race classification ===
Riffusion
Riffusion is a neural network, designed by Seth Forsgren and Hayk Martiros, that generates music using images of sound rather than audio. The resulting music has been described as "de otro mundo" (otherworldly), although unlikely to replace man-made music. The model was made available on December 15, 2022, with the code also freely available on GitHub. The first version of Riffusion was created as a fine-tuning of Stable Diffusion, an existing open-source model for generating images from text prompts, on spectrograms, resulting in a model which used text prompts to generate image files which could then be put through an inverse Fourier transform and converted into audio files. While these files were only several seconds long, the model could also use latent space between outputs to interpolate different files together (using the img2img capabilities of SD). It was one of many models derived from Stable Diffusion. In December 2022, Mubert similarly used Stable Diffusion to turn descriptive text into music loops. In January 2023, Google published a paper on their own text-to-music generator called MusicLM. Forsgren and Martiros formed a startup, also called Riffusion, and raised $4 million in venture capital funding in October 2023.
R.U.R.
R.U.R. is a 1920 science fiction play by the Czech writer Karel Čapek. "R.U.R." stands for Rossumovi Univerzální Roboti (Rossum's Universal Robots, a phrase that has been used as a subtitle in English versions). The play had its world premiere on 2 January 1921 in Hradec Králové. It introduced the word "robot" to the English language and to science fiction as a whole. R.U.R. became influential soon after its publication. By 1923, it had been translated into thirty languages. R.U.R. was successful in its time in Europe and North America. Čapek later took a different approach to the same theme in his 1936 novel War with the Newts, in which non-humans become a servant-class in human society. == Characters == Parentheses indicate names which vary according to translation. On the meaning of the names, see Ivan Klíma: Karel Čapek: Life and Work (2002). == Plot == === Synopsis === The play begins in a factory that makes artificial workers from synthetic organic matter. (As living creatures of artificial flesh and blood, that later terminology would call androids, the playwright's 'roboti' differ from later fictional and scientific concepts of inorganic constructs.) Robots may be mistaken for humans but have no original thoughts. Though most are content to work for humans, eventually a rebellion causes the extinction of the human race. === Prologue (Act I in the Selver translation) === Helena, the daughter of the president of a major industrial power, arrives at the island factory of Rossum's Universal Robots. Here, she meets Domin, the General Manager of R.U.R., who relates to her the history of the company. Rossum had come to the island in 1920 to study marine biology. In 1932, Rossum had invented a substance like organic matter, though with a different chemical composition. He argued with his nephew about their motivations for creating artificial life. While the elder wanted to create animals to prove or disprove the existence of God, his nephew only wanted to become rich. Young Rossum finally locked away his uncle in a lab to play with the monstrosities he had created and created thousands of robots. By the time the play takes place (circa the year 2000), robots are cheap and available all over the world. They have become essential for industry. After meeting the heads of R.U.R., Helena reveals that she is a representative of the League of Humanity, an organization that wishes to liberate the robots. The managers of the factory find this absurd. They see robots as appliances. Helena asks that the robots be paid, but according to R.U.R. management, the robots do not "like" anything. Eventually Helena is convinced that the League of Humanity is a waste of money, but still argues robots have a "soul". Later, Domin confesses that he loves Helena and forces her into an engagement. === Act I (Act II in Selver) === Ten years have passed. Helena and her nurse Nana discuss current events, the decline in human births in particular. Helena and Domin reminisce about the day they met and summarize the last ten years of world history, which has been shaped by the new worldwide robot-based economy. Helena meets Dr. Gall's new experiment, Radius. Dr. Gall describes his experimental robotess, also named Helena. Both are more advanced, fully-featured robots. In secret, Helena burns the formula required to create robots. The revolt of the robots reaches Rossum's island as the act ends. === Act II (Act III in Selver) === The characters sense that the very universality of the robots presents a danger. Echoing the story of the Tower of Babel, the characters discuss whether creating national robots who were unable to communicate beyond their languages would have been a good idea. As robot forces lay siege to the factory, Helena reveals she has burned the formula necessary to make new robots. The characters lament the end of humanity and defend their actions, despite the fact that their imminent deaths are a direct result of their choices. Busman is killed while attempting to negotiate a peace with the robots. The robots storm the factory and kill all the humans except for Alquist, the company's Clerk of the Works (Head of Construction). The robots spare him because they recognize that "He works with his hands like a robot. He builds houses. He can work." === Act III (Epilogue in Selver) === Years have passed. Alquist, who still lives, attempts to recreate the formula that Helena destroyed. He is a mechanical engineer, though, with insufficient knowledge of biochemistry, so he has made little progress. The robot government has searched for surviving humans to help Alquist and found none alive. Officials from the robot government beg him to complete the formula, even if it means he will have to kill and dissect other robots for it. Alquist yields. He will kill and dissect robots, thus completing the circle of violence begun in Act Two. Alquist is disgusted. Robot Primus and Helena develop human feelings and fall in love. Playing a hunch, Alquist threatens to dissect Primus and then Helena; each begs him to take him- or herself and spare the other. Alquist now realizes that Primus and Helena are the new Adam and Eve, and gives the charge of the world to them. == Čapek's conception of robots == The robots described in Čapek's play are not robots in the popularly understood sense of an automaton. They are not mechanical devices, but rather artificial biological organisms that may be mistaken for humans. A comic scene at the beginning of the play shows Helena arguing with her future husband, Harry Domin, because she cannot believe his secretary is a robotess: His robots resemble more modern conceptions of man-made life forms, such as the Replicants in Blade Runner, the "hosts" in the Westworld TV series and the humanoid Cylons in the re-imagined Battlestar Galactica, but in Čapek's time there was no conception of modern genetic engineering (DNA's role in heredity was not confirmed until 1952). There are descriptions of kneading-troughs for robot skin, great vats for liver and brains, and a factory for producing bones. Nerve fibers, arteries, and intestines are spun on factory bobbins, while the robots themselves are assembled like automobiles. Čapek's robots are living biological beings, but they are still assembled, as opposed to grown or born. One critic has described Čapek's robots as epitomizing "the traumatic transformation of modern society by the First World War and the Fordist assembly line". === Origin of the word robot === The play introduced the word robot, which displaced older words such as "automaton" or "android" in languages around the world. In an article in Lidové noviny, Karel Čapek named his brother Josef as the true inventor of the word. In Czech, robota means forced labour of the kind that serfs had to perform on their masters' lands and is derived from rab, meaning "slave". The name Rossum is an allusion to the Czech word rozum, meaning "reason", "wisdom", "intellect" or "common sense". It has been suggested that the allusion might be preserved by translating "Rossum" as "Reason" but only the Majer/Porter version translates the word as "Reason". == Production history and translations == The work was published in two differing versions in Prague by Aventinum, first in 1920, followed by a revised version in 1921. After being postponed, it premiered at the city's National Theatre on 25 January 1921, although an amateur group had by then already presented a production. By 1921, Paul Selver translated either the original 1920 edition of R.U.R. or a manuscript copy close to this version into English. He probably translated the play freelance, and sold it to St Martin's Theatre in London. Selver's translation was adapted for the British stage by Nigel Playfair in 1922, but it was not produced straight away. Later that year performance rights for the U.S. and Canada were sold to the New York Theatre Guild, perhaps during Lawrence Langner's visit to Britain. Playfair's version included several changes to Čapek's original play, such as renaming the acts (the prologue became act one, and the heavily abridged final act became the epilogue), omitting around sixty lines (including most of Alquist's final speech), adding several more lines, and removing the robot character Damon (giving his lines to Radius). The omission of some lines may have been censorship from the Lord Chamberlain's Office, or self-censorship in anticipation of this, while some other changes might have been made by Čapek himself if Selver was working from a manuscript copy. An edition of Playfair's adaptation was published by the Oxford University Press in 1923, and Selver went on to write a satiric novel One, Two, Three (1926) based on his experiences getting R.U.R. staged. The American première was produced by the Theatre Guild at the Garrick Theatre in New York City in October 1922, where it ran for 184 performances. In the first performance, Domin was portrayed by Basil Sydney,
Feng Office Community Edition
Feng Office Community Edition (formerly OpenGoo) is an open-source collaboration platform developed and supported by Feng Office and the OpenGoo community. It is a fully featured online office suite with a similar set of features as other online office suites, like Google Workspace, Microsoft 365, Zimbra, LibreOffice Online and Zoho Office Suite. The application can be downloaded and installed on a server. Feng Office could also be categorized as collaborative software and as personal information manager software. == Features == Feng Office Community Edition main features include project management, document management, contact management, e-mail and time management. Text documents and presentations can be created and edited online. Files can be uploaded, organized and shared, independent of file formats. Organization of the information in Feng Office Community Edition is done using workspaces and tags. The application presents the information stored using different interfaces such as lists, dashboards and calendar views. == Licensing == Feng Office Community Edition is distributed under the GNU Affero General Public License, version 3 only. == Technology used == Feng Office uses PHP, JavaScript, AJAX (ExtJS) and MySQL technology. Several open source projects served as a basis for development. ActiveCollab's last open sourced release was used as the initial code base. It includes CKEditor for online document editing. == System requirements == The server could run on any operating system. The system needs the following packages: Apache HTTP Server 2.0+ PHP 5.0+ MySQL 4.1+ (InnoDB support recommended) On the client side, the user is only required to use a modern Web browser. == History == OpenGoo started as a degree project at the faculty of Engineering of the University of the Republic, Uruguay. The project was presented and championed by Software Engineer Conrado Viña. Software Engineers Marcos Saiz and Ignacio de Soto developed the first prototype as their thesis. Professors Eduardo Fernández and Tomas Laurenzo served as tutors. Conrado, Ignacio and Marcos founded the OpenGoo community and remain active members and core developers. The thesis was approved with the highest score. In 2008, Viña joined the Uruguayan software development company Moove It. Currently there is a second project for OpenGoo at the same university being developed by students Fernando Rodríguez, Ignacio Vázquez and Juan Pedro del Campo. Their project aims to build an open source Web-based spreadsheet. In December 2009 the OpenGoo name was changed to Feng Office Community Edition.
ACM SIGEVO
The ACM SIGEVO is a Special Interest Group of the Association of Computing Machinery for members of that organization who are practitioners, academics, students or others with interests in evolutionary computation and related algorithms. == History == ACM SIGEVO was founded in 2005 when the International Society for Genetic and Evolutionary Computation (ISGEC) became an ACM Special Interest Group under its present title. The ISGEC had been formed in 1999 by the merger of the Genetic Programming conference organization with the International Conference on Genetic Algorithms (ICGA) leading to the first Genetic and Evolutionary Computation Conference (GECCO). == Membership == Members of this SIG pay a small fee in addition to the ACM membership fee. In return they have access to a quarterly online newsletter, but more importantly can obtain reduced registration rates at the two conferences organised by ACM SIGEVO: GECCO and the Foundations of Genetic Algorithms conference (FOGA). They can also access material on evolutionary computation and related topics in the ACM Digital Library. In addition they can subscribe to email mailing lists in order to keep informed about news over time. For students, ACM SIGEVO sponsors Travel Awards for attendance at the GECCO Conference and FOGA (the Foundations of Genetic Algorithms conference). ACM SIGEVO also sponsors a Graduate Student Workshop. ACM also sponsors Awards to be competed for by attendees at the conferences it organises. == Conferences == ACM SIGEVO organises two major conferences in the field of evolutionary computation. The Genetic and Evolutionary Conference (GECCO) is held annually, while the Foundations of Genetic Algorithms conference (FOGA) is held biennially. === GECCO === The first GECCO conference was held prior to the formation of ACM SIGEVO but since 2005 (see History above) it has been organised annually by ACM SIGEVO. The latest (2025) was held in Málaga, Spain. The next (2026) will be held in San José, Costa Rica. === FOGA === Foundations of Genetic Algorithms (FOGA) is a biennial peer-reviewed research conference focusing on the theoretical principles underlying genetic algorithms, other evolutionary algorithms and related heuristics. It is organized by ACM SIGEVO. Its relevance to the computer science research community has been reflected in an A-rating in the CORE computer science conference assessment system. The Foundations of Genetic Algorithms (FOGA) conference originated as a workshop in 1990 in order to create an opportunity for researchers on genetic algorithms and related areas of evolutionary computation to focus on the theoretical principles underlying their field. From the start its multi-day duration made it comparable to conferences in the field, and since 2015 its proceedings have used conference rather than workshop in their titles. In 2005 ACM SIGEVO the Association for Computing Machinery Special Interest Group on Genetic and Evolutionary Computation was formed and every FOGA conference since then has been supported by SIGEVO. The table below shows FOGA conferences by year, location, websites (where available) and publisher of proceedings. A citation follows the reference to the publisher giving the full details of each FOGA proceedings. Papers accepted at recent conferences have been presented as digital or print posters in poster sessions at the conference, before being published in written form in the conference proceedings. FOGA is comparable in its multi-day duration to other conferences on evolutionary computation such as CEC, GECCO and PPSN. The main difference is that FOGA focuses on the theoretical basis of evolutionary computation and related subjects. While the above conferences devote some time to theory they also cover a wide range of other topics including competitions and applications. This focus on theoretical computer science was reflected in the CORE computer science conference assessment exercise, where FOGA was given an A-ranking in the 2023 assessment. GECCO and PPSN also obtained A-rankings, but many other conferences in the field of evolutionary computation obtained lower rankings. This suggests that FOGA is a relevant conference in its field, comparable with others including the much larger CEC or GECCO. Keynote speakers at past conferences have been: == Awards == ACM SIGEVO sponsors a number of awards. === SIGEVO Outstanding Contribution Award === The SIGEVO Outstanding Contribution Award commenced in 2023, and these awards are designed to recognise distinctive contributions to the field of evolutionary computation when evaluated over a period of at least 15 years. As a result many recipients to date are notable academics or industrial practitioners, and include Anne Auger, Kalyanmoy Deb, Stephanie Forrest, Emma Hart and Hans-Paul Schwefel. === SIGEVO Dissertation Award === The SIGEVO Dissertation Award recognises thesis research in the field of evolutionary computation completed at least by the year prior to a GECCO conference. Theses are submitted and reviewed by a panel that selects one winner and a maximum of two honourable mentions. Awards will be made to the winner and any others at the next GECCO conference. === SIGEVO Chair Award === The SIGEVO Chair Award, established in 2016 is a lecture sponsored by ACM SIGEVO, to take place on the last day of the GECCO conference. It recognizes through the lectures that the lecturers are influential researchers in the field of evolutionary computation. The more recent lectures are available online. The 2024 Award winner was Una-May O'Reilly. === SIGEVO Impact Award === The SIGEVO Impact Award looks back to the GECCO conference ten years earlier and recognizes up to three papers a year which are considered by the current ACM SIGEVO Executive Committee to have had significant impact over the period since their first publication at the GECCO conference. An example (originally published in GECCO 2010) received this award in 2020. === GECCO Best Paper Award === The ACM SIGEVO sponsors awards for the best papers presented at the GECCO conference. Because GECCO conferences have very many parallel tracks there are multiple awards recognising presentations in the different tracks. At GECCO 2025 Best Paper Awards were presented across 12 tracks. === FOGA Best Paper Award === The ACM SIGEVO sponsors awards for the best papers presented at the FOGA conference. Because FOGA operates on a single track, it is easier to compare papers. Since 2019 this Award has been made (suggesting only four awards up to the latest conference in 2025). ACM SIGEVO records the 2019 award. === Humie Award === The Humies Awards are rewards for the best form of human-competitive results using evolutionary computation or related algorithms and published in the wider literature (they do not need to be published at a conference or in a journal sponsored by ACM SIGEVO or even the ACM.) They were established through a gift from John Koza and have been in operation from 2004 to the present. The link with ACM SIGEVO is that the winners of the competition (submissions are evaluated in advance) are presented with Humie Awards at GECCO conferences. The Humie Awards website provides full details for the rules and how to submit entries to the competition. == Journals == ACM SIGEVO sponsors the main journal covering evolutionary computation published by the ACM: ACM Transactions on Evolutionary Learning and Optimization. ACM SIGEVO refers to the preceding ISGEC organisation (see History above) as sponsoring two other important journals in the field: The Evolutionary Computation journal. Genetic Programming and Evolvable Machines. While these journals continue to be important in the field, the wording on the website of ACM SIGEVO suggests that ACM SIGEVO is not involved in their publication. == References and notes ==