source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Visual%20FoxPro | Visual FoxPro is a Microsoft data-centric procedural programming language with object-oriented programming (OOP) features.
It was derived from FoxPro (originally known as FoxBASE) which was developed by Fox Software beginning in 1984. Fox Technologies merged with Microsoft in 1992, after which the software acquired further features and the prefix "Visual". FoxPro 2.6 worked on Mac OS, DOS, Windows, and Unix.
Visual FoxPro 3.0, the first "Visual" version, reduced platform support to only Mac and Windows, and later versions 5, 6, 7, 8 and 9 were Windows-only. The current version of Visual FoxPro is COM-based and Microsoft has stated that they do not intend to create a Microsoft .NET version.
Version 9.0, released in December 2004 and updated in October 2007 with the SP2 patch, was the final version of the product. Support ended in January 2010 and extended support in January 2015.
History
Visual FoxPro originated as a member of the class of languages commonly referred to as "xBase" languages, which have syntax based on the dBase programming language. Other members of the xBase language family include Clipper and Recital (database).
Visual FoxPro, commonly abbreviated as VFP, is tightly integrated with its own relational database engine, which extends FoxPro's xBase capabilities to support SQL query and data manipulation. Unlike most database management systems, Visual FoxPro is a full-featured, dynamic programming language that does not require the use of an additional general-purpose programming environment. It can be used to write not just traditional "fat client" applications, but also middleware and web applications.
In late 2002, it was demonstrated that Visual FoxPro can run on Linux under the Wine Windows compatibility suite. In 2003, this led to complaints by Microsoft: it was claimed that the deployment of runtime FoxPro code on non-Windows machines violates the End User License Agreement.
Visual FoxPro had a rapid rise and fall in popularity as measured by the TIOBE Programming Community Index. In December 2005, VFP broke into the top 20 for the first time. In June 2006 it peaked at position 12, making it (at the time) a "B" language. As of January 2023, Visual FoxPro holds position 21 on the TIOBE index.
In March 2007, Microsoft announced that there would be no VFP 10, thus making VFP9 (released to manufacturing on December 17, 2004) the last commercial VFP release from Microsoft. Service Pack 2 for Microsoft Visual FoxPro 9.0 was released on October 16, 2007. The support of Version 9 ended on January 13, 2015.
At the time of the end of life announcement, work on the next release codenamed Sedna (named after a recently discovered dwarf planet) which was built on top of the VFP9 codebase had already begun. "Sedna" is a set of add-ons to VFP 9.0 of xBase components to support a number of interoperability scenarios with various Microsoft technologies including SQL Server 2005, .NET Framework, Windows Vista, Office 2007, Windows S |
https://en.wikipedia.org/wiki/Timsort | Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It was implemented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsequences of the data that are already ordered (runs) and uses them to sort the remainder more efficiently. This is done by merging runs until certain criteria are fulfilled. Timsort has been Python's standard sorting algorithm since version 2.3. It is also used to sort arrays of non-primitive type in Java SE 7, on the Android platform, in GNU Octave, on V8, Swift, and Rust.
It uses techniques from Peter McIlroy's 1993 paper "Optimistic Sorting and Information Theoretic Complexity".
Operation
Timsort was designed to take advantage of runs of consecutive ordered elements that already exist in most real-world data, natural runs. It iterates over the data collecting elements into runs and simultaneously putting those runs in a stack. Whenever the runs on the top of the stack match a merge criterion, they are merged. This goes on until all data is traversed; then, all runs are merged two at a time and only one sorted run remains. The advantage of merging ordered runs instead of merging fixed size sub-lists (as done by traditional mergesort) is that it decreases the total number of comparisons needed to sort the entire list.
Each run has a minimum size, which is based on the size of the input and is defined at the start of the algorithm. If a run is smaller than this minimum run size, insertion sort is used to add more elements to the run until the minimum run size is reached.
Merge criteria
Timsort is a stable sorting algorithm (order of elements with same key is kept) and strives to perform balanced merges (a merge thus merges runs of similar sizes).
In order to achieve sorting stability, only consecutive runs are merged. Between two non-consecutive runs, there can be an element with the same key inside the runs. Merging those two runs would change the order of equal keys. Example of this situation ([] are ordered runs): [1 2 2] 1 4 2 [0 1 2]
In pursuit of balanced merges, Timsort considers three runs on the top of the stack, X, Y, Z, and maintains the invariants:
If any of these invariants is violated, Y is merged with the smaller of X or Z and the invariants are checked again. Once the invariants hold, the search for a new run in the data can start. These invariants maintain merges as being approximately balanced while maintaining a compromise between delaying merging for balance, exploiting fresh occurrence of runs in cache memory and making merge decisions relatively simple.
Merge space overhead
The original merge sort implementation is not in-place and it has a space overhead of N (data size). In-place merge sort implementations exist, but have a high time overhead. In order to achieve a middle term, Timsort performs a merge sort with a small time overhead and smaller space ov |
https://en.wikipedia.org/wiki/TEG | TEG may refer to:
Triethylene glycol
Thromboelastography
TEG (board game), an Argentine Risk-based board game
Tenés Empanadas Graciela, a computer game inspired by the above board game
TEG Federal Credit Union, a New York bank
Thermoelectric generator, a device that can convert heat into electricity
The Edrington Group, A Scotch Whisky and spirits manufacturer based in Scotland
Teg, Umeå, a section of the city of Umeå, in Sweden
The Teg, a small stream in Berkshire, England |
https://en.wikipedia.org/wiki/Millionaire%20Hot%20Seat | Millionaire Hot Seat, also known as Hot Seat, is an Australian television quiz show. The show is a spin-off of Who Wants to Be a Millionaire? and began airing on the Nine Network on 20 April 2009. As with the original Australian version of the show it is hosted by Eddie McGuire, and follows a similar format.
History
Rumours about a new shortened version of Millionaire first began circulating in February 2009 and were confirmed when the Nine Network produced a pilot version of the format titled Millionaire: Russian Roulette in March 2009. The official title was announced as Millionaire Hot Seat, but this was later shortened to simply Hot Seat. The new format was originally promoted as a short-run series, with advertisements featuring McGuire exclaiming "20 nights! 20 million dollars!" It was announced on 7 April 2009 that Hot Seat would begin airing on 20 April 2009 in the – weeknight timeslot and would compete against the high-rating game show, Deal or No Deal, on the Seven Network. As expected, the show's format was shortened to 30 minutes and given an overhaul of the rules and gameplay, in a system based on the Italian version of the show.
Previously, a half-hour edition of the original version aired for a two-week period in June 2004, aimed at attempting to arrest declining ratings leading into its most-watched news service.
The Nine Network commissioned a second series of the show, to begin airing the week after the original 20-episode order had finished airing on 15 May 2009. The second series began airing on 18 May 2009.
A special prime time edition of Hot Seat aired at on Monday, 8 June 2009, featuring a contestant, Barry Soraghan, playing for the format's first million-dollar question. Ultimately, Soraghan answered the question incorrectly, and won only $1,000. At the completion of the taped episode, Soraghan was visited live on air at his Blackburn home by McGuire, who then awarded him a two-week holiday for him and his family, as well as $5,000 in spending money. The episode achieved a ratings figure of 1,224,000 viewers nationally, and was the eleventh-highest rating program for the night, which was a vast improvement from the 812,000 viewers that Hot Seat managed in its regular timeslot on the same night.
Hot Seat was originally filmed in the iconic Studio 9 at the GTV9 Richmond premises; however, as of February 2011, it has been filmed at GTV9's new home at Docklands Studios Melbourne. The show's 500th episode went to air on 3 August 2011; that day's contestant winning $100,000.
On 15 August 2011 the four remaining couples from the 2011 season of The Block appeared on the show, attempting to win $1,000,000 for charity. But the final couple in the hot seat faltered on the seventh question. The last couple won only $1,000 for their charity.
On 3 October 2011, a The Farmer Wants a Wife special went to air, ahead of the final that was to air later that night. Farmer Frank, the last contestant in the Hot Seat, had a chance to win |
https://en.wikipedia.org/wiki/Myolepta | Myolepta is a cosmopolitan genus of hoverflies most closely related to the genus Lepidomyia
Species
Subgenus: Myolepta
Myolepta auricaudata (Williston, 1891)
Myolepta aurinota (Hine, 1903)
Myolepta camillae Weems, 1956
Myolepta difformis (Strobl, 1909)
Myolepta dolorosa (Hull, 1941)
Myolepta dubia (Fabricius, 1805)
Myolepta greeni Hull, 1941i
Myolepta haemorrhoidalis (Philippi, 1865)
Myolepta luctuosa (Bigot, 1857a)
Myolepta lunulata Bigot, 1884
Myolepta luteola (Gmelin, 1790)
Myolepta nausicaa (Hull, 1937a)
Myolepta nigra (Loew, 1972)
Myolepta nigritarsis Coe, 1957
Myolepta obscura (Becher, 1882)
Myolepta potens (Harris, 1776)
Myolepta strigilata (Loew, 1872)
Myolepta vara (Panzer, 1798)
Myolepta varipes (Loew, 1869)
Subgenus: Protolepidostola
Myolepta braziliana (Shannon, 1927a)
Myolepta evansi Thompson, 1968
Myolepta marinonii (Marinoni, 2004)
Myolepta minuta Fluke, 1956
Myolepta problematica Thompson, 1968
Myolepta scintillans (Hull, 1946b)
References
Hoverfly genera
Muscomorph flies of Europe
Diptera of North America
Brachyopini
Taxa named by Edward Newman |
https://en.wikipedia.org/wiki/Copy%20number%20analysis | Copy number analysis is the process of analyzing data produced by a test for DNA copy number variation in an organism's sample. One application of such analysis is the detection of chromosomal copy number variation that may cause or may increase risks of various critical disorders. Copy number variation can be detected with various types of tests such as fluorescent in situ hybridization, comparative genomic hybridization and with high-resolution array-based tests based on array comparative genomic hybridization (or aCGH), SNP array technologies and high resolution microarrays that include copy number probes as well an SNPs. Array-based methods have been accepted as the most efficient in terms of their resolution and high-throughput nature and the highest coverage (choose an array with over 2 million probes) and they are also referred to as virtual karyotype. Data analysis for an array-based DNA copy number test can be very challenging though due to very high volume of data that come out of an array platform.
BAC (Bacterial Artificial Chromosome) arrays were historically the first microarray platform to be used for DNA copy number analysis. This platform is used to identify gross deletions or amplifications in DNA. Such anomalies for example are common in cancer and can be used for diagnosis of many developmental disorders. Data produced by such platforms are usually low to medium resolution in terms of genome coverage. Usually, log-ratio measurements are produced by this technology to represent deviation of patient's copy number state from normal. Such measurements then are studied and those that significantly differ from zero value are announced to represent a part of a chromosome with an anomaly (an abnormal copy number state). Positive log-ratios indicate a region of DNA copy number gain and negative log-ratio values mark a region of DNA copy number loss. Even a single data point can be declared an indication of a copy number gain or a copy number loss in BAC arrays.
See also
Bioinformatics
DNA microarray
References
Genetics
Molecular biology |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20before%201930 | List of films produced in the Cinema of Poland before 1930.
External links
Polish film at the Internet Movie Database
1929 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201930s | List of films produced in the Cinema of Poland in the 1930s.
External links
Polish film at the Internet Movie Database
1930 |
https://en.wikipedia.org/wiki/Return-oriented%20programming | Return-oriented programming (ROP) is a computer security exploit technique that allows an attacker to execute code in the presence of security defenses such as executable space protection and code signing.
In this technique, an attacker gains control of the call stack to hijack program control flow and then executes carefully chosen machine instruction sequences that are already present in the machine's memory, called "gadgets". Each gadget typically ends in a return instruction and is located in a subroutine within the existing program and/or shared library code. Chained together, these gadgets allow an attacker to perform arbitrary operations on a machine employing defenses that thwart simpler attacks.
Background
Return-oriented programming is an advanced version of a stack smashing attack. Generally, these types of attacks arise when an adversary manipulates the call stack by taking advantage of a bug in the program, often a buffer overrun. In a buffer overrun, a function that does not perform proper bounds checking before storing user-provided data into memory will accept more input data than it can store properly. If the data is being written onto the stack, the excess data may overflow the space allocated to the function's variables (e.g., "locals" in the stack diagram to the right) and overwrite the return address. This address will later be used by the function to redirect control flow back to the caller. If it has been overwritten, control flow will be diverted to the location specified by the new return address.
In a standard buffer overrun attack, the attacker would simply write attack code (the "payload") onto the stack and then overwrite the return address with the location of these newly written instructions. Until the late 1990s, major operating systems did not offer any protection against these attacks; Microsoft Windows provided no buffer-overrun protections until 2004. Eventually, operating systems began to combat the exploitation of buffer overflow bugs by marking the memory where data is written as non-executable, a technique known as executable space protection. With this enabled, the machine would refuse to execute any code located in user-writable areas of memory, preventing the attacker from placing payload on the stack and jumping to it via a return address overwrite. Hardware support later became available to strengthen this protection.
With data execution prevention, an adversary cannot directly execute instructions written to a buffer because the buffer's memory section is marked as non-executable. To defeat this protection, a return-oriented programming attack does not inject malicious instructions, but rather uses instruction sequences already present in executable memory, called "gadgets", by manipulating return addresses. A typical data execution prevention implementation cannot defend against this attack because the adversary did not directly execute the malicious code, but rather combined sequences of "go |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201940s | List of films produced in the Cinema of Poland in the 1940s.
External links
Polish film at the Internet Movie Database
1940 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201950s | List of films produced in the Cinema of Poland in the 1950s.
External links
Polish film at the Internet Movie Database
1950 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201960s | List of films produced in the Cinema of Poland in the 1960s.
External links
Polish film at the Internet Movie Database
1960 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201970s | List of films produced in the Cinema of Poland in the 1970s.
External links
Polish film at the Internet Movie Database
1970 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201980s | List of films produced in the Cinema of Poland in the 1980s.
External links
Polish film at the Internet Movie Database
1980 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%201990s | List of films produced in the Cinema of Poland in the 1990s.
External links
Polish film at the Internet Movie Database
1990 |
https://en.wikipedia.org/wiki/List%20of%20Polish%20films%20of%20the%202000s | A list of films produced in Poland in the 2000s.
External links
Polish film at the Internet Movie Database
2000 |
https://en.wikipedia.org/wiki/Manchester%20Mark%201 | The Manchester Mark 1 was one of the earliest stored-program computers, developed at the Victoria University of Manchester, England from the Manchester Baby (operational in June 1948). Work began in August 1948, and the first version was operational by April 1949; a program written to search for Mersenne primes ran error-free for nine hours on the night of 16/17 June 1949.
The machine's successful operation was widely reported in the British press, which used the phrase "electronic brain" in describing it to their readers. That description provoked a reaction from the head of the University of Manchester's Department of Neurosurgery, the start of a long-running debate as to whether an electronic computer could ever be truly creative.
The Mark 1 was to provide a computing resource within the university, to allow researchers to gain experience in the practical use of computers, but it very quickly also became a prototype on which the design of Ferranti's commercial version could be based. Development ceased at the end of 1949, and the machine was scrapped towards the end of 1950, replaced in February 1951 by a Ferranti Mark 1, the world's first commercially available general-purpose electronic computer.
The computer is especially historically significant because of its pioneering inclusion of index registers, an innovation which made it easier for a program to read sequentially through an array of words in memory. Thirty-four patents resulted from the machine's development, and many of the ideas behind its design were incorporated in subsequent commercial products such as the and 702 as well as the Ferranti Mark 1. The chief designers, Frederic C. Williams and Tom Kilburn, concluded from their experiences with the Mark 1 that computers would be used more in scientific roles than in pure mathematics. In 1951, they started development work on Meg, the Mark 1's successor, which would include a floating point unit.
It was also called the Manchester Automatic Digital Machine, or MADM.
Background
In 1936, mathematician Alan Turing published a definition of a theoretical "universal computing machine", a computer which held its program on tape, along with the data being worked on. Turing proved that such a machine was capable of solving any conceivable mathematical problem for which an algorithm could be written. During the 1940s, Turing and others such as Konrad Zuse developed the idea of using the computer's own memory to hold both the program and data, instead of tape, but it was mathematician John von Neumann who became widely credited with defining that stored-program computer architecture, on which the Manchester Mark 1 was based.
The practical construction of a von Neumann computer depended on the availability of a suitable memory device. The University of Manchester's Baby, the world's first electronic stored-program computer, had successfully demonstrated the practicality of the stored-program approach and of the Williams tube, an early fo |
https://en.wikipedia.org/wiki/Tryton | Tryton is a three-tier high-level general purpose computer application platform on top of which is built an enterprise resource planning (ERP) business solution through a set of Tryton modules.
The three-tier architecture consists of the Tryton client, the Tryton server and the database management system (mainly PostgreSQL).
License
The platform, along with the official modules, are free software, licensed under the GPL-3.0-or-later license.
Modules and functional coverage
The official modules provide a coverage of the following functional fields :
Financial accounting
Sales
Inventory & Stock
Analytic accounting
CRM
Purchasing
Supply chain
Manufacturing Resource Planning
Shipping
Project management
Subscription management
Third party integration
Full documentation of the modules and functionalities is available at the official documentation site.
Technical features
The client and the server applications are written in Python, the client uses GTK+ as graphical toolkit. Both are available on Linux, OS X, and Windows. A web client also exists written in JavaScript using jQuery and Bootstrap and is named sao.
The kernel provides the technical foundations needed by most business applications. However it is not linked to any particular functional field hence constituting a general purpose framework:
Data persistence: ensured by accessor objects called Models, they allow easy creation, migration and access to records.
User Management: the kernel comes with the base features of user management: user groups, access rules by models and records, etc.
Workflow Engine: allows users to activate a workflow on any business model.
Report Engine: the report engine is based on relatorio that uses ODT files as templates and generate ODT or PDF reports.
Internationalisation: Tryton is available in English, French, German, Spanish, Catalan, and Italian. New translations can be added directly from the client interface.
Historical data: data historization may be enabled on any business model allowing for example to get the list of all the past value of the cost price of any product. It also allows users to dynamically access historized record at any time in the past: for instance the customer information on each open invoice will be the ones of the day the invoice was opened.
Support for XML-RPC and JSON-RPC protocols.
Database independence is allowed thanks to the python-sql library and is used for testing with the SQLite backend.
Built-in automatic migration mechanism: it allows updating the underlying database scheme without any human manipulation. Migration is ensured from series to series (releases inside the same series do not require migration). This automation is possible because the migration process is taken into account and tested continually within the development.
Advanced modularity: the modularity allows a layered approach of the business concepts along with flexibility, which speeds up custom developments.
Being a framework, |
https://en.wikipedia.org/wiki/Soterml | SoTerML (Soil and Terrain Markup Language) is a XML-based markup language for storing and exchanging soil and terrain related data. SoTerML development is being done within The e-SoTer Platform. GEOSS plans a global Earth Observation System and, within this framework, the e-SOTER project addresses the felt need for a global soil and terrain database.
The Centre for Geospatial Science (Currently Nottingham Geospatial Institute) at the University of Nottingham has initiated the development since January 2009. Further development and maintenance is currently handled in National Soil Resources Institute (NSRI) at Cranfield University, UK. The role of CGS is within the development of the e-SOTER dissemination platform, which is based on INSPIRE principles. The SoTerML development included:
1. Development of a data dictionary for nomenclatures and various data sources (data and metadata).
2. Development of an exchange format/procedures from the World Reference Base 2006.
External links
e-SOTER project website
ISRIC website
e-SOTER page at Nottingham Geospatial Institute, the Universìty of Nottingham
NSRI at Cranfield University
Soil
Databases |
https://en.wikipedia.org/wiki/Prior%20Smith | Prior Smith (born 1944) is a Canadian broadcaster who owns and operates the network radio program Canada Calling and, for 35 years, produced the Canadian syndicated radio show "Grapeline".
Broadcasting career
Born in Toronto, Ontario, Smith began his career in radio broadcasting with brief stints as a news reporter/announcer at CKLY-Lindsay, Ontario, (1966) CHYR Leamington/Windsor, Ontario (1967) and CJSS Cornwall, Ontario (1968) before moving to CJAD Montreal, Quebec in 1968. After one year at CJAD he moved to the legendary CFRB in Toronto in 1969. He worked as a general assignment news reporter/newscaster for the next 18 years.
While working in news at CFRB, Smith branched into radio network syndication creating and distributing a number of national radio programs, the most prominent of which was Grapeline featuring hockey commentator Don Cherry and sports broadcaster Brian Williams. The program, the longest running nationally syndicated radio show in Canadian history, started in the fall of 1984 and concluded in the spring of 2019.
Also during his time at CFRB, Smith created a syndicated radio news program to serve traveling and vacationing Canadians across the southern United States.
Canada Calling
Canada Calling is a daily radio newscast prepared in southern Ontario throughout the winter months. It is available on demand online at http://www.canadacalling.com and syndicated to a network of radio stations across the U.S. Sunbelt and the Bahamas, serving the more than three million Canadian vacationers who travel south each winter.
The original program was created by CBC sports and news announcer Dave Price. It was launched January 2, 1954 on stations in Miami Beach and Tampa.
Price would retire in the mid-1970s, selling the operations to Canadian broadcast executive Finlay MacDonald.
In 1977 Smith formed his own network and his coverage of the market quickly expanded to include all of Florida, The Bahamas, Arizona, southern California and south Texas. For a brief period the two networks competed for audience before Price's original service ceased operations. Smith has carried on the Canada Calling tradition as on air host each winter season for the past 46 years during which time he has never missed a day. Canada Calling concluded its 69th season on radio and streaming live Friday, March 31st, 2023. The 70th Anniversary season will begin January 2nd, 2024.
Canada Calling's six decades on air throughout Florida was honored by the Florida Association of Broadcasters at its annual convention in Miami Beach June 26, 2013 with Prior Smith in attendance representing the longest running radio show in Florida history.
References
WWBF
WSRQ-FM
https://web.archive.org/web/20090207011901/http://www.broadcastdialogue.com/article_view.asp?action=view&idnumber=407
http://www.heraldtribune.com/article/20051212/COLUMNIST50/512120580?Title=-Canada-Calling-Prior-Smith-weighs-in-on-the-time-changes
http://pcbpress.ypbr.com/news/01-27-2009
htt |
https://en.wikipedia.org/wiki/Talkmobile | Talkmobile is a mobile virtual network operator (MVNO) operating in the United Kingdom on the Vodafone network. As a brand of Vodafone, the business is based in Newbury, Berkshire.
Launched as a postpaid MVNO by Carphone Warehouse in October 2007 using the Vodafone network, Talkmobile was one of two run by Carphone Warehouse. The other was Fresh Mobile, a prepaid MVNO using the T-Mobile network. Fresh Mobile was discontinued on 19 March 2010 in favour of Talkmobile.
In November 2011, Carphone Warehouse sold Talkmobile to Vodafone in a deal worth £20 million.
In July 2017, Talkmobile began rolling out 4G to its customers.
The Talkmobile pay-as-you-go (PAYG) product was withdrawn on 31 August 2017.
Talkmobile currently sell 30-day and 12-month SIM-only plans, which all have unlimited UK calls and texts.
References
External links
Mobile virtual network operators
Mobile phone companies of the United Kingdom |
https://en.wikipedia.org/wiki/Lycamobile | Lycamobile is a British mobile virtual network operator (MVNO) operating in 60 countries. The brand is active in Australia, Austria, Belgium, Denmark, France, Germany, Ireland, Italy, the Netherlands, North Macedonia, Norway, Poland, Portugal, Romania, Russia, South Africa, Spain, Sweden, Switzerland, Tunisia, Uganda, Ukraine, the United Kingdom and the United States. The bulk of Lycamobile revenue is claimed to be generated from its SIM products. Lycatel, also a part of Lyca Group, targets customers within expatriate and ethnic markets that want to make international calls.
Lycamobile sells international pay-as-you-go SIM. Being an MVNO, Lycamobile leases radio frequencies from mobile phone network operators and forms partnerships with the operators in each country it serves. Lycamobile has also developed distinct business structures such as MVNA aggregator arrangements in different countries.In 2015, Lycamobile renewed a multi-year MVNO deal with O2.
The Lycamobile brand concept was launched in 2005 with the first trading using the brand taking place in 2006. Its business structure is arranged to have local national private companies branded under licence as "Lycamobile" and operating exclusively in the particular country as either a MVNO provider or as the principal wholesaler of Lycamobile-branded products.
Since its launch in the Netherlands in 2006, Lycamobile has reached more than 15 million pay-as-you-go customers worldwide.
In 2016, nearly twenty Lycamobile employees were arrested in France, with about half of them charged with money laundering. As of 2020, Lycamobile is involved in three major tax disputes with HM Revenue and Customs.
Operations
The company currently operates in 23 countries around the world. Lycamobile has previously offered services in Hong Kong since April 2015, but its services were suspended from 6 April 2018.
Reception
In 2015, PC Magazines mobile analyst advised US customers to "take a look at some of the smaller virtual carriers which may offer better customer service or more customized plans" such as Lycamobile.
Ratings and reviews
In the United States, the Better Business Bureau stated in July 2015 that due to Lycamobile's failure to respond to 28 of 47 complaints, Lycamobile's rating with the BBB is an F (on a scale of A+ to F).
Other Lyca telecommunications businesses
While Lycamobile represents the core business of Lyca, namely the offering of a MVNO telecommunications services, Lyca has other telecommunication services provided to consumers:
GT Mobile
GT Mobile (also known as "Gnanam Telecom") is a MNVO sub-brand of Lycamobile that operates in Denmark, Germany, The Netherlands, Sweden, Australia, Spain, Italy, France, Belgium and Switzerland (the United Kingdom arm has been merged in Lycamobile). The brand, like its parent, is aimed at those who wish to make national and international phone calls on a pay-as-you-go basis. The GT Mobile brand offers alternative pricing structures and packages focu |
https://en.wikipedia.org/wiki/War%20Wolves | War Wolves is a 2009 television film that originally aired on the Syfy network on March 8, 2009. The film stars John Saxon and Michael Worth, who also serves as the film's director. This film is now available to stream on the streaming service Prime Video.
Plot
War Wolves depicts the lives of several Army soldiers who are ambushed in a small town in the Middle East. They return home and to their normal lives, however, they find that they had changed considerably. Growing fangs at will and slowly going through a mysterious and painful change, they part ways when they realize their own taste for blood. Refusing to give in one finds a life away from it all, going under the name of Lawrence Talbot. But escaping his life he finds is impossible as the members of his "pack" attempt to hunt him down and convert him to the more thrilling life their changes are introducing them to.
Cast
Michael Worth as Jake Gabriel, who had left his former comrades behind and uses alcohol and drugs to suppress the urges and changes his body is undergoing. He coins the alias Lawrence Talbot, the name of the original Wolfman.
Natasha Alam as Erika Moore, Jake's love interest and the leader of the wolves in Jake's absence, she attempts to convert the reluctant Jake into embracing his wolf side and turning against the humans.
John Saxon as Tony Ford, an aging military General in hunt of the wolves. Detached from his family due to his lengthy, seemingly endless work.
Tim Thomerson as Frank Bergman, Ford's assistant, a rambunctious old man who seems to make light of about any situation. He is Tony's opposite and best friend.
Adrienne Barbeau as Gail, a woman who has taken Jake in, she attends an AA group at the local church which Jake attends as well. She is a very insightful woman who regales stories of "her" Kenny and provides profound insight, mixed with a little belief in Men in Black, Sasquatch, Aliens etc.
Kristi Clainos as Justine
Siri Baruc as Casey
Daniel Southworth as Clay
Art LaFleur as Leo
Zosia Mamet as Rudy
Alex Ballar as Andrew Jensen
Martin Kove as Malick
Lois Stewart as Donna
Margot Farley as Christine
John Edward Lee as Tommy
External links
2009 television films
Syfy original films
Films shot in California
American werewolf films
2009 horror films
2009 films
American horror television films
2000s English-language films
2000s American films |
https://en.wikipedia.org/wiki/UML%20state%20machine | UML state machine, also known as UML statechart, is an extension of the mathematical concept of a finite automaton in computer science applications as expressed in the Unified Modeling Language (UML) notation.
The concepts behind it are about organizing the way a device, computer program, or other (often technical) process works such that an entity or each of its sub-entities is always in exactly one of a number of possible states and where there are well-defined conditional transitions between these states.
UML state machine is an object-based variant of Harel statechart, adapted and extended by UML. The goal of UML state machines is to overcome the main limitations of traditional finite-state machines while retaining their main benefits. UML statecharts introduce the new concepts of hierarchically nested states and orthogonal regions, while extending the notion of actions. UML state machines have the characteristics of both Mealy machines and Moore machines. They support actions that depend on both the state of the system and the triggering event, as in Mealy machines, as well as entry and exit actions, which are associated with states rather than transitions, as in Moore machines.
The term "UML state machine" can refer to two kinds of state machines: behavioral state machines and protocol state machines. Behavioral state machines can be used to model the behavior of individual entities (e.g., class instances), a subsystem, a package, or even an entire system. Protocol state machines are used to express usage protocols and can be used to specify the legal usage scenarios of classifiers, interfaces, and ports.
Basic state machine concepts
Many software systems are event-driven, which means that they continuously wait for the occurrence of some external or internal event such as a mouse click, a button press, a time tick, or an arrival of a data packet. After recognizing the event, such systems react by performing the appropriate computation that may include manipulating the hardware or generating “soft” events that trigger other internal software components. (That's why event-driven systems are alternatively called reactive systems.) Once the event handling is complete, the system goes back to waiting for the next event.
The response to an event generally depends on both the type of the event and on the internal state of the system and can include a change of state leading to a state transition. The pattern of events, states, and state transitions among those states can be abstracted and represented as a finite-state machine (FSM).
The concept of a FSM is important in event-driven programming because it makes the event handling explicitly dependent on both the event-type and on the state of the system. When used correctly, a state machine can drastically cut down the number of execution paths through the code, simplify the conditions tested at each branching point, and simplify the switching between different modes of execution. Converse |
https://en.wikipedia.org/wiki/ACM%20Transactions%20on%20Database%20Systems | The ACM Transactions on Database Systems (ACM TODS) is one of the journals produced by the Association for Computing Machinery. TODS publishes one volume yearly. Each volume has four issues, which appear in March, June, September and December. The editor-in-chief is Christopher Jermaine (Rice University).
Abstracting and indexing
According to the Journal Citation Reports, the journal had a 2020 impact factor of 1.086.
It is indexed in the following bibliographic databases:
Ei Compendex
SCImago
Scopus
ProQuest SciTech Premium Collection
Web of Science
References
External links
Journal homepage.
Computer science journals
Transactions on Database Systems
Hybrid open access journals |
https://en.wikipedia.org/wiki/Network-neutral%20data%20center | A network-neutral data center (or carrier-neutral data center) is a data center (or carrier hotel) which allows interconnection between multiple telecommunication carriers and/or colocation providers. Network-neutral data centers exist all over the world and vary in size and power.
While some data centers are owned and operated by a telecommunications or Internet service provider, the majority of network-neutral data centers are operated by a third party who has little or no part in providing Internet service to the end-user. This encourages competition and diversity as a server in a colocation centre can have one provider, multiple providers or only connect back to the headquarters of the company who owns the server. It has become increasingly more common for telecommunication operators to provide network neutral data centers.
One benefit of hosting in a network-neutral data center is the ability to switch providers without physically moving the server to another location.
References
Data centers
Computer networking |
https://en.wikipedia.org/wiki/Joseph%20Kosinski | Joseph Kosinski (born May 3, 1974) is an American film director best known for his computer graphics and computer-generated imagery (CGI) work, and for his work in action films. He made his big-screen directorial debut with the 2010 science fiction film Tron: Legacy, the sequel to the 1982 film Tron. He also directed the 2013 science fiction film Oblivion, the 2017 biographical drama film Only the Brave, and the 2022 action drama film Top Gun: Maverick, the sequel to the 1986 film Top Gun. His previous work has primarily been with CGI-related television commercials including the "Starry Night" commercial for Halo 3 and the award-winning "Mad World" commercial for Gears of War.
Life and career
Kosinski grew up in Marshalltown, Iowa, the son of Patricia (née Provost) of French-Canadian descent, and Joel Kosinski, a doctor of Polish descent.
His first major film was the special effects-heavy Tron: Legacy. The film was in Disney Digital 3-D and IMAX 3D, with a release of December 2010 and grossed $400 million worldwide.
After moving to Los Angeles in 2005, he began writing a film treatment which would eventually develop into an unpublished graphic novel by the title Oblivion for Radical Comics. In August 2010, Walt Disney Pictures acquired the rights to the work. William Monahan worked on the screenplay for a film adaptation. In March 2011, it was reported that Karl Gajdusek would rewrite the screenplay. Attempts to keep the film with a PG rating were unsuccessful, leading to Disney giving up the rights which were acquired by Universal Pictures, and agreed to a PG-13 rating. The $120-million-budgeted Oblivion began filming in March 2012, with Tom Cruise in the lead role, and was released in April 2013 to mixed reviews and grossed $286 million worldwide.
In 2017, he directed Only the Brave, originally titled Granite Mountain, based on the true story of the Granite Mountain Hotshots (wildland firefighters). In June 2017 it was announced he was set to direct the sequel to Top Gun, titled Top Gun: Maverick, reuniting with Oblivion star Tom Cruise. The film was released in theatres on May 27, 2022 by Paramount Pictures and grossed $1.496 billion worldwide, becoming Cruise's highest-grossing film at the box office.
Kosinski is also set to direct a Formula One racing film named Apex, reteaming with Top Gun: Maverick producer Jerry Bruckheimer and screenwriter Ehren Kruger, with racing driver Lewis Hamilton also serving as producer. The project, acquired by Apple Studios in June 2022, will star Brad Pitt and receive an exclusive theatrical run "of at least 30 days" before streaming on Apple TV+.
Unrealized projects
Kosinski has been attached to several as-of-now-unmade projects, including remakes of '70s science-fiction films Logan's Run and The Black Hole, the science-fiction film Archangels, an untitled action-thriller from Halt and Catch Fire writers Christopher Cantwell and Christopher C. Rogers, and The Twilight Zone.
Kosinski was confirmed to |
https://en.wikipedia.org/wiki/European%20chemical%20Substances%20Information%20System | The European chemical Substances Information System (ESIS) was a chemoinformatics database that stored information system on chemicals of the European Union. It was created by the former European Chemicals Bureau, which completed its mandate in 2008, in the year 2003. ESIS was set up by the Joint Research Centre of the European Commission in order to make data on the safety of chemicals more readily accessible to the public, offering a single search tool on chemicals and the legislation under which they are presently covered. By October 3, 2013, ESIS contained 14,897 substance records.
ESIS provided access to several registers and lists, shown below:
EINECS (European Inventory of Existing Commercial chemical Substances)
NLP (No-Longer Polymers)
BPD (Biocidal Products Directive)
Export and Import of Dangerous Chemicals
The following databases were originally part of ESIS, but have been taken over by the European Chemicals Agency (ECHA), which will also ensure further updates:
ELINCS (European List of Notified Chemical Substances)
PBT (Persistent, bioaccumulative and toxic)
C&L (Classification and Labelling)
HPVCs (High Production Volume Chemicals) and LPVCs (Low Production Volume Chemicals)
IUCLID Chemical Data Sheets
Priority Lists, Risk Assessment process and tracking system
References
External links
Archived version — Note: ESIS information system has been discontinued (since 17 November 2014).
Cheminformatics
Government databases of the European Union
Regulation of chemicals in the European Union |
https://en.wikipedia.org/wiki/Project%20Runway%20Philippines%20%28season%202%29 | The second season of Project Runway Philippines premiered on August 12, 2009, on cable network ETC and UHF station Southern Broadcasting Network. Model and actress Teresa Herrera returns as the program's host, while fashion designers Jojie Lloren and Rajo Laurel renew their mentorship and judging duties respectively, with top model and fashion columnist Apples Aberin completing the judging panel.
Thirteen (13) designers from all over the Philippines compete in weekly fashion design challenges to earn a spot in Philippine Fashion Week. The winner of this season will receive P500,000 (around US$10,400), an editorial spread in Preview magazine, a start-up business package, and a summer scholarship from Istituto Marangoni, which is the European partner of School of Fashion and the Arts.
Auditions
The second season auditions were held during the time period between December 2008 and March 2009. Auditions for designers based in Metro Manila and Luzon Island were conducted in SM City North EDSA and SM Megamall, while casting call for designers in Visayas and Mindanao island groups were done in SM City Cebu and SM City Davao respectively. A final round of auditions was also held at Solar Century Tower in Makati.
Contestants
The 13 designers competing in the second season of Project Runway Philippines consists of established designers and new designers who used to have jobs unrelated to fashion such as a nurse, a call center agent, and an accountant. They were introduced at a launch party held at Embassy Superclub in Taguig City. Note that the ages listed are the designers' ages at the time the show was taped in early 2009.
Manny Marquez, 37 years old from San Pedro, Laguna. A former scholar of top fashion designer Ben Ferrales, who left his pregnant wife to join the competition.
Russell Villafuerte, 25 years old from San Jose, Antique. An Interior Design graduate from University of the Philippines who works as a graphic designer. Eliminated - December 2, 2009
Santi Obcena, 25 years old from Quezon City, Metro Manila. A former dancer who studied at the Philippine High School for the Arts. Participated in Philippine Fashion Week 2009.Eliminated - December 2, 2009
Cherry Veric, 27 years old from Ibajay, Aklan. A formal wear designer who used to work in Saudi Arabia and China.Eliminated - October 28, 2009
Patrick Galang, 25 years old from San Pedro, Laguna. A former call center agent. Participated in Philippine Fashion Week in 2008. He was cited by Mega magazine as one of "8 Designers You Should Know" and by Preview magazine as one of "11 Best New Designers." Eliminated - September 9, 2009, and again on October 21, 2009
Hanz Coquilla, 27 years old from Talisay City, Cebu. Dropped out of school, with a major in medical technology, to pursue a career as a fashion designer, which he has been doing for nine years. Eliminated - October 14, 2009
Meanne Santos, 21 years old from Bacoor, Cavite. This season's youngest designer, she landed |
https://en.wikipedia.org/wiki/Butler%27s%20Hill%20tram%20stop | Butler's Hill is a tram stop on the Nottingham Express Transit network, serving the suburb of Butler's Hill, Ashfield in Nottinghamshire, England.
The station is situated on the long single line section between Bulwell and Hucknall, which runs alongside the Robin Hood Line. Like all the other intermediate stops on this section, the stop has a passing loop with an island platform situated between the two tracks of the loop.
With the opening of NET's phase two, Butler's Hill is now on NET line 1, which runs from Hucknall through the city centre to Beeston and Chilwell. Trams run at frequencies that vary between four and eight trams per hour, depending on the day and time of day.
The tram stop should not be confused with the former Butler's Hill railway station, which was situated on the, now closed, Great Northern Railway's Nottingham to Shirebrook line, some to the north-west of the tram stop. The Robin Hood line that passes alongside the stop was originally the former Midland Railway route from Nottingham to Worksop, but there has never been a railway station at the stop's location.
References
External links
Nottingham Express Transit stops
Railway stations in Great Britain opened in 2004
Transport in Ashfield District |
https://en.wikipedia.org/wiki/Communications%20data | Communications data (sometimes referred to as traffic data or metadata) concerns information about communication.
Communications data is a part of a message that should be distinguished from the content of the message. It contains data on the communication's origin, destination, route, time, date, size, duration, or type of underlying service.
References
See also
Call detail record
Internet Protocol Detail Record
Pen Register
Data Retention Directive
Interception Modernization Programme
Mastering the Internet
NSA Call Database
CSE and Communications data
Titan traffic database
Law enforcement equipment
Surveillance
Privacy of telecommunications |
https://en.wikipedia.org/wiki/Microsoft%20Certified%20Partner | A Microsoft Certified Partner (MCP) is a firm that provides Microsoft-related products or services, or support for such. It is part of the Microsoft Partner Network.
They are confirmed by Microsoft to be official, and that they work effectively, and help customers with a range of information technology (IT) projects and specific products and services. While not accredited to provide support to the same level as a Microsoft Gold Certified Partner for Support Services, many MCPs offer support as part of their services.
MCPs provide Microsoft services on behalf of Microsoft worldwide, spanning many fields including original equipment manufacturer (OEM), education, software providers, and technical support. They have 24-hour access to Microsoft Support, which enables them to provide reliable customer support. Every MCP has been in business for at least 5 years, has passed several tests, and has proven skills in their particular field. Microsoft rewards these partners with discounts in tools that are applicable to their activities. For example, in the educational field this might take the form of licenses to Microsoft Windows and Microsoft Office.
In return for participating in the program, partners gain support services and tools from Microsoft, often at a significant discount to their retail prices. However, over the lifetime of the contract some risk is transferred from Microsoft to the MCP in return for the benefits of the association with Microsoft and the ability to sell the support services.
Microsoft Gold Certified Partner
Microsoft Gold Certified Partners are Microsoft's most highly accredited independent technical support providers. They must offer support for data management and software development. Becoming a partner requires the use of Microsoft technology as the primary platform for the firm.
Microsoft Certified Training Partner
A Microsoft Certified Training Partner is an IT training company, independent of and unowned by Microsoft, that is officially approved by Microsoft to provide technical training and expertise for Microsoft products a part of the MCP Program.
The content of the IT training courses provided by Microsoft Certified Training Partner companies are certified by Microsoft regarding the accuracy of the instruction given. To receive the certification, a Microsoft Certified Training Partner must demonstrate a broad range of expertise in Microsoft Products. Microsoft Certified Instructors are required to have real-world expertise in Microsoft products as well as hold current Microsoft IT Certifications.
Microsoft Certified Training Partner levels
Microsoft Certified Training Partner is the basic level of the Microsoft Certified Training Partner Program. They have paid a fee to become certified, and must pay to use Microsoft tools and support.
Microsoft Gold Certified Partner is the highest level of the Microsoft Certified Partner Program. These firms have free access to the tools and support they need from Microsof |
https://en.wikipedia.org/wiki/NoSQL | NoSQL (originally referring to "non-SQL" or "non-relational") is an approach to database design that focuses on providing a mechanism for storage and retrieval of data that is modeled in means other than the tabular relations used in relational databases. Instead of the typical tabular structure of a relational database, NoSQL databases house data within one data structure. Since this non-relational database design does not require a schema, it offers rapid scalability to manage large and typically unstructured data sets. NoSQL systems are also sometimes called "Not only SQL" to emphasize that they may support SQL-like query languages or sit alongside SQL databases in polyglot-persistent architectures.
Non-relational databases have existed since the late 1960s, but the name "NoSQL" was only coined in the early 21st century, triggered by the needs of Web 2.0 companies. NoSQL databases are increasingly used in big data and real-time web applications.
Motivations for this approach include simplicity of design, simpler "horizontal" scaling to clusters of machines (which is a problem for relational databases), finer control over availability, and limiting the object-relational impedance mismatch. The data structures used by NoSQL databases (e.g. key–value pair, wide column, graph, or document) are different from those used by default in relational databases, making some operations faster in NoSQL. The particular suitability of a given NoSQL database depends on the problem it must solve. Sometimes the data structures used by NoSQL databases are also viewed as "more flexible" than relational database tables.
Many NoSQL stores compromise consistency (in the sense of the CAP theorem) in favor of availability, partition tolerance, and speed. Barriers to the greater adoption of NoSQL stores include the use of low-level query languages (instead of SQL, for instance), lack of ability to perform ad hoc joins across tables, lack of standardized interfaces, and huge previous investments in existing relational databases. Most NoSQL stores lack true ACID transactions, although a few databases have made them central to their designs.
Instead, most NoSQL databases offer a concept of "eventual consistency", in which database changes are propagated to all nodes "eventually" (typically within milliseconds), so queries for data might not return updated data immediately or might result in reading data that is not accurate, a problem known as stale read. Additionally, some NoSQL systems may exhibit lost writes and other forms of data loss. Some NoSQL systems provide concepts such as write-ahead logging to avoid data loss. For distributed transaction processing across multiple databases, data consistency is an even bigger challenge that is difficult for both NoSQL and relational databases. Relational databases "do not allow referential integrity constraints to span databases". Few systems maintain both ACID transactions and X/Open XA standards for distributed transac |
https://en.wikipedia.org/wiki/Invenio | Invenio is an open source software framework for large-scale digital repositories that provides the tools for management of digital assets in an institutional repository and research data management systems. The software is typically used for open access repositories for scholarly and/or published digital content and as a digital library.
Invenio is initially developed by CERN with both individual and organisational external contributors and is freely available for download.
History
Prior to July 1, 2006, the package was named CDSware, then renamed CDS Invenio, and now known simply as Invenio.
Standards
Invenio complies with standards such as the Open Archives Initiative metadata harvesting protocol (OAI-PMH) and uses JSON/JSONSchema as its underlying bibliographic format.
Support
The service provider TIND Technologies, an official CERN spin-off based in Norway, offers Invenio via a software-as-a-service model.
Variants of Invenio are offered by TIND for all library services as TIND ILS, DA, IR and RDM under a fully hosted and open-core model.
Users
Invenio is widely used outside of its original home within CERN, including SLAC National Accelerator Laboratory, Fermilab, and the École Polytechnique Fédérale de Lausanne. SPIRES migrated to Invenio in October 2011 with the INSPIRE-HEP site, a joint effort of CERN, DESY, SLAC and FNAL.
In 2014, the package was chosen to be the digital library software of all national universities in the western Africa regional economic community UEMOA which includes eight countries: Benin, Burkina Faso, Côte d'Ivoire, Guinea-Bissau, Mali, Niger, Senegal, Togo.
The research data repository Zenodo at CERN is basically run under Invenio v3, wrapped by a small extra layer of code that is also called Zenodo. To simplify reuse of the Zenodo codebase, several institutions have joined in 2019 to distribute an institution-agnostic package under the name of InvenioRDM.
See also
Digital library
Institutional repository
References
External links
Official website
List of sites running Invenio
Short description about some of the features of Invenio
Service provider for Invenio support, installation, training, etc
Digital library software
Free institutional repository software
Free software programmed in Python
CERN software |
https://en.wikipedia.org/wiki/Sockington | Sockington (also known as "Sockamillion" or "Socks") was a domestic cat who lived in Waltham, Massachusetts, United States. He gained large-scale fame via the social networking site Twitter; his co-owner, Jason Scott, an archivist and Internet historian, regularly posted from Sockington's Twitter account since late 2007. As of July 2018, Sockington's account has over 1.2 million followers, many of which are pet accounts themselves.
Sockington was a grey and white domestic shorthaired cat; he was found as a stray outside a Boston subway station in 2004.
In July 2014, Parade magazine called Sockington a "Pet Power Player" and named him #1 in their list of pet social media sensations.
Sockington died on July 18, 2022.
Twitter fame
The posts, or "tweets", are written by Scott from the perspective of Sockington, typical posts run along the lines of:
The posts are written a few at a time using a shell script and slowly fed into Twitter at short intervals.
Between 2007 and January 2009, the Sockington account grew to 10,000 followers. In February 2009, the Sockington account was added to the "recommended feeds" list of Twitter, making it one of the accounts suggested to all new users who joined. This caused a rapid expansion of the account at the rate of between 500 and 5,000 new followers a day. By May 2009 the account had half a million followers, which led British newspaper The Independent to call him "Twitter's latest megastar". In July the number was over three-quarters of a million. In August 2009, that number surpassed 1 million. As of May 2010, Sockington has over 1.5 million watchers, making him the most popular nonhuman tweeter, being the 98th most popular Twitter feed.
Sockington has two feline companions whose Twitter voices are also provided by Jason Scott: the ginger Pennycat (aka Pennsylvania) whose posts tend to reflect ironically on Sockington and his fame, and the other, Tweetie, a rescue cat who looks enough like Sockington to be nicknamed his "Sockelganger" (a portmanteau of Sockington and doppelgänger). Tweetie's tale of rescue has effectively brought attention to the plight of feral cats and provided an opportunity for fund-raising for The Animal Center in Newtown, Connecticut (United States), the shelter that saved him. "Food Lady", the woman responsible for the cats' maintenance and welfare... not to mention kibble, also has a Twitter presence.
Reception
The MSNBC news site holds Sockington's posts to be a parody of Twitter's "online time-wasters", while Scott himself believes the account shows up the low possibility of financial profit from Twitter: "Everybody wants this social media bubble. They want something where we're all chattering so much that we all get rich. This cat makes everybody look like fools because he's got hundreds of thousands of followers. And he doesn't tend to follow anyone but other animals." Mary Ullmer of The Grand Rapids Press called the tweets by Sockington "hilarious" and described the pheno |
https://en.wikipedia.org/wiki/List%20of%20Intercity-Express%20lines%20in%20Germany | This list of Intercity-Express lines in Germany includes all Intercity-Express lines in Germany, not including ICE Sprinter. The latest changes to the Intercity Express network took place at the timetable change on 12 December 2021. The network currently has 35 scheduled lines.
Legend
Line
The official line name given by DB Fernverkehr for each line. Some lines, which have many branches, are divided into individual sections, which deviate slightly from the basic line.
Route
The route represents all stops on a route. Stops, which are served only by a few trains during the day, but are passed through or bypassed several times a day, are shown in italics.
Stock
This column indicates which type of ICE train usually runs on this line.
Lines (2022/23)
10–15
The lines start in Berlin. Line 10 starts at Gesundbrunnen station and runs toward Cologne. Lines 12 and 13 operate from Berlin Ostbahnhof via Brunswick to Frankfurt, while lines 11 and 15 run from the low level of Berlin Hauptbahnhof via Erfurt to Frankfurt. Some trains start/end in Berlin-Gesundbrunnen (11 and 15), Hamburg (11), Kiel (11) and Warnemünde (15).
10
Line 10 runs hourly between Berlin and Düsseldorf or Cologne. At Hamm, the train is divided or combined depending on direction of travel. One portion of the train runs via the Ruhr to Düsseldorf, some continuing to Cologne and Aachen and others to Cologne/Bonn Airport. The other train portion runs via the Bergisches Land to Cologne, some continuing to Bonn and Koblenz.
From Monday to Saturday, ICE 832/841 run from/to Hanover via Bremen to Oldenburg. Nienburg (Weser) is only served towards Oldenburg. During the night from Sunday to Monday, ICE 850 runs from Berlin to Oldenburg.
11
Line 11 runs from Hamburg via Berlin and Frankfurt to Munich. The services run over the Erfurt–Leipzig/Halle high-speed railway between Leipzig and Erfurt and the Mannheim–Stuttgart high-speed railway between Mannheim and Stuttgart. The section from Berlin to Munich is served every two hours. Some trains start or end in Hamburg-Altona. The trains starting in Berlin start in Berlin-Gesundbrunnen or Berlin Hauptbahnhof.
At 8:45 pm on Sunday evening, ICE 990 leaves Munich Hauptbahnhof and runs via Ulm, Stuttgart, Frankfurt and Hanover to Hamburg Hauptbahnhof, which it reaches around 6:00 in the morning. This ICE does not run from Fulda over the high-speed line to Hanover, but first via Bad Hersfeld and only from Göttingen on the high-speed line. On other days of the week this service ends in Frankfurt.
Furthermore, ICE 991 runs from Mondays to Fridays from Wiesbaden via Mainz, Mannheim and Stuttgart to Munich.
On some days another night ICE is added from Munich to Berlin with the following route:
12
Services on the line run every two hours from Berlin via Brunswick, Kassel, Frankfurt and Mannheim to Switzerland. From Karlsruhe, it runs on parts of the unfinished Karlsruhe–Basel high-speed railway. Trains run via Basel to Interlaken three t |
https://en.wikipedia.org/wiki/Ewald%20Heer | Ewald Heer (July 28, 1930) is an aerospace engineer, author and professor who has worked on robotics, artificial intelligence (AI), and large space structures. He is primarily known for his work and advocacy for the development of intelligent robotic systems used to explorate and operate in space.
Background and education
Heer was born in Friedensfeld, Bessarabia (a principality of Moldavia that was part of the Kingdom of Romania in 1918 before being occupied by the USSR) in 1930. He fled the Russian army and escaped to Germany, eventually making his way to the United States.
Heer received a degree in architectural engineering from the Technical University of Hamburg in 1953, a Bachelor of Science degree in Physics from the City College of New York in 1959, a Master of Science from Columbia University in 1960, a Civil Engineering from Columbia University in 1962, and a Doktor-Ingenieur degree from the Leibniz University Hannover in 1964. He is a licensed Professional Engineer in New York and California.
Heer married Hannelore Oehlers on January 26, 1952, in Hamburg, Germany. He has two sons; Thomas Heer born on June 4, 1962, and Eric Heer born on April 4, 1964. Heer has seven grandchildren total, but has publicly stated several times that his favorite grandchildren are Thomas' two daughters Hillary and Julia Heer.
Career
He worked for McDonnell Douglas and General Electric's Space Science Laboratory before joining the Jet Propulsion laboratory in 1966. After completing a one-year assignment as program manager of the lunar surface experiments for Apollo 14 and Apollo 15 in the NASA Office for the Exploration of the Moon at NASA Headquarters, Heer returned to the CALTECH Jet Propulsion Laboratory in 1971, where he initiated the first NASA research program for space robotics and artificial intelligence.
Heer worked to advance space robotics research and organized the first national conference on remotely manned systems in 1972 at the California Institute of Technology and in 1973 published Remotely Manned Systems: Exploration and Operation in Space. In 1975 he organized and chaired the second conference on remotely operated systems, at the University of Southern California, and published its proceedings.
In 1977, Stanley Sadin at NASA Headquarters asked Heer to evaluate machine intelligence and robotics technologies for future space missions and establish requirements. Heer selected and organized the NASA Study Group on Machine Intelligence and Robotics.
While project manager for autonomous systems and space mechanics at NASA in 1979, he was executive secretary of a NASA study group included Carl Sagan as chairman, James S. Albus, Robert Balzer, Thomas Binford, Ralph C. Gonzales, Peter Hart, John Hill, Gentry Lee, Elliott C. Levinthal, Jack Minker, Marvin Minsky, Donald A Norman, Raj Reddy, Charles J. Rieger, Thomas B. Sheridan, William M. Whitney, Patrick Winston, and Steven Yerazunis.
Heer edited and published the findings and recommendati |
https://en.wikipedia.org/wiki/Helith | Helith Network (or just "Helith") is a hacker collective active since 1999 and is a globally spread community. It is suspected that Helith is affiliated to specialists in the field of malware and network security.
Name
The origin of the name came from accident German where the word Helith means "Heroes". It was chosen because the group beliefs that nobody cares for those who are poor or those who did not had the same chances like studied hackers. It was also chosen to point out that the members just do what they are ready to do even if it conflicts with laws or civil restrictions like beliefs or ethics.
The origin of the name may be traced to the fact that "Helith" was founded in Germany and thus accident German was chosen for the group name. Some of the founding members of Helith shared a belief and talked during a Chaos Communication Congress Congress in 1998-1999 in Germany at an improved round table conference about what needs to get done to reach this goal. At the conference Rembrandt was chosen to be the public link for Helith and thus making him the poster child and victim for federal forces. It is not known who is member of "Helith" nor how many members do exist or what they do in detail because very few information get public and Rembrandt itself is a very problematic character like Theo de Raadt.
History
Helith was founded in 1998-1999 in the Berlin area as a location for its members to share information without judging anybody about how they make their living or for whom they work. Their computer hardware and work on various projects like John the Ripper (partly SSE2 code, porting to OpenBSD), metasploit, medusa, hydra or nmap. In time, the members of "Helith" released several security advisories affecting even the most secure OpenSource Operating System OpenBSD, PF firewall, OpenSSH, NetBSD and vendors like Netgear or Nortel. On July 30, 2007, Washington Post reporter Brian Krebs wrote an article partly about "Helith" cracking the Deutsche Bank internal network.
The global links of Helith reach least from Germany where it was founded, to Russia, Romania, Columbia, several African countries and the USA.
Members
Helith Network membership varied but included at various times:
benkei,
ConCode,
Cyneox,
Rembrandt,
Rott_En,
noptrix,
Skyout,
Zarathu
A lot other members might be active but are not disclosed.
The list was created during research with Google and visiting the Helith-Website.
External links
Washington Post article
Current Helith Website
ExploitDB posted Advisory of Helith about PF
NetBSD security Advisory about a Bug in PF
ExploitDB posted Advisory of Helith about a common WiMax router
Hacker groups |
https://en.wikipedia.org/wiki/PivotX | PivotX is an open-source blog software written in PHP using either flat files or a database to store content. It uses the Smarty web template system and the TinyMCE editor. One installation can handle several blogs, each with its own configuration, including themes. Users belong to different levels regarding managing and editing privileges. New functions can be added via extensions managed through the admin interface.
Its development began in 2001 under the name Pivot, using only flat files. In 2012, PivotX developers announced that future versions of this CMS will go two ways: full-fledged "Pivot 4", built on Symfony2 framework, and lightweight "Bolt" CMS, built on Silex framework. However, work continued on PivotX, with version 2.3.8 released in January, 2014. In 2017 it was announced that it's no longer actively developed.
PivotX is free software released under the GNU GPL 2.0 license.
References
External links
Official PivotX github
Official PivotX site
Official Bolt site
Blog software
Free content management systems
Free software programmed in PHP |
https://en.wikipedia.org/wiki/Choreography%20%28disambiguation%29 | Choreography may refer to:
Choreography, the process and result of designing movement sequences
Choreography (dance), the process and result of designing dances
Computer science
In choreographic programming, a programming paradigm in which programs are choreographies
Service choreography, used in business computing
Music
Choreography (Bright Light Bright Light album)
Choreography (Lauren Hoffman album)
Choreography (Vanessa-Mae album)
"Choreography", a song by Irving Berlin
Other
N-body choreography, a solution to a particular case of the n-body problem in classical mechanics
Service choreography, web services-related computing terminology
See also
"Choreographed" (Law & Order: Special Victims Unit), a TV episode |
https://en.wikipedia.org/wiki/Acanthala | Acanthala is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Aceratoneura | Aceratoneura is a monotypic genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault
Hymenoptera genera |
https://en.wikipedia.org/wiki/Aceratoneuromyia | Aceratoneuromyia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault
Hymenoptera genera |
https://en.wikipedia.org/wiki/Achrysocharoides | Achrysocharoides is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault
Hymenoptera genera |
https://en.wikipedia.org/wiki/Acrias | Acrias is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Afrotroppopsis | Afrotroppopsis is a monotypic genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Monotypic Hymenoptera genera |
https://en.wikipedia.org/wiki/Aleuroctonus | Aleuroctonus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Alibertia%20%28wasp%29 | Alibertia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Allocerastichus | Allocerastichus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Alophomyia | Alophomyia is a Neotropical monotypic genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by William Harris Ashmead |
https://en.wikipedia.org/wiki/Alveoplectrus | Alveoplectrus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Ambocybe | Ambocybe is a monotypic genus of hymenopteran insects of the family Eulophidae, from the Indomalayan and Australasian Regions.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Ametallon | Ametallon is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by William Harris Ashmead |
https://en.wikipedia.org/wiki/Anaprostocetus | Anaprostocetus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Anselmella | Anselmella is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Anumanniola | Anumanniola is a monotypic Indomalayan genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Monotypic Hymenoptera genera |
https://en.wikipedia.org/wiki/Aoridus | Aoridus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Apleurotropis | Apleurotropis is a genus of hymenopteran insects of the family Eulophidae that is mostly found in Japan.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Apotetrastichus | Apotetrastichus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Apterastichus | Apterastichus is a Nearctic, monotypic genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Arachnolophus | Arachnolophus is an eastern Palearctic monotypic genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Arachnoobius | Arachnoobius is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Aranobroter | Aranobroter is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Aroplectrus | Aroplectrus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Ascotolinx | Ascotolinx is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Asecodes | Asecodes is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Astichomyiia | Astichomyiia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Astichus | Astichus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Atullya | Atullya is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Aulogymnus | Aulogymnus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Austeulophus | Austeulophus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Australsecodes | Australsecodes is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Awara%20%28wasp%29 | Awara is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Baryscapus | Baryscapus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Bellerus | Bellerus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Hymenoptera genera |
https://en.wikipedia.org/wiki/Benoitius | Benoitius is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Beornia | Beornia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Organisms named after Tolkien and his works
Hymenoptera genera |
https://en.wikipedia.org/wiki/Boucekastichus | Boucekastichus is a genus of wasps in the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Bridarolliella | Bridarolliella is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Bryopezus | Bryopezus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Cabeza%20%28wasp%29 | Cabeza is a Neotropical genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Caccophagus | Caccophagus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Careostrix | Careostrix is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Carlyeia | Carlyeia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Ceratoneura | Ceratoneura is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by William Harris Ashmead |
https://en.wikipedia.org/wiki/Ceratoneuronella | Ceratoneuronella is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault
Hymenoptera genera |
https://en.wikipedia.org/wiki/Ceratoneuropsis | Ceratoneuropsis is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Chaenotetrastichus | Chaenotetrastichus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Chrysocharis | Chrysocharis is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Chrysocharodes | Chrysocharodes is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by William Harris Ashmead |
https://en.wikipedia.org/wiki/Chrysonotomyia | Chrysonotomyia is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by William Harris Ashmead |
https://en.wikipedia.org/wiki/Chytrolestes | Chytrolestes is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Cirrospiloidelleus | Cirrospiloidelleus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae
Taxa named by Alexandre Arsène Girault |
https://en.wikipedia.org/wiki/Cirrospilopsis | Cirrospilopsis is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Cirrospilus | Cirrospilus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Citrostichus | Citrostichus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Closterocerus | Closterocerus is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Clotildiella | Clotildiella is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Clypecharis | Clypecharis is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
https://en.wikipedia.org/wiki/Clypomphale | Clypomphale is a genus of hymenopteran insects of the family Eulophidae.
References
Key to Nearctic eulophid genera
Universal Chalcidoidea Database
Eulophidae |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.