source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Zorba%20%28XQuery%20processor%29 | Zorba is an open source query processor written in C++, implementing
several W3C XQuery and XML specifications and
the JSONiq language for processing JSON data.
Zorba is distributed under Apache License, Version 2.0.
The project is mainly supported by the FLWOR Foundation, Oracle, and 28msec.
Specifications
Zorba provides the implementation of the following W3C specifications:
XQuery 1.0
XQuery 3.0
XQuery Update Facility 1.0
XQuery and XPath Full Text 1.0
XML Syntax for XQuery 1.0
XML Schema
XSL Transformations (XSLT)
XSL Formatting Objects
Zorba also provides implementations of:
JSONiq
Scripting Extension
Data Definition Facility
Scripting
Scripting Extension is an open specification that provides semantic for side-effects in XQuery or JSONiq programs.
It also provides a user-friendly syntax for imperative programming within such programs.
The following code snippet is an example of the Scripting syntax. It computes a sequence containing all the Fibonacci numbers that are less than 100.
(: this is a variable declaration statement :)
variable $a as xs:integer := 0;
variable $b as xs:integer := 1;
variable $c as xs:integer := $a + $b;
variable $fibseq as xs:integer* := ($a, $b);
while ($c lt 100) {
(: this is a variable assignment statement :)
$fibseq := ($fibseq, $c);
$a := $b;
$b := $c;
$c := $a + $b;
}
$fibseq
The following is an example of CRUD operations using Scripting, XQuery, and XQuery Update.
variable $stores := doc("stores.xml")/stores;
(: Create :)
insert node <store><store-number>4</store-number><state>NY</state></store> into $stores;
(: Update :)
replace value of node $stores/store[state="NY"]/store-number with "5";
(: Delete :)
delete node $stores/store[state != "NY"];
(: Read :)
$stores
Data Definition Facility
Data Definition Facility provides a semantic for persistent artifacts such as collections and indexes in XQuery or JSONiq programs.
For instance, the following code snippets declares a collection named entries and an index on that collection named entry.
module namespace g = "http://www.zorba-xquery.com/guestbook";
import module namespace db = "http://www.zorba-xquery.com/modules/store/static/collections/dml";
declare namespace an = "http://www.zorba-xquery.com/annotations";
(: Declares a collection named entries :)
declare collection g:entries as element(entry);
(: Declares a variable that points to the g:entries collection :)
declare variable $g:entries := xs:QName('g:entries');
(: Declares an index named entry on top of the entries collection :)
declare %an:automatic %value-equality index g:entry
on nodes db:collection(xs:QName('g:entries'))
by xs:string(@id) as xs:string;
Storage
Zorba provides a pluggable store so it can be used on different kind of environments: disk, database, browser.
By default, Zorba is built with a main memory store.
28msec implements a store on top of MongoDB.
The XQuery in the Browser project has built a browser plugin for Zorba and leverages th |
https://en.wikipedia.org/wiki/Package%20principles | In computer programming, package principles are a way of organizing classes in larger systems to make them more organized and manageable. They aid in understanding which classes should go into which packages (package cohesion) and how these packages should relate with one another (package coupling). Package principles also includes software package metrics, which help to quantify the dependency structure, giving different and/or more precise insights into the overall structure of classes and packages.
See also
SOLID
Robert Cecil Martin
References
Software design
Object-oriented programming |
https://en.wikipedia.org/wiki/SAS%20Institute%20Inc%20v%20World%20Programming%20Ltd | The SAS Institute, creators of the SAS System filed a lawsuit against World Programming Limited, creators of World Programming System (WPS) in November 2009. The dispute was whether World Programming had infringed copyrights on SAS Institute Products and Manuals, and whether World Programming used SAS Learning Edition to reverse engineer SAS system in violation of its terms of usage.
The case is interesting because World Programming did not have access to the SAS Institute's source code, and so the court considered the merits of a copyright claim based on observing functionality only. The European Committee for Interoperable Systems say that the case is important to the software industry. Some observers say the case is as important as the Borland versus Lotus case.
The EU Court of Justice ruled that copyright protection does not extend to the software functionality, the programming language used and the format of the data files used by the program. It stated that there is no copyright infringement when a company which does not have access to the source code of a program studies, observes and tests that program to create another program with the same functionality.
High Court of England and Wales
On 23 July 2010 Mr Justice Arnold in the High Court of England and Wales referred a number of questions to the Court of Justice of the European Union (CJEU), but expressed his initial views of the main claims via the following observations in the initial judgment ([2010] EWHC 1829 (Ch, [2011] RPC 1).
1. On his preferred interpretation of Article 5(3), WPL's use of the Learning Edition is within Article 5(3), and to the extent that the licence terms prevent this they are null and void, with the result that none of WPL's acts complained of was a breach of contract or an infringement of copyright except perhaps one (see paragraphs 313-315 of the initial judgment).
2 WPL has infringed the copyrights in the SAS Manuals by substantially reproducing them in the WPL Manual (see paragraphs 317-319 of the initial judgment).
3 WPL has not infringed the copyrights in the SAS Manuals by producing the WPS Guides (see paragraphs 320-329 of the initial judgment).
4 On the assumption that Mr Justice Pumfrey's interpretation of Article 1(2) of the Software Directive (from Navitaire v Easyjet [2004]) was correct, WPL has not infringed SAS Institute's copyrights in the SAS Components by producing WPS (see paragraphs 245-250 of the initial judgment).
Mr Justice Arnold quoted (at paragraph 56) from the "SAS language" article of Wikipedia (as at 25 April 2010) in support of his view that SAS is a "programming language" (and thus not protected under the Software Directive):
"SAS can be considered a general programming language, though it serves largely as a database programming language and a language with a wide variety of specialized analytic and graphic procedures."
First, the decision confirms what WPL has always admitted, namely that it has used the SAS Manuals to |
https://en.wikipedia.org/wiki/Droid%20Incredible%204G%20LTE | The Droid Incredible 4G LTE, also known as the HTC Incredible 4G or Incredible 3, is a smartphone designed and manufactured by Taiwan's HTC Corporation that runs the Android 4.0 operating system (ICS). Officially announced by Verizon on May 7, 2012, for CTIA, and released on July 5, 2012, through Verizon Wireless for $149.99 with a new two-year contract. The Droid Incredible 4G LTE is the successor to the HTC Incredible S.
Hardware
The Droid Incredible 4G LTE has a 4-inch qHD (540x960) Super LCD display, a dual core 1.2 GHz Qualcomm Snapdragon S4 processor with 1 GB of RAM, an 8 MP auto-focus camera with LED flash, a 0.3 MP front-facing camera, and a 1700 mAh battery.
Software
The Droid Incredible 4G LTE, at launch, ran Android 4.0.4 (Ice Cream Sandwich), with HTC's Sense 4.1 user interface. However, since launch, the latest available software for this phone is Android 4.4.4 (Kit Kat).
See also
HTC Rezound
HTC One series
Galaxy Nexus
Comparison of smartphones
References
HTC mobile phones
Android (operating system) devices
Discontinued smartphones |
https://en.wikipedia.org/wiki/Computer%20Interchange%20of%20Museum%20Information | The Consortium for Computer Interchange of Museum Information (CIMI) was an initiative for museum IT standards under the auspices of the Coalition for Networked Information (CNI).
The CIMI project was started in 1990 by the US-based Museum Computer Network (MCN) and operated as a committee of MCN. It aimed to develop a standards framework to help museums in exchanging data and providing standard databases. This was published in MCN's Spectra.
CIMI's project managers included Cary Karp and John Perkins.
References
External links
(in the public domain)
Museum associations and consortia
Museum informatics
Organizations based in the United States
Computer-related introductions in 1990
Organizations established in 1990
1990 establishments in the United States |
https://en.wikipedia.org/wiki/She%27s%20Living%20for%20This | She's Living for This is an American television comedy and variety series created by Keith Levy and Josh Rosenzweig. The show currently airs on LGBT cable network here!. The series stars drag performer Sherry Vine. The series premiered on February 24, 2012.
here! produced six episodes for season one. The network announced a second season of the show to begin production in the summer 2012 for a fall 2012 premiere.
In 2012, it was announced that episodes of She's Living for This would be made available on online video service Hulu.
Premise
She's Living for This provides a modern update on the classic TV variety show standard set by the likes of Sonny & Cher, Carol Burnett, and Benny Hill. Each half-hour episode features LGBT comics and entertainers. The show consists of comedy sketches, special guests, musical numbers, and short films.
Cast
Main cast
Sherry Vine serves as the show's host and takes on various roles during the various skits and performances.
Guest stars
Candis Cayne
Justin Vivian Bond
Joey Arias
Cazwell
Peppermint
Bianca Del Rio
Sharon Needles
Recurring cast
Sam Pancake
David Ilku
Busted
Episodes
“The Justin Vivan Bond Episode”
“The Peppermint Episode”
“The Joey Arias Episode”
“The Cazwell Episode”
“The Bianca Del Rio Episode”
“The Candis Cayne Episode”
"The Pandora Boxx Episode"
Production
The concept for She's Living for This began 20 years ago in Los Angeles. Keith Levy asked director Josh Rosenzweig to collaborate on a project. Keith was just developing Sherry Vine and he wanted to do a play- a theatrical piece as Sherry. So, he chose a one-woman show call ‘’Sorry Wrong Number’’ and when they finished, Josh said to him that he was a modern-day drag version of Carol Burnett and that he should have my own variety show.
Over the course of the next two decades, Josh and Keith worked together on plays, musicals, music videos, television shows and films. Two of the "featurettes" they did together Scream Teen Scream and Charlie! played in film festivals.
All along the way, the idea of the variety show was kept alive. And then last year, Josh said he thought he could get it produced at here! with the help of general manager Eric Feldman. They finally started shooting in the fall of 2011.
References
External links
2010s American variety television series
2012 American television series debuts
2010s American sketch comedy television series
Here TV original programming
2010s American LGBT-related comedy television series |
https://en.wikipedia.org/wiki/Filmow | Filmow is a Brazil-based collaborative social network where users list the films and series they have watched or would like to watch, having the option of giving a review of up to 5 stars. The user shares its registered film library with friends. In addition, the site also has the basic functions of a social network where the user can meet new people and make new friends. It was founded by Alisson Patrício and Thais Lima, and it was launched on April 1, 2009.
Website
Filmow allows all users, whether registered or not, to access any title information from the website database, making it a free for research, where anyone can seek information (cast, trailers, posters, reviews...), but only those who register the site can set up a profile and enjoy all the social functions. The site creates a detailed profile of each user's movie taste, gathering and displaying movies and favorite artists and also the movies the user have seen, want to see and doesn't want see. Furthermore, users can also share their opinions about the movies, series and novels through assessments on each title's own page. If a title is not found on the site, users can add their own.
History
In 2008, Thais Lima met Skoob, a social network dedicated to literature, and then had the idea of a social network focused on movies. She showed her idea to her childhood friend Alisson Patrício, who readily approved the idea, and the two soon began working on the project. The project started very small, without foreign investment, and the work done in their spare time, with all the programming done by Alisson, but when the site began to grow they called their friend Wanderson Niquini to join the project with them and help in spreading the website. Rogério Bonfim joined Filmow in 2011 to bring Filmow to next level. They opened an office in São Paulo.
References
External links
Brazilian social networking websites
Social cataloging applications
Internet properties established in 2009 |
https://en.wikipedia.org/wiki/Popping%20%28disambiguation%29 | Popping is a style of street dance.
Popping may also refer to:
Joint popping, the action of moving joints to produce a sharp cracking or popping sound
Popping (computer graphics), an unwanted visual effect that occurs when changing the level of detail of a 3D model
Popping corn, popcorn
Pre-popping, a method of transferring lead information from one online lead form to another
Skin popping, a method of drug administration
Slapping and popping, two different playing techniques used on the double bass and on the (electric) bass guitar
See also
Pop (disambiguation)
Poppin' (disambiguation)
Robot (dance), a street dance style often confused with popping |
https://en.wikipedia.org/wiki/Ufabulum | Ufabulum is the eleventh album by Squarepusher, released on 15 May 2012. Squarepusher has stated that "It's music which is generated purely from programming. There's no live guitar or drums, there's nothing in it which is live, really." At the time of release, Squarepusher made several appearances in festivals across the world, including his first show in Brazil, at the Sónar Festival.
Reception
AllMusic gave the album a score of 4 out of 5, saying "The most striking aspect of Ufabulum is the sense that Jenkinson is building on top of foundations he laid himself. Where early Squarepusher records were notable for their innovative work with beat programming or infusion of organic instruments with electronic mayhem, the songs here seem to begin with that template of jittery beats and grow into dense compositions."
Track listing
Personnel
Tom Jenkinson – Music, artwork (LED imagery)
Nick Robertson – Design, photography
Donald Milne – Photography
Charts
References
2012 albums
Squarepusher albums |
https://en.wikipedia.org/wiki/Google%20Penguin | Google Penguin was a codename for a Google algorithm update that was first announced on April 24, 2012. The update was aimed at decreasing search engine rankings of websites that violate Google's Webmaster Guidelines by using now declared Grey Hat SEM techniques involved in increasing artificially the ranking of a webpage by manipulating the number of links pointing to the page. Such tactics are commonly described as link schemes. According to Google's John Mueller, as of 2013, Google announced all updates to the Penguin filter to the public.
Effect on search results
By Google's estimates, Penguin affected approximately 3.1% of search queries in English, about 3% of queries in languages like German, Chinese, and Arabic, and an even greater percentage of them in "highly spammed" languages. On May 25, 2012, Google unveiled another Penguin update, called Penguin 1.1. This update, according to Matt Cutts, former head of webspam at Google, was supposed to affect less than one-tenth of a percent of English searches. The guiding principle for the update was to penalize websites that were using manipulative techniques to achieve high rankings. Pre-Penguin sites commonly used negative link building techniques to rank highly and get traffic. Once Penguin was rolled out, it meant that content was key, and those with great content would be recognised and those with little or spammy content would be penalised and receive no ranking benefits. The purpose per Google was to catch excessive spammers. Allegedly, few websites lost search rankings on Google for specific keywords during the Panda and Penguin rollouts. Google specifically mentions that doorway pages, which are only built to attract search engine traffic, are against their webmaster guidelines.
In January 2012, the so-called Page Layout Algorithm Update (also known as the Top Heavy Update) was released, which targeted websites with too many ads, or too little content above the fold.
Penguin 3 was released October 5, 2012, and affected 0.3% of queries. Penguin 4 (also known as Penguin 2.0) was released on May 22, 2013, and affected 2.3% of queries. Penguin 5 (also known as Penguin 2.1) was released on October 4, 2013, affected around 1% of queries, and has been the most recent of the Google Penguin algorithm updates.
Google was reported to have released Penguin 3.0 on October 18, 2014.
On October 21, 2014, Google's Pierre Farr confirmed that Penguin 3.0 was an algorithm "refresh", with no new signals added.
On April 7, 2015, Google's John Mueller said in a Google+ hangout that both Penguin and Panda "currently are not updating the data regularly" and that updates must be pushed out manually. This confirms that the algorithm is not updated continuously which was believed to be the case earlier on in the year.
The strategic goal that Panda, Penguin, and the page layout update share is to display higher quality websites at the top of Google's search results. However, sites that were downranked as th |
https://en.wikipedia.org/wiki/Memory%20management%20%28operating%20systems%29 | In operating systems, memory management is the function responsible for managing the computer's primary memory.
The memory management function keeps track of the status of each memory location, either allocated or free. It determines how memory is allocated among competing processes, deciding which gets memory, when they receive it, and how much they are allowed. When memory is allocated it determines which memory locations will be assigned. It tracks when memory is freed or unallocated and updates the status.
This is distinct from application memory management, which is how a process manages the memory assigned to it by the operating system.
Memory management techniques
Single contiguous allocation
Single allocation is the simplest memory management technique. All the computer's memory, usually with the exception of a small portion reserved for the operating system, is available to a single application. MS-DOS is an example of a system that allocates memory in this way. An embedded system running a single application might also use this technique.
A system using single contiguous allocation may still multitask by swapping the contents of memory to switch among users. Early versions of the MUSIC operating system used this technique.
Partitioned allocation
Partitioned allocation divides primary memory into multiple memory partitions, usually contiguous areas of memory. Each partition might contain all the information for a specific job or task. Memory management consists of allocating a partition to a job when it starts and unallocating it when the job ends.
Partitioned allocation usually requires some hardware support to prevent the jobs from interfering with one another or with the operating system. The IBM System/360 used a lock-and-key technique. Other systems used base and bounds registers which contained the limits of the partition and flagged invalid accesses. The UNIVAC 1108 Storage Limits Register had separate base/bound sets for instructions and data. The system took advantage of memory interleaving to place what were called the i bank and d bank in separate memory modules.
Partitions may be either static, that is defined at Initial Program Load (IPL) or boot time, or by the computer operator, or dynamic, that is, automatically created for a specific job. IBM System/360 Operating System Multiprogramming with a Fixed Number of Tasks (MFT) is an example of static partitioning, and Multiprogramming with a Variable Number of Tasks (MVT) is an example of dynamic. MVT and successors use the term region to distinguish dynamic partitions from static ones in other systems.
Partitions may be relocatable using hardware typed memory, like the Burroughs Corporation B5500, or base and bounds registers like the PDP-10 or GE-635. Relocatable partitions are able to be compacted to provide larger chunks of contiguous physical memory. Compaction moves "in-use" areas of memory to eliminate "holes" or unused areas of memory caused by pro |
https://en.wikipedia.org/wiki/Simple%20and%20Fast%20Multimedia%20Library | Simple and Fast Multimedia Library (SFML) is a cross-platform software development library designed to provide a simple application programming interface (API) to various multimedia components in computers. It is written in C++ with bindings available for Ada, C, Crystal, D, Euphoria, Go, Java, Julia, .NET, Nim, OCaml, Python, Ruby, and Rust. Experimental mobile ports were made available for Android and iOS with the release of SFML 2.2.
SFML handles creating and input to windows, and creating and managing OpenGL contexts. It also provides a graphics module for simple hardware acceleration of 2D computer graphics which includes text rendering using FreeType, an audio module that uses OpenAL and a networking module for basic Transmission Control Protocol (TCP) and User Datagram Protocol (UDP) communication.
SFML is free and open-source software provided under the terms of the zlib/png license. It is available on Linux, macOS, Windows and FreeBSD. The first version v1.0 was released on 9 August 2007, and the latest version v2.6.0 was released on 20 June 2023.
Software architecture
Modules
SFML consists of various modules:
System – vector and Unicode string classes, portable threading and timer facilities
Window – window and input device management including support for joysticks, OpenGL context management
Graphics – hardware acceleration of 2D graphics including sprites, polygons and text rendering
Audio – hardware-accelerated spatialised audio playback and recording
Network – TCP and UDP network sockets, data encapsulation facilities, HTTP and FTP classes
While the graphics module is one of the main features of SFML, developers who are interested in only creating an environment to program directly in OpenGL can do so by using the Window module on its own without the graphics module. Similarly, the other modules can also be used independently of each other, except for the System module which is used by all of the modules.
Language bindings
SFML is written in C++ and provides a C++ interface (it also provides a C interface through the official CSFML binding). Several language bindings exist that enable using SFML in other programming languages.
This table lists supported bindings for SFML .
1 Official bindings
Unofficial add-ons
SFML provides the basic functions on which higher-level software can be built. Add-on libraries exist that provide added support for graphical user interfaces (GUIs), 2D lighting, particle systems and animation, video playback and tilemaps.
Reception and adoption
SFML is primarily used by hobbyist game developers, small independent video game developers, and startup companies consisting of several developers at most. Because SFML does not require writing large amounts of code, it has been adopted by many Ludum Dare participants also. Compared to older libraries such as Simple DirectMedia Layer (SDL) and Allegro, the SFML user base is relatively small but growing. , its GitHub software repository has been s |
https://en.wikipedia.org/wiki/Animal%20Practice | Animal Practice is an American sitcom television series which aired on NBC from August 12 to November 28, 2012, on the network's Thanksgiving 2012 television schedule. The series premiered after the end of the 2012 Olympic games (which the network was showing) and was produced by Universal Television and American Work. The series starred Justin Kirk and is set at a veterinary office.
The series was canceled on December 3, 2012, due to low ratings, and replaced by Whitney on November 14, 2012. In addition, the final three episodes were released on NBC.com and Hulu on November 20, 2012.
Cast and characters
Main cast and characters
Justin Kirk as Dr. George Coleman
Wyatt Oleff as Young George
Joanna García Swisher as Dorothy Crane
Bobby Lee as Dr. Robert Yamamoto
Kym Whitley as Juanita
Betsy Sodaro as Angela
Tyler Labine as Dr. Doug Jackson
Crystal the Monkey as Dr. Rizzo
Recurring cast and characters
June Diane Raphael as Dr. Jill Leiter
Brian Huskey as Nurse Howard
Development and production
The show was originally known as Animal Kingdom when it was in development. The network placed a series order in May 2012.
Amy Huberman played the role of "Dorothy Crane" in the original pilot; however, the role was recast with Joanna García.
Crystal the Monkey's character was originally known as "Dr. Zaius" but the rights to the name could not be obtained. At the time of production, Crystal was known for her appearances in a number of motion pictures, most notably the Night at the Museum series.
Marco Pennette replaced Gail Lerner as showrunner after the third episode had been shot.
Promotion
While promoting the show to ad buyers, NBC told them that "Crystal" the capuchin had had "powerful reception among test audiences", and "is perhaps the best-known element about the new show—and, maybe, NBC's entire fall season."
NBC ran a sneak preview of the series on August 12, 2012, as a lead-out for the closing ceremony of the 2012 Summer Olympics; controversially, the already tape-delayed and abridged broadcast was interrupted to air the pilot, causing the finale (which featured a performance by The Who) to be preempted after late local newscasts.
Episodes
Reception
According to Metacritic, the show has received a score of 48/100 and mixed critical reviews. Drusilla Moorhouse, of entertainment news website Zap2It, wrote that "It's too cringe-worthy for overempathizing animal lovers, but general audiences might tune in for a lighthearted, escapist laugh." While Moorhouse's review was more positive, Robert Bianco of USA Today gave a negative review, stating "The shame is that Practice has a fine human cast...but Kirk and his cohorts quickly get taken down by the barrage of stupidity the show sends their way."
Awards and accolades
International broadcasts
In the UK, Animal Practice aired on ITV2 beginning February 11, 2013.
See also
Mr. Smith, a short-lived 1983 NBC sitcom featuring an orangutan
References
External links
2012 American tele |
https://en.wikipedia.org/wiki/Evans%20Data%20Corporation | Evans Data Corporation, also known as Evans Data or EDC, is a notable Santa Cruz, California based market research firm that specializes in software development. It produces multi-client and custom research, including strategic surveys targeting cloud computing, mobile computing, developer relations and developer marketing in Asia Pacific, Europe, the Middle East, Africa, and North America. Its other products and services include DevMetric, a user review site launched in 2012, and Evans Data's annual Developer Relations Conference, held each spring.
History
Founded in 1998 by Janel Garvin, Evans Data Corporation provides market research, market intelligence, and strategic planning in the software development industry. It is now recognized as the industry leader in market intelligence focused on all areas of development from software to hardware to mobility.
Since many manufacturers and vendors desire to keep a finger on the pulse of the development community, Evans Data surveys software developers with the intent of understanding a highly focused, highly technical and very influential segment of the software industry. Citing "the nature of development and the quickly changing technologies that form their world," Evans Data Corporation specializes in conducting market research in the IT and development community. Due to this, they are experts in analyzing technology trends and attitudes.
Research
Syndicated surveys
Evans Data Corporation publishes several annual and semiannual reports. These are:
Global Development Survey Series:
EDC's oldest continuous report, the North American Development Survey, is published semiannually as part of their Global Development Series, once in the spring and again in the fall. The Global Series also includes reports for the Asia Pacific region, including the Indian subcontinent, Australia, and Oceania; and Europe, the Middle East, and Africa. The question set for all regions is the same and at least 400 software developers are interviewed for each region.
Emerging Markets Development Series:
Providing a particular focus on China, Eastern Europe, India, and Latin America, this survey report has the same question set as the Global series.
Mobile Development Series:
A semi-annual survey of over 400 developers worldwide who are actively engaged in mobile development. This series was started in 2003 and contains both trending data and dynamic content current to the flux and change in mobile development.
Cloud Development Survey Series:
Started in 2009, this semi-annual survey series of over 400 developers active in Cloud development or deployment.
Evans Data also publishes annual reports focusing on Developer Marketing and Developer Relations Programs. The latter of these two reports is the focal point for Evans Data Corporation's annual Developer Relations Conference, held in the early spring of each calendar year.
Targeted Analytics
The Targeted Analytics team at Evans Data Corp. offers clients a seco |
https://en.wikipedia.org/wiki/Health%20insurance%20premium%20index | The Health insurance premium index collects data on the evolution of premiums for compulsory and complementary health insurance and is the weighted average of the two sub-indices. By means of the Health insurance premium index, the effects of the evolution of premiums on the growth of households' disposable income can be calculated.
In Switzerland, the Health insurance premium index is compiled by the Federal Social Insurance Office (for the basic health insurance) and by the Federal Statistical Office (for the field of supplementary insurances).
Legal basis
The legal basis of the Health Insurance Premium Index is the Federal Statistics Act of 9 October 1992 (BStatG) and the Ordinance of 30 June 1993 on the Conduct of Statistical Surveys by the Confederation.
Type of survey
The Health insurance premium index is calculated based on an online (email) sample survey. For the basic health insurance a full survey is conducted and for the supplementary insurance the biggest providers, which account for about 70% of the total market, are surveyed. Participation in the survey is compulsory.
Features registered
The survey covers health insurance premiums for the basic and supplementary insurance areas. The annual premium for new basic insurance policies and the supplementary hospital insurances are covered by canton and age category.
Period conducted
The Health insurance premium index has been compiled every year from October to November since 1999.
Footnotes and references
Federal Statistical Office (FSO), Health Insurance Premium Index, Factsheet (German)
External links
Federal Statistical Office (FSO), Health Insurance Premium Index (German)
Health insurance
Healthcare in Switzerland |
https://en.wikipedia.org/wiki/Univention%20Corporate%20Server | Univention Corporate Server (UCS) is a server operating system derived from Debian with an integrated management system for the central and cross-platform administration of servers, services, clients, desktops and users as well as virtualized computers operated in UCS. In addition to the operation of local, virtual instances, UCS can also be operated in cloud environments. Via the integration of the open source software Samba 4, Univention also supports the functions provided in many companies by Microsoft Active Directory for the administration of computers operated with Microsoft Windows. UCS-based components and UCS-certified, third-party products can be installed via the Univention App Center. UCS provides all App Center applications with a runtime environment and services for the operation including a central, consistent management of the apps. Docker containers can also be run on UCS systems and several of the apps available in the App Center are Docker-based.
Univention is a member of the Open Source Business Alliance and supports the creation of the Open Source Business Alliance open source software stacks.
History
The impulse for the development of UCS, which began in 2002, was the lack of a standardised Linux server operating system offering companies and organisations an alternative to Microsoft's domain concept with the proprietary directory service Active Directory. Comparable Linux solutions (e.g., from SUSE and Red Hat) did not offer an integrated, cross-system user and computer management system, with the result that corresponding solutions had to be configured and maintained individually.
Important early driving forces for the development of UCS were initially the Oldenburgische Landesbank and the department of the Bremen Senator for Education and Science, until the product was ready for market launch at the end of 2004. Since then, in addition to new versions, a number of software solutions based on the main product UCS have also been launched.
UCS is predominantly employed in the German-speaking world by companies and public organisations from a wide range of sectors and fields, among others by the regional government authority of the federal state Brandenburg. In 2005, Univention began to market UCS also in other German-speaking countries. Today, UCS is used in many European countries and also outside of Europe, for example, in Australia, Nigeria and the USA where Univention established a subsidiary in 2013.
Licenses and editions
UCS is open-source software; the proprietary developments of Univention GmbH included in UCS were published under the GNU GPL until Version 2.3. With the launch of Version 2.4, the company switched to GNU AGPL. There are also a range of software appliances based on UCS (e.g., in the groupware, desktop and IT service management fields).
Since 21 April 2015 UCS is freely available to companies in form of the UCS Core Edition, which replaced the previous "free for personal use" license. This Core |
https://en.wikipedia.org/wiki/HTC%20Salsa | The HTC Salsa is an Android smartphone that was announced by HTC in June 2011 at the Mobile World Congress.
The HTC Salsa is designed and dedicated for Facebook and Social Networking as the Facebook button indicates. The Facebook button is for sharing statuses, pictures or videos on Facebook in one touch.
Specification
Processor = 800 MHz processor / MSM7227 Turbo (ARMv6)
Memory = 512 MB ROM (onboard) + microSD slot (up to 32 GB) / 512 MB RAM
Display = diagonal 320x480 px HVGA Capacitive TFT touch-screen
Camera(Primary) = 5 MP color with LED flash
Camera (Secondary) = VGA
Connectivity = 800/2100 900/2100 MHz on HSDPA/WCDMA, Quad-band GSM/GPRS/EDGE:850/900/1800/1900 MHz, Bluetooth 3.0, Wi-Fi (IEEE 802.11b/g/n), 3.5 mm stereo
Software = Android 2.3.3 (Gingerbread) with HTC Sense.
Features
Android OS, v2.3 (Gingerbread)
Accelerometer, proximity, compass
A-GPS, SMS (threaded view), MMS, Email, Push Email, IM
HTML
Radio Stereo FM radio with RDS
Facebook dedicated key
SNS integration
Google Search, Maps, Gmail
YouTube, Google Talk, Picasa integration
MP3/AAC+/WAV/WMA player
MP4/H.264 player
Organizer
Document viewer/editor
Voice memo
Predictive text input
See also
Google Nexus
Comparison of smartphones
HTC ChaCha
References
External links
Salsa
Mobile phones introduced in 2011
Android (operating system) devices
Discontinued smartphones |
https://en.wikipedia.org/wiki/Bubble%20Safari | Bubble Safari is a defunct tile-matching social network game by Zynga. The object is to help a monkey named Bubbles reconnect with his friends. Following its May 2012 release, Bubble Safari became the fastest-growing Facebook game, with 1.9 million active users for the week of July 9. PC Magazine ranked Bubble Safari as no. 5 on its Best Facebook Games list. Arcade game designer Mark Turmell, noted for such games as NBA Jam, received credit for Bubble Safari’s development. Bubble Safari is Zynga’s first arcade game, the first Zynga game released on Zynga.com and Facebook simultaneously, and the first game from Zynga San Diego.
History
Bubble Safari was announced and launched on May 9, 2012
Noted arcade game designer Mark Turmell, Zynga’s senior creative director, was credited for the development of Bubble Safari. Turmell began designing arcade game machines over 20 years ago and was the lead programmer and designer of NBA Jam, a popular 1993 basketball arcade game.
By June 12, 2012, Bubble Safari had become the fastest-growing Facebook game with 14,800,000 monthly active users, growing by 10.6 million within the prior week. As of July 9, 2012, Bubble Safari had 30 million monthly active users. The game launched with 65 levels but by June 12, 2012 had grown to 77. The game, as of January 30, 2014 has 749 levels plus up to 80 additional un-numbered levels.
Bubble Safari is the first true arcade game Zynga developed; the first game from Zynga San Diego; and the first Zynga game to launch simultaneously on Zynga.com and Facebook.
PC Magazine ranked Bubble Safari no. 5 on its Best Facebook Games list in July 2012.
On December 12, 2012, Zynga announced the launch of Bubble Safari Ocean, a version of the game with an underwater twist for Facebook in 13 languages, and a mobile version of Bubble Safari for iOS.
Bubble Safari has been indefinitely closed as of September 30, 2015, as Zynga announced in a message on Bubble Safari's Facebook page on August 10, 2015.
Gameplay
Bubble Safari’s storyline focuses on Bubbles, a monkey trying to reconnect with his friends, who have been captured by poachers. Bubbles sets off into the jungle to find the poachers. Players pop bubbles to supply Bubbles fruit for his journey.
The bubble-popping gameplay is in the tradition of Puzzle Bobble and Bubble Bobble. Players aim and fire colored bubbles into a field at the top of the screen; matching three bubbles pops them. Every level-up gets Bubbles closer to finding the poachers against obstacles such as swarming bees and bubble spawners.
Though playing costs energy, gamers can keep earning energy back as long as they clear levels, enabling users to play longer than in some other games.
Players can also tap into their social network and ask friends for extra plays and share bubbles. Friends who give gamers extra bubbles also get a boost themselves. Bubbles can be shared with Facebook friends who are playing the game, and players can participate in a weekly tourna |
https://en.wikipedia.org/wiki/Carrington%20College | Carrington College may refer to:
Carrington College (US), is a network of for-profit private colleges based out of Sacramento, California
Carrington College, Otago, a hall of residence at the University of Otago, Dunedin, New Zealand |
https://en.wikipedia.org/wiki/Kinetic%20data%20structure | A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.
For example, a kinetic convex hull data structure maintains the convex hull of a group of moving points. The development of kinetic data structures was motivated by computational geometry problems involving physical objects in continuous motion, such as collision or visibility detection in robotics, animation or computer graphics.
Overview
Kinetic data structures are used on systems where there is a set of values that are changing as a function of time, in a known fashion. So the system has some values, and for each value , it is known that .
Kinetic data structures allow queries on a system at the current virtual time , and two additional operations:
: Advances the system to time .
: Alters the trajectory of value to , as of the current time.
Additional operations may be supported. For example, kinetic data structures are often used with a set of points. In this case, the structure typically allows points to be inserted and deleted.
Contrast with traditional data structures
A kinetic data structure allows the values stored in it to change continuously with time. In principle, this can be approximated by sampling the position of the points at fixed intervals of time, and deleting and re-inserting each point into a "static" (traditional) data structure. However, such an approach is vulnerable to oversampling or undersampling, depending on what interval of time is used, and can also be wasteful of computational resources.
Certificates approach
The following general approach can be used to construct kinetic data structures:
Store a data structure on the system at the current time . This data structure allows queries on the system at the current virtual time.
Augment the data structure with certificates. Certificates are conditions under which the data structure is accurate. The certificates are all true now, and the data structure will only cease to be accurate when one of the certificates is no longer true.
Compute the failure time of each certificate, the time when it will cease to be true.
Store the certificates in a priority queue, keyed by their failure times
To advance to time , look at the certificate with the lowest failure time from the priority queue. If the certificate fails before time , pop it from the queue and fix the data structure so it is accurate at the time of failure, and update the certificates. Repeat this until the certificate with the lowest failure time in the priority queue fails after time . If the certificate with the lowest failure time in the priority queue fails after time , then all certificates are true at time so the data structure can correctly answer queries at time .
Types of events
Certificate failures are referred to as "events". An event is considered internal if the property maintained by the kinetic data structure does not change when the event occurs. An event is considered |
https://en.wikipedia.org/wiki/Kinetic%20heap | A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements (keys associated with priorities) where the priority is changing as a continuous function of time. As a type of kinetic priority queue, it maintains the maximum priority element stored in it.
The kinetic heap data structure works by storing the elements as a tree that satisfies the following heap property if is a child node of , then the priority of the element in must be higher than the priority of the element in . This heap property is enforced using certificates along every edge so, like other kinetic data structures, a kinetic heap also contains a priority queue (the event queue) to maintain certificate failure times.
Implementation and operations
A regular heap can be kinetized by augmenting with a certificate [] for every pair of nodes, such that is a child node of . If the value stored at a node is a function of time, then this certificate is only valid while . Thus, the failure of this certificate must be scheduled in the event queue at a time such that .
All certificate failures are scheduled on the "event queue", which is assumed to be an efficient priority queue whose operations take time.
Dealing with certificate failures
When a certificate [] fails, the data structure must swap and in the heap, and update the certificates that each of them was present in.
For example, if (with child nodes and ) was a child node of (with child nodes and and parent node ), and the certificate [] fails, then the data structure must swap and , then replace the old certificates (and the corresponding scheduled events) [], [], [], [], [] with new certificates [], [], [], [] and [].
Thus, assuming non-degeneracy of the events (no two events happen at the same time), only a constant number of events need to be de-scheduled and re-scheduled even in the worst case.
Operations
A kinetic heap supports the following operations:
: create an empty kinetic heap
(or find-min): return the (or for a ) value stored in the heap at the current virtual time .
: insert a key into the kinetic heap at the current virtual time , whose value changes as a continuous function of time . The insertion is done as in a normal heap in time, but certificates might need to be changed as a result, so the total time for rescheduling certificate failures is
delete a key at the current virtual time . The deletion is done as in a normal heap in time, but certificates might need to be changed as a result, so the total time for rescheduling certificate failures is .
Performance
Kinetic heaps perform well according to the four metrics (responsiveness, locality, compactness and efficiency) of kinetic data structure quality defined by Basch et al. The analysis of the first three qualities is straightforward:
Responsiveness: A kinetic heap is responsive, since each certificate failure causes the concerned keys to be swapped and le |
https://en.wikipedia.org/wiki/Kinetic%20convex%20hull | A kinetic convex hull data structure is a kinetic data structure that maintains the convex hull of a set of continuously moving points. It should be distinguished from dynamic convex hull data structures, which handle points undergoing discrete changes such as insertions or deletions of points rather than continuous motion.
The 2D case
The best known data structure for the 2-dimensional kinetic convex hull problem is by Basch, Guibas, and Hershberger. This data structure is responsive, efficient, compact and local.
The data structure
The dual of a convex hull of a set of points is the upper and lower envelopes of the dual set of lines. Therefore, maintaining the upper and lower envelopes of a set of moving lines is equivalent to maintaining the convex hull of a set of moving points. Computing upper and lower envelopes are equivalent problems, so computing the upper envelope of a set of lines is equivalent to computing the convex hull of a set of moving points.
The upper envelope of a set of static lines can be computed using a divide and conquer algorithm which partitions the lines into two sets of equal size, calls itself recursively on the two sets to find their upper envelopes, and then merges the two resulting upper envelopes. The merge step is performed using a vertical line sweep. Call the first set of points blue and the second set of points red.
The standard line sweep algorithm for merging upper envelopes sweeps though all of vertices of the red and blue upper envelopes, from left to right. The most recently encountered red and blue points are maintained as the line sweeps. When a point is encountered, the algorithm checks if the point is above or below the segment following the last encountered point of the opposite color. If it is above, that point is added to the merged upper envelope. If it is of a different color than the last added point, the red and blue envelopes have crossed, so the intersection point is also added to the merged upper envelope.
The sequence of edges and vertices resulting from this algorithm is only dependent on the ordering of points, and the results of the line-point comparisons. Thus, the result can be certified with the following certificates:
x-certificates () are used to certify the order the vertices of the red and blue envelopes. They are the certificates for a kinetic sorted list on the set of vertices. Since each point involves 2 lines, and the certificate involves 2 points, each certificate involves 4 lines.
y-certificates () are used to certify that a vertex is above or below an edge. The certificates appear for all comparisons that would occur during the algorithm.
As long as all of these certificates hold, the merge steps will be executed identically, so the resulting upper envelope will be the same. A kinetic data structure for upper envelopes can be created by using these certificates to certify the static upper envelope algorithm. However, this scheme is not local, because one line many be i |
https://en.wikipedia.org/wiki/Kinetic%20closest%20pair | A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize, so new static algorithms were developed to solve this problem.
2D case
Approach 1
The simplest kinetic approach for maintenance of the closest pair is to use variants of the Delaunay triangulations.
Consider a hexagon and partition it into six equilateral triangles, and then create a Delaunay triangulation based on each equilateral triangle, as each one is a convex shape. The union of these six Delaunay triangulations, so called Equilateral Delaunay graph (EDG), is a supergraph for the nearest neighbor graph (NNG); the endpoints of the edge with minimum length in EDG gives the closest pair. It is straightforward to maintain Delaunay triangulations based on convex shapes. Given the EDG over time, by creating a kinetic tournament tree over the edges of the EDG, one can easily maintain the closest pair.
This closest pair KDS is efficient, amortized responsive, and compact, but in general is not local. The following approach presents a local KDS for maintenance of the closest pair.
Approach 2
The second kinetic approach is based on the following observations.
Divide and conquer
If the space around a point is divided angularly into six "wedges", each wide, the closest point to is the closest of the closest points in each of the wedges.
The rest of this article will focus on the "main" wedges (those bisected by the x-axis), and symmetrical arguments will apply to the other wedges after rotating the plane by .
Matched points
Points and are said to be "matched" if they are the closest points to each other. Clearly, the closest pair of points is a matched pair.
Consider points and , such that is to the left of and lies in the wedge centered at described above. If is the closest point to , then must be the closest point (in this wedge) to , in the x-direction.
Thus, the set of pairs of closest points (within this wedge) in the x-direction is a superset of the set of pairs of closest points.
Construction
Map each point p=(x, y) in the set P to a new point , forming the set P' of transformed points. Note that for a point , the points in the "main" wedges have and coordinates either larger or smaller than in this new coordinate system.
Sort the points by x,u and v coordinates, and store them in kinetic sorted lists.
Construct a 2D range tree T on the points in . For every node w in the primary tree, let T(w) be the secondary tree associated with w. This range tree will be used to identify the points in the "main" wedge for a point .
For every node w in the primary tree, and every node e in T(w), calculate the pair (w, e) = (b, r), where b (or r) is defined to be the point with maximum (or minimum) x-coordinate in the left (or right) subtree of |
https://en.wikipedia.org/wiki/Moai-kun | is a puzzle video game developed and published by Konami for the Family Computer in Japan in March 1990. The game derives its themes from Easter Island; the player controls a sentient moai statue that must rescue other moai and escape each stage via a door before the timer expires. Although platforming elements are present, the primary challenge is to find a way to manipulate the objects in each stage to reach the distressed moai and rescue them while still leaving an avenue of escape to the exit door.
Gameplay
Each stage is a single screen with a variety of platforms, enemies, and obstacles. The protagonist moai has limited jumping abilities, but may also smash certain blocks and enemies using a head-butt, or drop bombs found in certain stages to destroy blocks below him.
Although some stages will test the player's platforming abilities by requiring careful jumps, most will instead require careful planning of each move via moving or destroying blocks, and not only its immediate consequences but the long-term effects as well. For example, a block pushed against another object can no longer be moved, which may ultimately prevent the final solution of the puzzle.
Typically each stage has only a single solution (or several very similar solutions), and an incorrect move risks making the stage impossible to solve from that point forward. The player may reset the stage by pressing select at any time, though doing so costs the player one life. Successfully completing a stage awards the player one extra life. In addition to voluntarily resetting the stage, the player may lose a life by touching an enemy, falling into a pit, landing on hazards, being crushed by falling objects, or running out of time.
The game features 56 unique stages, and allows the player to continue the game via use of a password.
The graphics and themes are largely derived from Easter Island imagery, with many backgrounds taking cues from island landscapes and objects and enemies frequently resembling primitive stones or statues. Fantasy elements are present, with many stages taking place in the clouds and enemies using magic.
Release and Reception
Moai-kun was released in March 1990 in Japan for the Family Computer system. Although it never received a North American or PAL release, virtually all of the game's text is in English, with only the title screen graphic in Japanese. It received generally favorable reviews on release, with reviewers praising the brain-teaser variant on platforming.
References
1990 video games
Japan-exclusive video games
Nintendo Entertainment System games
Nintendo Entertainment System-only games
Puzzle video games
Video games developed in Japan |
https://en.wikipedia.org/wiki/The%20Living%20Room%20%28TV%20series%29 | The Living Room is an Australian lifestyle program. The show is hosted by Amanda Keller with co-presenters Barry Du Bois, Chris Brown, and Miguel Maestre. The program began airing on Network Ten on 11 May 2012. The show is aired at 7:30 pm every Friday on Network Ten.
The show is a quadruple award-winner of the Logie Award for Most Popular Lifestyle Program in 2015, 2016, 2017 and 2018.
On 30 November 2019, the program was temporarily axed by Network Ten after 8 seasons, due to cost-cutting measures; however a Christmas special aired on 20 December 2019. On 7 March 2020, it was announced that The Living Room, now produced in-house by Network Ten Studios, had been renewed and it returned on 3 July 2020.
In October 2022, Ten announced that the program would take a break in 2023 and be "rested". Although initially slated to return with the original cast, after Brown signed with the Seven Network in February 2023, in July 2023 Keller stated that she believed the decision was "a death knell" for the show. The show was absent at Ten's upfronts for 2024.
Format
The show delves into a range of lifestyle topics including renovations, travel and pet advice and cooking. From 2012 to 2019 the show featured the team presenting stories in front of a studio audience of around 60 people, with a mixture of live and pre-recorded content presented. The studio segments were filmed at Network Ten Studios in Pyrmont, a suburb in Sydney's inner-city.
The show shifted format in 2020, focussing on helping a family each episode instead of featuring several unrelated lifestyle segments. The 2020 season features a "home base" filmed in a converted warehouse in Newtown, and also axed the studio audience.
Episodes
Series overview
Presenters
Others
Stand-in co-hosts
Chris Brown
While Chris Brown is away in Kruger National Park, South Africa, co-hosting the show I'm a Celebrity...Get Me Out of Here! with Julia Morris, his stand-in co-hosts for The Living Room during that period have been chosen from 'turn-of-the-wheel' spins by Amanda. These stand-in co-hosts have included:
2015
Tim Robards – TV reality star from The Bachelor Australia
Grant Denyer – host of Family Feud
Brendan Jones – Amanda's radio co-host
Shane Jacobson – Australian actor and former co-host of Top Gear
Colin and Justin – Interior decorators and Scottish TV presenters
Ben Mingay – Wonderland actor
Scott Tweedie – The Loop co-host
2016
Jamie Durie – TV presenter, landscaper and horticulturalist
Kris Smith – TV personality and model who later became a contestant on I'm a Celebrity...Get Me Out of Here!
2017
Shannan Ponton – Personal trainer for contestants on The Biggest Loser
2018
Jamie Durie – TV presenter, landscaper and horticulturalist
Matty Johnson – TV reality star from The Bachelor Australia
Kris Smith – TV personality and model
2019
There were no 'stand-in co-hosts' for Chris Brown during the beginning of 2019 because The Living Room began airing later in the year beca |
https://en.wikipedia.org/wiki/International%20Conference%20on%20Computer%20Communications | The first International Conference on Computer Communications was held October 24–26, 1972 in Washington, DC at the Hilton Washington. It was organized by BBN Technologies under the direction of Bob Kahn and was one of the first public demonstrations of computer networking technology and functionality as well as products of the ARPANET project.
IPTO Director Lawrence Roberts, who would serve as the conference's chair, decided that the ICCC would be the ideal place to showcase the capabilities of ARPANET. With the help of MIT professor Al Vezza, Khan enlisted help from across the country of scientists and students working with ARPANET. A Terminal Interface Processor was installed at the Hilton, connected to ARPANET by a dedicated phone line installed by AT&T, and then connected to dozens of terminals set up on the floor. The conference began with a VIP reception on the 22nd before opening on the 24th. The ARPANET demo was a "mind-blowing" success, connecting attendees to systems across the nation and abroad to engage them in a variety of activities, including interacting with an air traffic control system and playing computer chess. The success of the demo prompted an acceleration of the use and expansion of ARPANET, bringing the network closer to becoming the modern internet.
Bob Metcalfe wrote a book called "Scenarios" that described 19 ways the network could be used.
References
Further reading
Where Wizards Stay Up Late: The Origins of the Internet Katie Hafner (with Matthew Lyon) (Simon & Schuster, 1996)
External links
RFC #371 - Demonstration at International Computer Communications Conference
Computer conferences |
https://en.wikipedia.org/wiki/Oracle%20Application%20Testing%20Suite | Oracle Application Testing Suite is a comprehensive, integrated testing solution for Web applications, Web Services, packaged Oracle Applications and Oracle Databases.
Description/History
Oracle regularly releases updates to the Oracle Application Testing Suite. These updates often include new features, improvements to existing features, and better compatibility with evolving technologies.
The test solution was originally developed by RSW, who was bought by Teradyne that created the software and call center test company Empirix.
Empirix eTest Suite was acquired by Oracle in June 2008 and was rebranded as Oracle Application Testing Suite.
The Oracle Application Testing Suite is part of the Oracle Enterprise Manager product family and comprises the following tightly integrated products:
Oracle Load Testing for scalability, performance and load testing.
Oracle Functional Testing for automated functional and regression testing.
Oracle Flow Builder is introduced as part of Functional testing along with the Release of OATS 12.3.0
Oracle Test Manager for test process management, including test requirements management, test management, test execution and defect tracking.
Oracle Application Testing Suite also provides a series of integrated testing accelerators for testing Oracle packaged applications and SOA applications.
These accelerators enable enhanced scripting capabilities for more efficient and optimized testing.
Supported technology/Applications
Web/HTML, Adobe Flex, Siebel, Oracle E-business Suite, Oracle Fusion Applications, JD Edwards EnterpriseOne, Application Development Framework, Oracle Forms, Web Services, Oracle Databases
Scripting platform
Oracle Application Testing Suite have one unified scripting platform called OpenScript. This is an Eclipse-based scripting platform that provides a graphical user interface and the possibility to extend scripts by using Java code.
Languages
Oracle Functional Testing and Oracle Load Testing both uses the same scripting platform (OpenScript) and scripts may be extended by using the Java programming language.
License models
Oracle Functional Testing is licensed based on NUP (Named User Plus).
Oracle Test Manager is licensed based on NUP (Named user Plus).
Oracle Load Testing is licensed based on:
Number of processors for the Load Testing Controller
Number of virtual users to be simulated
The base license covers web applications support. Additional accelerators may be licensed as needed.
Compatibility for Functional Testing
OATS (Oracle Applications Testing Suite) has evolved adding compatibility with different operating systems, Java versions, browsers, etc.
Latest Version of 12.5 supports
Browsers:
Record and Playback on
IE 8.x, 9.x, 10.x and 11.x
Firefox (ESR) 10.x, 17.x, 24.x and 31.x
Playback on
Chrome 32+
Java Runtime Environment:
JRE 1.6
JRE 1.7
JRE 1.8
Operating System: 32 bit and 64 bit of
Windows 2003
Windows 7
Windows 8
Windows 2008
Windows 2008 R2
Windows |
https://en.wikipedia.org/wiki/MDNX | MDNX was a private telecommunications company located in Bracknell and London. In December 2013 MDNX acquired the entire issued share capital of Easynet, a global provider of managed networking, hosting and cloud integration services, from LDC. The combined business went by the name of Easynet. Its CEO was Mark Thompson. The company was acquired by Interoute in September 2015.
MDNX's origins lie in the former Siemens service group company, 'Solution1'. Thompson and colleague Wayne Churchill joined Solution1 in 2009, and decided to set up MDNX. Within months MDNX bought out 'Solution1' along with its customer base, acquired the retail section of Viatel, gaining fibre network and hosting sites, and CI-Net with cloud and wireless capability. The new company brand launched in 2010.
In March 2012 MDNX was one of 12 companies that successfully bid for the provision of services to the UK Public Services Network.
In August 2012 MDNX acquired Octium (trading as Griffin and Iconnyx).
In December 2013 MDNX acquired Easynet.
In September 2015 Interoute announced agreement to acquire MDNX (trading as Easynet) for £402m.
On 23 February 2018, Interoute was acquired by GTT Communications for $2.3bn (€1.9bn); the acquisition closed on 31 May 2018.
References
External links
Comms Business article on MDNX acquisition of Easynet December 2013
Interview with Mark Thompson Global Telecoms Business January 2014
Telecommunications companies of the United Kingdom
Companies based in Bracknell |
https://en.wikipedia.org/wiki/MXlo | MXlo means DNS resource records of the MX type that have a value of localhost. The name comes from combining the MX from Mail eXchange and the lo abbreviation for a loopback networking interface, and is an anti-spam technique that is growing in popularity with network administrators who manage a large number of unused legacy domain names.
Overview
MX records provide a resource for internet hosts to discover the designated SMTP service for a given domain. By pointing MX records for unused domains to localhost/127.0.0.1, any SMTP traffic to these domains is sent back to the originating host. Under normal circumstances, this is undesirable behavior. In the case of unused domains, particularly those that have been actively used and receive large amounts of spam, this practice places the system load on the originating server. This is desirable from multiple perspectives, as it decreases load on the target systems and networks, and motivates internet service providers to minimize the sending of spam through their systems.
History
MXlo was conceived by a lone network administrator for a large engineering corporation. As the company acquired and subsequently retired domain names, the MX records for these domains were pointed to localhost to minimize system load from unwanted traffic. As admins and other technical people described this practice to each other, it picked up the nickname MXlo.
Practical Implications
For systems and providers that transmit a large volume of spam, sufficient use of the MXlo practice can cause a self-inflicted DoS (denial of service) attack, motivating the affected provider to prevent the sending of spam through their systems.
Implementation
DJBDNS (tinydns)
@yourdomain.tld::localhost:10
BIND
yourdomain.tld. IN MX 10 localhost.
Others
Refer to your software documentation/manual
Seeding
A practice that has grown with the MXlo concept is seeding. Once MXlo has been implemented for a given domain, and if there is no intention to use the domain anymore, some administrators seed spam lists by publishing fake e-mail addresses associated with the target domain in public forums—blogs, wiki sites, etc.—and entering them in web forms that spammers are known to harvest e-mail addresses from. This technique intentionally creates unnecessary traffic for high volume spam hosts and increases their operating costs—and, in some cases, assists the aforementioned self-inflicted DoS attacks.
See also
Domain Name System
Mx record
Email spam
SMTP
Sender Policy Framework
Spamassassin
Greylisting
Mail transfer agent
Domain Name System |
https://en.wikipedia.org/wiki/Public%20Services%20Network | The Public Services Network (PSN) is a UK government's high-performance network, which helps public sector organisations work together, reduce duplication and share resources. It unified the provision of network infrastructure across the United Kingdom public sector into an interconnected "network of networks" to increase efficiency and reduce overall public expenditure. It is now a legacy network and public sector organisations are being migrated to using services on the public internet.
Origins
The Public Services Network (PSN) was launched officially as part of the Transformational Government Strategy commencing in 2005, under the original name of the Public Sector Network.
Prior to this, some parts of local government had already successfully implemented the concept. The Hampshire Public Services Network (HPSN) was the first PSN, launched in 1999, followed closely by Kent County Councils partnerships with the KPSN. The HPSN, encompassing all of the borough, district and unitary councils, with the County Council, as well as the Fire Services, the Isle of Wight Council and 540 schools. National PSN technical and architecture compliance criteria were established from 2007, by GDS working with local government leaders from Socitm (the Society of Information Technology Management) on the National CIO Council and the Local CIO Council.
The PSN's aim was to bring public services organisations with a common interest onto a single, coherent and standards-based ‘network of networks’. This would create influence, economies of scale and a commonality of standards for secure and easy inter-connection between public service organisations.
The original concept of a network of networks strategy was based upon the work already undertaken in local government and recognition of Communities of Interest (COI) within the Criminal Justice Sector during work by the Office for Criminal Justice Reform (OCJR) between 2005 and 2007 to enable data sharing across business units.
In this context a COI was defined as groups of Government departments and external partners who in combination provided services within a specific area of operation and used the same data, with a similar risk profile, shared risk appetite and common governance framework.
Historically each group member had implemented their own networks and standards of operation in isolation with little or no consideration as to how services and data may be shared and resulting in increased costs of operation.
The Network of Networks strategy proposed within OCJR recommended the creation of specific networks based upon these Communities of Interest which were joined together through data interchange gateways supporting common standards.
Under this approach networks would be arranged by data type and business functions such as Criminal Justice, Health and Social Care, Defence and Intelligence or Public Finance rather than solely on established departmental boundaries.
Within a COI, trust relationships and d |
https://en.wikipedia.org/wiki/Albrecht%20Schmidt%20%28computer%20scientist%29 | Albrecht Schmidt (born 1970) is a computer scientist best known for his work in ubiquitous computing, pervasive computing, and the tangible user interface. He is a professor at Ludwig Maximilian University of Munich where he joined the faculty in 2017.
Biography
Professional career
Albrecht Schmidt received an M.Sc. in computing from Manchester Metropolitan University (UK) in 1996. His master thesis was on modular neural networks. In 1997, he finished his master's degree in computer science at the University of Ulm (Germany). As a research assistant Schmidt was working towards a PhD at Telecooperation Office (TecO), University of Karlsruhe (Germany) from 1998 to 2001. He continued his study at Lancaster University (UK) to finish his PhD. Schmidt's PhD thesis was titled Ubiquitous Computing - Computing in Context. Schmidt transferred to the Ludwig Maximilian University of Munich (Germany) in 2003, where he led the Emmy-Noether Research Group 'Embedded Interaction'. He was appointed professor for applied computer science/media informatics at the University of Bonn and simultaneously served as department manager at the Fraunhofer Institute 'Institut für Intelligente Informations- und Analysesysteme (IAIS)'. From October 2007 to December 2010, he took the position as chair for pervasive computing at University of Duisburg-Essen. From January 2011 to August 2017, Schmidt directed the 'Human-Computer Interaction' research group at the Institut für Visualisierung und Interaktive Systeme at University of Stuttgart. Since October 2017, he has been the head professor of the research group 'Human Centered Ubiquitous Media Group' at the Department of Computer Science at the Ludwig Maximilian University of Munich.
Recognition
Schmidt was elected to the CHI Academy in 2018.
Schmidt was elected to the German National Academy of Sciences Leopoldina in 2020.
Selected bibliography
A. Schmidt, M. Beigl, H.W. Gellersen: "There is more to context than location", In: Computers & Graphics 23 (6), 893–90, 1999
A. Schmidt, K. Aidoo, A. Takaluoma, U. Tuomela, K. Van Laerhoven, W. Van de Velde: "Advanced interaction in context", In: Handheld and Ubiquitous Computing, 89-101, 1999
A. Schmidt: "Implicit human computer interaction through context", In: Personal and Ubiquitous Computing 4 (2), 191–199, 2000
H.W. Gellersen, A. Schmidt, M. Beigl: "Multi-sensor context-awareness in mobile devices and smart artifacts", In: Mobile Networks and Applications 7 (5), 341–351, 2002
M. Beigl, H.W. Gellersen, A. Schmidt: "Mediacups: experience with design and use of computer-augmented everyday artefacts", In: Computer Networks 35 (4), 401–409, 2001
A. Schmidt: "Ubiquitous computing-computing in context" (Ph.D. thesis), 2002
A. Schmidt, K Van Laerhoven: "How to build smart appliances?", In: Personal Communications, IEEE 8 (4), 66-71 2001
N. Kern, B. Schiele, A. Schmidt: "Multi-sensor activity context detection for wearable computing", In: Ambient Intelligence, 220–232, 2003
W. |
https://en.wikipedia.org/wiki/Albrecht%20Schmidt | Albrecht Schmidt is the name of:
Albrecht Schmidt (computer scientist) (born 1970), computer scientist
Albrecht Schmidt (actor) (born 1870), Danish actor |
https://en.wikipedia.org/wiki/Lightower%20Fiber%20Networks | Lightower Fiber Networks, founded in 2006, was a provider of telecommunications and IT services. It offered cloud computing, colocation hosting, and connectivity.
Description
The company's network spans the Northeast, Mid-Atlantic and Midwest United States including Connecticut, Illinois, Indiana, Kentucky, Maine, Massachusetts, Maryland, Michigan, New Jersey, New York, North Carolina, Ohio, Pennsylvania, Rhode Island, Vermont, Virginia, Washington, DC, and New Hampshire. Additionally, Lightower offers service in both Toronto and London. The network comprises over 33,000 route miles of fiber.
Lightower’s products include network and video transport, alternative access, nationwide long haul services, dark fiber, Ethernet, and cloud computing services. Lightower has built out access to over 22,000 service locations throughout the Northeast, Mid-Atlantic, and Midwest including 275+ data centers and 5,000+ wireless towers, rooftop cell sites, and small cells.
Customers include Fortune 500 businesses, enterprise, carriers, financial services, media, healthcare, education, and government.
The company was acquired by Berkshire Partners in December 2012 when it also acquired Sidera Networks and announced plans to merge them under the Lightower brand. Its previous owners were M/C Partners and Pamlico Capital (the investing unit of Wachovia before its takeover by Wells Fargo. Those two companies had bought it from National Grid in 2007. Lightower was bought by Crown Castle in July 2017, and no longer exists as a separate company.
The company was the title sponsor of the Lightower Conference Classic, now called the Roc City Hoops Classic.
Mergers and acquisitions
2007
National Grid Wireless- Acquisition (NEESCom)
2008
Keyspan Communications - Acquisition
Hudson Valley DataNet - Acquisition
2010
Veroxity Technology Partners - Acquisition
Lexent Metro Connect New York City based neutral telecommunications provider that owns, operates, builds and maintains its own dark fiber network in New York, Northern New Jersey, and surrounding areas. - Acquisition
Open Access, Inc. - Acquisition
2013
Sidera Networks - Merger
2015
Fibertech - Merger
Colocation Zone - Acquisition
2016
Datacenter101 - Acquisition
References
"Lightower Picks Ciena for 100G". 11 January 2012.
"Lightower’s Ultra-Low Latency Network Provides Fastest Networking to Key Financial Centers". 3 November 2011.
"Lightower Announces New Network Expansion Projects in New York Metro and Southern Connecticut". 21 June 2011.
”Lightower Completes Acquisition of Open Access Inc.” 1 April 2011.
”Lightower Acquires Veroxity Technology”. 25 May 2010.
External links
Lightower on Twitter
Companies based in Middlesex County, Massachusetts
Telecommunications companies based in Massachusetts
Synchronous optical networking
Telecommunications companies established in 2001 |
https://en.wikipedia.org/wiki/ESIEE%20Paris | ESIEE Paris () is a grande école of engineering located in Marne-la-Vallée. The school was established in 1904 and is part of the ESIEE network of graduate schools.
ESIEE Paris offers its students general engineering training with the aim of enabling them to design, produce and oversee complex industrial systems while meeting strict economic constraints and dealing with an international environment. To accomplish this, the school renders advanced scientific and technological training, which is frequently updated to keep pace with changes in the leading edge technologies and supplemented by its association with language, general culture, economics and humanities teaching.
ESIEE Paris belongs to the Paris Île-de-France Regional Chamber of Commerce and Industry. The school is also a member of the Conférence des Grandes Écoles, and Université Gustave Eiffel. The 'modernist' school building located at Marne-la-Vallée has been designed and conceived by the famed French architect Dominique Perrault.
History
It was founded in 1904 and was known until the 1960s as the Breguet school. Created in 1904, under the patronage of a family whose three generations contributed to the progress of electricity in the nineteenth century, their descendants accepted that the new school be called Breguet School. The school, from its inception, is intended to constitute in the field of science and technology of electricity, the equivalent of what had been for a long time, the National Schools of Arts and Crafts for mechanics, and delivers an engineering degree.
Recognized by the State by decree of January 3, 1922, the order of diploma is signed by the Minister of Supervision in 1926.
Following the law of July 10, 1934, which specified the conditions of issue and the use of the title of qualified engineer, the Breguet School continues to appear on the list of establishments entitled to issue the title of engineer, after three years of consecutive studies at an entrance examination, aligned with the admission requirements of similar public schools.
At the very beginning, in 1904, it was not about electronics, let alone about computers and systems, but about electricity and mechanics. As the technical and technological evolution progressed, the School's teaching was adapted. Terrestrial television and radio courses appeared in the 30s and 40s and were replaced and strongly developed after the war under the general term of electronics.
The scientific and technical education, supplemented by a broad general education allowed some 4 000 engineers from the 60 promotions, to adapt to all the circumstances of their professional life. Breguet is found in a wide range of industries, in its first place, obviously, in electrical or mechanical construction, electronics, aeronautics, but also in national services such as EDF, public works, transport, etc.
In 1960, the Chamber of Commerce and Industry of Paris, anxious to add to its teaching work a training of engineers, chooses B |
https://en.wikipedia.org/wiki/Autostraddle | Autostraddle is a formerly independently owned online magazine and social network for lesbian, bisexual, and queer women (cis and trans), as well as non-binary people and trans people of all genders. The website is a "politically progressive queer feminist media source" that features content covering LGBT and feminist news, politics, opinion, culture, arts and entertainment as well as lifestyle content such as DIY crafting, sex, relationships, fashion, food and technology.
Autostraddle was founded in 2009 by Riese Bernard, the current CEO and CFO, and former Design Director Alexandra Vega. In June 2020, Kamala Puligandla succeeded Bernard as editor-in-chief. In June 2021, Carmen Phillips was named the new editor-in-chief.
The site received 400,000 unique visitors and 2 million views per month in 2012. In 2016 these numbers had risen to one million unique visitors and 3.5 million views per month. In 2023, the site received 2.5 million unique views per month. The website received GLAAD's Outstanding Blog Award in 2015, and was nominated in 2013, 2014, and 2018.
History
Riese Bernard founded Autostraddle in March 2009 with Alexandra Vega, the website's former Design Director. She wanted to create a website for queer women that was unlike other sites that existed at the time. The senior team consists of Riese Bernard, Laneia Jones, Carmen Philips, Kayla Kumari Upadhyaya, Nico Hall, and Heather Hogan.
Revenue, funding, and financial status
In a 2016 article for Nylon Magazine, founder Riese Bernard discussed Autostraddle's alternative revenue strategies in the context of the rapid disintegration of queer women-oriented publications and online spaces. She has noted that advertisers largely do not buy ad space on the website. Autostraddle's funding model relies heavily on memberships, merchandise, and community fundraising.
In May 2023, Bernard announced that "financial reasons" had forced Autostraddle to reduce spending by scaling back, terminating contracts, and cutting writers and editors.
In August 2023, Autostraddle was acquired by For Them, a company founded in 2021 that sells chest binders, and the website was rebranded as "Autostraddle by For Them".
Content
Autostraddle publishes content on relationship dynamics, radical queer politics, economic injustice, among other things. In 2019, Riese Bernard and Buffering the Vampire Slayer'''s Kristin Russo started To L and Back, a podcast recapping every single episode of The L Word in order, one by one. Filmmaker Carly Usdin took over for Russo as co-host starting in season 2, and the show began featuring regular special guests.
Queer Girl City Guides
As part of their travel section, Autostraddle began publishing Queer Girl City Guides in 2012. Queer Girl City Guides are user-created, Autostraddle-approved guides to cities in the United States and abroad for queer women moving to or traveling to a new city. The guides discuss places to dance, eat, drink, be entertained, party, play sports, |
https://en.wikipedia.org/wiki/First%20Cut | First Cut may refer to:
First Cut (UK TV series), a British series of documentaries
First Cut (U.S. TV series), an American medical drama series on The CW Television Network, retitled Emily Owens, M.D.
First Cut (album), 2000 album by Mai Kuraki
The First Cut – The Immediate Anthology, 2001 album by P.P. Arnold
Vacancy 2: The First Cut, 2008 American film
Caedmon's Song, also known as The First Cut, 1990 novel by Peter Robinson
Neighboring Sounds (band), formerly known as The First Cut, an indie band from Bergen, Norway
See also
Rough cut, the first cut of a film
First haircut |
https://en.wikipedia.org/wiki/Rolf%20Sk%C3%A5r | Rolf Skår (13 May 1941 – 24 May 2023) was a Norwegian engineer and entrepreneur. He was a co-founder of the computer manufacturing company Norsk Data in 1967, and took over as chief executive officer (CEO) of the company from 1978 to 1989. He was later CEO of the Royal Norwegian Council for Scientific and Industrial Research, chaired the Norwegian Polytechnic Society, and was CEO of the Norwegian Space Centre from 1998 to 2006. For his contributions to information technology and space activity, Skår was knighted as in the First Class of the Order of St. Olav in 2010.
Early life and education
Born in Karmøy on 13 May 1941, Skår was the son of farmer and fisherman Lars Martin Skår and Magnhild Ytreland.
In 1966, Skår graduated in cybernetics from the Norwegian Institute of Technology where he studied under Professor Jens Glad Balchen.
During his studies he had several periods abroad. In the summer of 1963 he went to Switzerland to work for an electrical products manufacturer. The following year he took part in the CERN Summer Student Programme working with digital technology and during the summer 1965 he worked for NATO Saclant in La Spezia, Italy. His diploma involved software development on the minicomputer SAM at the Norwegian Defence Research Establishment, while serving his mandatory military duty there. After the military duty, he was assigned as researcher at the institute, working on the institute's next computer project called SAM-2.
Norsk Data
Skår was a co-founder of the computer manufacturing company Norsk Data in 1967, along with Lars Monrad-Krohn, the first director, and . Skår was CEO of the company from 1978 to 1989. Prior to becoming CEO, he had assumed various positions in the company, both in software development and in sales and marketing. During this period Norsk Data grew to become one of the largest computer manufacturers in Europe, followed by a steep decline due to competition from Unix servers and PC networks. Skår resigned from his position in 1989, and Norsk Data was dissolved in 1992.
Later career
From 1990 to 1992, Skår was CEO of the Royal Norwegian Council for Scientific and Industrial Research, and he was CEO of from 1993 to 1997. From 1993 to 1995 he also chaired the Norwegian Polytechnic Society. He was CEO of the Norwegian Space Centre from 1998 to 2006, thus taking a leading part in the development of the Svalbard Satellite Station, as well as in bringing modern telecommunication to Svalbard by establishing fiber cables between Svalbard and mainland Norway, the Svalbard Undersea Cable System. He also represented Norway in the European Space Agency.
Recognition
Skår was a fellow of the Norwegian Academy of Technological Sciences, the Royal Swedish Academy of Engineering Sciences, and the International Academy of Aeronautics. He was decorated Knight, First Class of the Order of St. Olav in 2010, for his contributions to information technology and space activity.
Personal life
Skår married Aslaug Signy Nisi |
https://en.wikipedia.org/wiki/Soul%20Sacrifice%20%28video%20game%29 | Soul Sacrifice is an action role-playing video game developed by Marvelous AQL, with assistance from Japan Studio, and published by Sony Computer Entertainment for PlayStation Vita. It was released worldwide in 2013.
The core mechanic of the game is the ability to sacrifice parts of the character's body or items to create devastating attacks. These sacrifices will be permanently marked on the player character's body, meaning that they are not an infinite resource that can be tapped into. The concept was created by Keiji Inafune. An expanded version of the game, Soul Sacrifice Delta, was released in 2014.
Plot
The main protagonist of Soul Sacrifice is one of the innocent bystanders that has been enslaved by a powerful and cruel sorcerer known as Magusar, who absorbs human sacrifices to remain immortal. Just before the protagonist is going to be sacrificed, a talking book appears before them. The book, named Librom, is a collection of stories that describe past fights between monsters and the powerful sorcerer. The player character is able to enter the book's world and experience the fights in events known as Phantom Quests, thereby gaining the experience and power needed to defeat Magusar. The game has two endings depending on whether the player saves or sacrifices Magusar after his defeat. There is also a third ending that occurs if the player defeats Magusar before completing all of the main stories in Librom.
Gameplay
Soul Sacrifice is played in the third-person perspective. The player character is a sorcerer who relives another sorcerer's memories through a journal. The character can be customized in various options and can change throughout the game. The abilities ("sacrifices") are part of this customization, which allows the game to have roles such as tank, ranged caster or melee DPS.
The game features four-player cooperative play and the ability to sacrifice party members to destroy powerful foes. The slain party members are not given the usual recognition in a game, such as experience points. However, the player does gain bonus points for being sacrificed. Four-player cooperative play is only available on some quests, such as Inside Avalon (a portion of the journal).
Combat
Central to the combat system is the saving and sacrificing mechanics. When an enemy or ally is defeated, they collapse to the ground and you are given the choice to either save or sacrifice them. Saving an enemy restores a small portion of health, while saving an ally consumes 1/2 your current health but restores that ally back to the fight. Players can also choose to sacrifice their allies to create a powerful map wide damaging spell. However, sacrificed players can no longer be healed and enter a spectator type mode in which they can continue to watch the fight. Sacrificed players have the benefit of being able to see numerical damage figures and exact health bars. They are also able to tap the screen to either boost allies or weaken enemies. Sacrificed allies do |
https://en.wikipedia.org/wiki/Kinetic%20tournament | A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of time. It is implemented analogously to a "tournament" between elements to determine the "winner" (maximum or minimum element), with the certificates enforcing the winner of each "match" in the tournament. It supports the usual priority queue operations - insert, delete and find-max. They are often used as components of other kinetic data structures, such as kinetic closest pair.
Implementation
A kinetic tournament is organized in a binary tree-like structure, where the leaves contain the elements, and each internal node contains the larger (or smaller) of the elements in its child nodes. Thus, the root of the tree contains the maximum (or minimum) element at a given time.
The validity of the structure is enforced by creating a certificate at each node, which asserts that the element in the node is the larger of the two children. When this certificate fails, the element at the node is changed (to be the element in the other child), and a new certificate representing the new invariant is created. If the element this node was a winner at its parent node, then the element and certificates at the parent must be recursively updated too.
Analysis
This is a O(n) space, responsive, local, compact and efficient data-structure.
Responsiveness: A certificate failure will cause the creation of a new certificate to replace the old one, which must be put into the event queue. It may also trigger changes to the O(logn) certificates at its parent nodes. Each certificate change requires a delete and insert operation in the priority queue of events. Each of these takes O(log n) time, so the responsiveness, the total time required to process a certificate failure, is . While this is considered responsive in general, it is less responsive than other kinetic priority queues such as kinetic heaps which respond to certificate failures with O(1) certificate changes.
Locality: Each element is involved in O(logn) certificates (for example, the maximal element is involved in a certificate at each of its parents all the way up to the root node). Again, while this is considered local, a kinetic heap is much more local.
Compactness: This is a very compact structure, containing O(n) certificates - exactly one for every edge in the tree.
Efficiency: Kinetic heaps are very efficient, with the number of internal events (certificate changes) being only a factor of O(log n) more than the number of external events. Specifically, for a collection of space-time trajectories where each pair intersects at most times, the kinetic tournament processes events in time, where is a Davenport-Schinzel sequence. Additionally, insertions and deletions cause O(logn) certificate changes each. Each certificate change takes O(logn) time, which is determined by the time required to execute the event queue update.
References
Basch, J. 1999. K |
https://en.wikipedia.org/wiki/Safa%20dan%20Marwah | Safa dan Marwah (Safa and Marwah) is an Indonesian TV serial that was aired on RCTI. It was produced video productions house public distributor company network by SinemArt directed by Desiana Larasati.
Cast
Nikita Willy as Safa
Risty Tagor as Marwah and Renita
Rionaldo Stockhorst as Ilham and Rizky
Citra Kirana as Atikah
Riza Shahab as Adil
Christian Sugiono as Farid
Melody Prima as Eva
Bobby Joseph as Ello
Mieke Amalia as Siti
Umar Lubis as Husein and Zainal and Boy
Moudy Wilhelmina as Ratna
Yadi Timo as Rajaf
Cut Memey as Zalimah
Inggrid Kansil as Ratih
Riyanto RA as Fikri
Epy Kusnandar as Kadir
Fadly as Rudi
El Manik as Kades
Donna Harun as Dita
Adjie Pangestu as Aji
Synopsis
Safa is a tomboy, yet beautiful girl. She is tough and very kind hearted. She lives with her mother, Siti, in a fishing village. Safa never realizes that Siti is not her real mother. All she knows is that she wants to help Siti to find her sister, Siti's daughter, who she misses dearly. Marwah on the other hand is a very gentle, beautiful, and religious rich girl. She is the typical girl whom every man adores. Marwah loves her family very much despite all their flaws. But she is not aware that actually they are not her biological family.
One day, Safa moves to Jakarta upon receiving her scholarship from a prestigious University. There she met Marwah, the idol of the whole campus. Friendship grows between them. Their closeness leads to Siti meeting Marwah in an occasion. The world beneath her feet trembles when Siti laid eyes on Marwah. Her motherly instinct kicks in, despite not knowing who Marwah actually is.
External links
Safa dan Marwah
Indonesian television series
2009 Indonesian television series debuts |
https://en.wikipedia.org/wiki/Hothouse%20Creations | Hothouse Creations was a UK computer game developer, founded in 1996. Their first game Gangsters: Organized Crime, sold over 500,000 copies worldwide.
In 2004, it was acquired by ZOO Digital The last game it developed was Crime Life: Gang Wars.
Notable games
Gangsters: Organized Crime (1998)
Abomination: The Nemesis Project (1999)
Cutthroats: Terror on the High Seas (1999)
Who Wants to Be a Millionaire? (1999)
Gangsters 2 (2001)
Casino, Inc. (2003)
American Idol / Pop Idol (2003)
Crime Life: Gang Wars (2005)
References
Defunct companies based in Bristol
Defunct video game companies of the United Kingdom
Video game companies established in 1996
Video game companies disestablished in 2007
Video game development companies |
https://en.wikipedia.org/wiki/Cinta%20dan%20Anugerah | Cinta dan Anugerah (Love and Blessing) is an Indonesian TV serial that was aired on RCTI. It was produced video productions house public distributor company network by SinemArt directed by Sanjeev Kumar.
Cast
Nabila Syakieb as Nabila/Yasmin
Ashraf Sinclair as Reza
Miller as Avian/Tengku Jamal
Eva Anindhita as Chintya
Yasmine Leeds Wildblood as Aira
Giovanni Yosafat Tobing as Gio
Richard Kevin as Alvino
Wilda Hamid as Mini
Raya Kohandi as Zaskia
Ibnu Jamil as Bima
Cut Sarah as Saira
Vonny Cornellya Permatasari as Harris
Asha Shara as Hani
Adipura as Harris
Teuku Mirza as Krisna
Marcell Darwin as Aldi
Luna Maya as Luna
Tri Ningtyas as Faridah
Keith Foo as Rama
Adjie Pangestu as Raffi
Amanda William as Amanda
Dirly as Bayu
Donny Damara as Imran
Hanna Hasyim as Halimah
Anna Tarigan as Sara
Kevin Julio as Soni
Synopsis
Nabila (Nabila Syakieb), a simple, kind, and beautiful girl, lives with her two sisters, Aira (Yasmine Wildblood) and Mini (Wilda Hamid). Despite the strong contrast in character, three of them always get along. Life hasn't been easy for them. They have to lose their only valuables, their house, to pay up their late father's debt. Their father only left them with a note saying that they have a relative named Reza (Ashraf Sinclair), a rich businessman. Their arrival was not well received by Reza. But after reading the note, a cold and handsome Reza accepted them into his house under one condition. They have to work.
Reza's sister, Saira (Cut Sarra), who also lives there with her children, Chintya (Eva Anindita), Ryan (Giovani L. Tobing) and Soni (Kevin Julio) were not too happy with Nabilla's arrival. Especially once they found out that Avian (Miller), Reeza's right hand man, was falling for Aira. Not only did Avian fell for Aira, but also so did Reza. Not knowing that in fact, Nabilla was secretly in love with Reza. But Nabilla can never break her sister's heart. How will her life turn out? Will she ever conquer Reza's heart?
External links
Cinta dan Anugerah
Indonesian television series |
https://en.wikipedia.org/wiki/Simons%20Institute%20for%20the%20Theory%20of%20Computing | The Simons Institute for the Theory of Computing at the University of California, Berkeley is an institute for collaborative research in theoretical computer science.
History
Established on July 1, 2012 with a grant of $60 million from the Simons Foundation, the Institute is housed in Calvin Lab, a dedicated building on the Berkeley campus. The Simons Institute brings together the leading researchers in theoretical computer science and related fields, as well as the next generation of outstanding young scholars, to explore deep unsolved problems about the nature and limits of computation.
Richard M. Karp was Founding Director of the Institute, and fellow Turing Award winner Shafi Goldwasser took over as Director on January 1, 2018.
Mission
The Institute aims to promote fundamental research on the foundations of computer science, as well as to expand the horizons of the field by exploring other scientific disciplines through a computational lens. This second and distinctive goal is motivated by the fact that natural phenomena in many scientific fields (including mathematics, statistics, physics, astronomy, biology and economics), or the models those fields have developed for these phenomena, are intrinsically computational in nature—from chemical processes in living cells to the self-organizing behavior of complex systems of interacting particles, to mechanisms governing human evolution and the collective behavior of competing agents in an economy. The insights gained from such explorations often reflect back to the theory of computation, opening new directions and advancing our understanding of fundamental issues in complexity theory and algorithms.
Activities
The Institute's core activities revolve around a rotating sequence of programs; a program typically runs for one semester, and there will usually be two concurrent programs each semester. Run by a small group of organizers, a program typically includes 60-70 long-term participants (a mix of senior and junior researchers), with additional short-term visitors attending workshops during the semester. Junior participants are supported by the Fellowships program.
Program topics are intended to span all areas of theoretical computer science, as well as its connections to other scientific disciplines; the Institute particularly aims to identify programs that can potentially lead to substantial advances in the field, rather than promoting "business as usual".
References
University of California, Berkeley
Research institutes in the San Francisco Bay Area
2012 establishments in California |
https://en.wikipedia.org/wiki/2012%E2%80%9313%20United%20States%20network%20television%20schedule%20%28late%20night%29 | These are the late night schedules for the four United States broadcast networks that offer programming during this time period, from September 2012 to August 2013. All times are Eastern or Pacific. Affiliates will fill non-network schedule with local, syndicated, or paid programming. Affiliates also have the option to preempt or delay network programming at their discretion.
Legend
Schedule
Monday-Friday
NOTE: On January 8, 2013, ABC moved Jimmy Kimmel Live! to 11:35 pm and moved Nightline to 12:35 am.
Saturday
NOTE: On July 27, 2013, Fox launched Animation Domination High-Def.
By network
ABC
Returning series
ABC World News Now
Jimmy Kimmel Live!
Nightline
CBS
Returning series
Late Night with David Letterman
The Late Late Show with Craig Ferguson
Up to the Minute
FOX
Returning series
Encore Programming
New series
Animation Domination High-Def
Not returning from 2011-12:
Q'Viva! The Chosen
NBC
Returning series
Last Call with Carson Daly
Late Night with Jimmy Fallon
Mad Money
Saturday Night Live
Today With Kathie Lee and Hoda
The Tonight Show with Jay Leno
References
United States late night network television schedules
Late
Late |
https://en.wikipedia.org/wiki/Burrowing%20Owl%20Conservation%20Network | Burrowing Owl Conservation Network is a United States-based, 501(c)(3) non-profit organization founded in 2008 and is dedicated to "the protection and restoration of burrowing owls and promot[ing] the preservation and careful management of habitat to prevent loss, foster healthy populations, and maintain intact natural communities for an ecologically sound future." The organization is active in California political intervention aimed at burrowing owl protection, and fundraising used for conservation, education and outreach, raptor research, and advocacy. The organization's efforts include habitat protection, ecosystem restoration, collaborations with private lands owners, government agencies and non-profit organizations, and installation of artificial burrows.
The organization was originally named "Friends of East Bay Owls" and its mission was focused on protecting burrowing owls and habitat in East Bay. The organization's mission and work has expanded throughout California and North America. The organization has offices in Visalia, Berkeley and Redding, California. The Burrowing Owl Conservation Network is a project of Earth Island Institute.
Conservation Strategy Petition
Burrowing Owl Conservation Network spearheaded a 2011 statewide petition for the "immediate development, release for public comment and implementation of a Comprehensive Conservation Strategy for Burrowing Owls." This petition was a joint project with Defenders of Wildlife and was signed by 22 other California organizations representing more than 209,000 Californians.
Earth Island Institute
Burrowing Owl Conservation Network was adopted by Earth Island Institute on July 24, 2010. Earth Island Institute provides Burrowing Owl Conservation Network with fiscal sponsorship and administrative support for their grassroots efforts.
References
External links
BurrowingOwlConservation.org
Environmental organizations based in California
Ornithological organizations in the United States
Environmental organizations established in 2008
2008 establishments in California |
https://en.wikipedia.org/wiki/List%20of%20programmes%20broadcast%20by%20Challenge | This is the list of programmes broadcast on the British television channel, Challenge.
Programming
Current programming made by Challenge
Former programming made by Challenge
Current programming originally shown by other broadcasters
Former programming originally shown by other broadcasters
Former programming shown on The Family Channel
External links
.
.
.
Notes
British television-related lists
Lists of television series by network |
https://en.wikipedia.org/wiki/ANLP | ANLP may refer to:
African Nutrition Leadership Programme
Association for Neuro Linguistic Programming |
https://en.wikipedia.org/wiki/The%20Mob%20Doctor | The Mob Doctor is an American television drama that aired on Fox from September 17, 2012, to January 7, 2013, as a part of the 2012–13 network television season. The series was created by Josh Berman and Rob Wright and is based on the book Il Dottore: The Double Life of a Mafia Doctor by Ron Felber. Berman, Wright, Michael Dinner, and Carla Kettner serve as executive producers.
On November 28, 2012, Fox cancelled the series after one season.
Premise
The series follows Grace Devlin, a surgical resident, who juggles her hospital duties with protecting her brother from the Mob. Grace works off her brother's debt by helping anyone they demand.
Cast
Main
Jordana Spiro as Grace Devlin; well-educated doctor surgical resident who took on her brother's debt to the mob.
William Forsythe as Constantine Alexander; returned Chicago Outfit boss and Grace's protector.
James Carpinello as Franco Leoni; Constantine's enforcer and Grace's ex-boyfriend. Undercover FBI agent working to bring down the Chicago mob.
Zach Gilford as Brett Robinson; Grace's boyfriend to whom she has to lie at times to protect her secrets.
Željko Ivanek as Stafford White, Chief of Surgical Department; supervises Grace, favors her as a promising surgeon.
Floriana Lima as Rosa "Ro" Quintero; nurse at the hospital and friend of Grace.
Jaime Lee Kirchner as Olivia Watson; rival doctor working in the same surgical unit residency as Grace.
Wendy Makkena as Daniella Devlin, mother of Grace and Nate; she has a history with Constantine.
Jesse Lee Soffer as Nate Devlin, Grace's brother; owed a debt to mob boss Paul Moretti but his sister took it on for him. Works in Constantine's crew after Moretti is overthrown.
Recurring
Michael Rapaport as Paul Moretti, former leader of the mob until Constantine takes over.
David Pasquesi as Ian Fanagan, a senior colleague of Grace's, who Grace frequently disagrees with.
Kevin J. O'Connor as Stavos Kazan, personal attorney to and consigliere of Constantine's mob family.
Adam J. Harrington as Owen York, an FBI agent investigating Constantine.
Shohreh Aghdashloo as Jayana Baylor, a senior doctor at the hospital.
Kevin Corrigan as Titus Amato, an acquaintance of Constantine and new business partner in the poker machine business.
Terry Kinney as Donte Amato, brother of Titus, friend of Constantine, and knew Grace's father.
Jennifer Beals as Celeste LaPree, a madame standing as a proxy for a mob boss in Constantine's underground circle.
Mike Starr as Al Trapani, a member of Constantine's underground circle.
Michael Madsen as Russell King, an associate of one of Constantine's former rivals, who attempted to take over Downtown Chicago, before being out-muscled by Constantine.
Production
On May 9, 2012, Fox placed a series order for the drama for the 2012–13 television season.
In production, a working title for the show was Dirty Medicine.
Episodes
{{Episode table |background=#26466D |overall= |title= |director= |writer= |airdate= |viewers= |c |
https://en.wikipedia.org/wiki/IEEE%201680 | IEEE 1680 is a family of IEEE sustainability standards dealing with the assessment of environmental performance of electronic products.
IEEE 1680 is the de facto standard for green computing at the desktop level.
As of April 2020, the 1680 family of standards consists of:
1680.1 – Standard for the environmental and social responsibility assessment of computers, tablets and monitors.
1680.2 – Standard for the environmental assessment of Imaging Equipment (printers, copiers, scanners, fax machines, multifunction devices...).
1680.3 – Standard for the environmental assessment of televisions.
The 1680.4 standard for Servers and the 1680.6 standard for Complex Set Top Boxes were in development but 1680.4 failed in ballot and was superseded by NSF 426. 1680.6 never passed ballot and was archived.
References
https://global.ihs.com/doc_detail.cfm?document_name=NSF%20426&item_s_key=00728331
External links
Official IEEE webpage for the IEEE 1680 Family of Standards (discontinued)
Official IEEE webpage for the IEEE 1680.1-2018 standard
Official IEEE webpage for the IEEE 1680.2-2012 standard
Official IEEE webpage for the IEEE 1680.3-2012 standard
Computers and the environment
IEEE standards |
https://en.wikipedia.org/wiki/Cloudberry%20Kingdom | Cloudberry Kingdom is a platform game created by Pwnee Studios. The game uses a set of algorithms developed by Jordan Fisher to create procedurally generated levels that can be adaptive to player skill level, in game character abilities, and alteration of game physics.
Cloudberry Kingdom is a downloadable title for Microsoft Windows, PlayStation 3, Wii U and Xbox 360.
Reception
The PlayStation 3 and Wii U versions received "generally favorable reviews", while the Xbox 360 and PC versions received "average" reviews, according to the review aggregation website Metacritic.
Delisting
In May 2020, the game's publisher, Ubisoft, delisted Cloudberry Kingdom on Steam with no announcement. Pwnee Studios did not comment.
References
External links
2013 video games
Cancelled Linux games
Cancelled macOS games
Cancelled PlayStation Vita games
Indie games
Kickstarter-funded video games
Multiplayer and single-player video games
PlayStation 3 games
PlayStation Network games
PlayStation Vita games
Ubisoft games
Video games developed in the United States
Video games using procedural generation
Wii U eShop games
Windows games
Xbox 360 Live Arcade games |
https://en.wikipedia.org/wiki/Courcelle%27s%20theorem | In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and independently rediscovered by .
It is considered the archetype of algorithmic meta-theorems.
Formulations
Vertex sets
In one variation of monadic second-order graph logic known as MSO1, the graph is described by a set of vertices and a binary adjacency relation , and the restriction to monadic logic means that the graph property in question may be defined in terms of sets of vertices of the given graph, but not in terms of sets of edges, or sets of tuples of vertices.
As an example, the property of a graph being colorable with three colors (represented by three sets of vertices , , and ) may be defined by the monadic second-order formula
with the naming convention that uppercase variables denote sets of vertices and lowercase variables denote individual vertices (so that an explicit declaration of which is which can be omitted from the formula). The first part of this formula ensures that the three color classes cover all the vertices of the graph, and the rest ensures that they each form an independent set. (It would also be possible to add clauses to the formula to ensure that the three color classes are disjoint, but this makes no difference to the result.) Thus, by Courcelle's theorem, 3-colorability of graphs of bounded treewidth may be tested in linear time.
For this variation of graph logic, Courcelle's theorem can be extended from treewidth to clique-width: for every fixed MSO1 property , and every fixed bound on the clique-width of a graph, there is a linear-time algorithm for testing whether a graph of clique-width at most has property . The original formulation of this result required the input graph to be given together with a construction proving that it has bounded clique-width, but later approximation algorithms for clique-width removed this requirement.
Edge sets
Courcelle's theorem may also be used with a stronger variation of monadic second-order logic known as MSO2. In this formulation, a graph is represented by a set V of vertices, a set
E of edges, and an incidence relation between vertices and edges. This variation allows quantification over sets of vertices or edges, but not over more complex relations on tuples of vertices or edges.
For instance, the property of having a Hamiltonian cycle may be expressed in MSO2 by describing the cycle as a set of edges that includes exactly two edges incident to each vertex, such that every nonempty proper subset of vertices has an edge in the putative cycle with exactly one endpoint in the subset. However, Hamiltonicity cannot be expressed in MSO1.
Labeled graphs
It is possible to apply the same results to graphs in which the vertices or edges have labels from a fixed finite set, either by augmenting the gr |
https://en.wikipedia.org/wiki/INK%20%28operating%20system%29 | INK (for I/O Node Kernel) is the operating system that runs on the input output nodes of the IBM Blue Gene supercomputer. INK is a Linux-derivative.
See also
Compute Node Linux
Timeline of operating systems
Rocks Cluster Distribution
Cray Linux Environment
References
Linux kernel variant
Supercomputer operating systems |
https://en.wikipedia.org/wiki/Freebase | Freebase may refer to:
Free base or freebase, the pure basic form of an amine, as opposed to its salt form
Freebase (database), a former online database service
Freebase (mixtape), 2014 mixtape by 2 Chainz
An original song by the Mike Flowers Pops on their 1996 LP "A Groovy Place"
See also
Freebass, a musical supergroup
Free-bass accordion, a bellows instrument |
https://en.wikipedia.org/wiki/Kinetic%20sorted%20list | A kinetic sorted list is a kinetic data structure for maintaining a list of points under motion in sorted order. It is used as a kinetic predecessor data structure, and as a component in more complex kinetic data structures such as kinetic closest pair.
Implementation
This data structure maintains a list of the elements in sorted order, with the certificates enforcing the order between adjacent elements. When a certificate fails, the concerned elements are swapped. Then at most three certificates must be updated, the certificate of the swapped pair, and the two certificates involving the swapped elements and the elements of the sorted list which directly precede and follow the swapped pair.
For example, given a sorted list {A,B,C,D,E,F}, the certificates will be [A<B], [B<C], [C<D], [D<E], [E<F]. If the certificate [C<D] fails, the list will be updated to {A,B,D,C,E,F}, and the certificates [B<C], [C<D], and [D<E], will be replaced with [B<D], [D<C], and [C<E], respectively. The new set of certificates will be [A<B], [B<D], [D<C], [C<E], [E<F]
Analysis
This kinetic data structure is:
Responsive: a certificate failure causes one swap (which takes O(1) time) and O(1) certificate changes which take O(log n) time to reschedule
Local: every element is involved in at most 2 certificates
Compact: there are exactly certificates for a list of elements
Efficient: this data structure causes no extraneous internal events, every change in the ordering of the elements causes exactly one certificate failure.
Generalization
This data structure can be generalized to a kinetic data structure which can return a sorted list of points in time and processes events total, assuming pseudo algebraic trajectories, where is a parameter of the data structure. Thus, a maintenance-time versus query-time tradeoff can be made to tune to specific applications.
In the generalized data structure, the points are partitioned arbitrarily into m subsets of size , and kinetic sorted lists are maintained on the subsets. Each sorted sublist needs to process events (certificate failures) maximum, since there are swaps of each of the pairs of elements. Thus the total time required to maintain the data structure is . Requests for the sorted list can then be answered in by merging the sorted sublists with mergesort.
References
.
Kinetic data structures |
https://en.wikipedia.org/wiki/List%20of%20GMA%20Network%20original%20drama%20series | This is the list of Philippine television drama series that originally aired or are set to air on GMA Network. Titles are sorted in the decade and the year of release, with the official international title included in parentheses.
1980s
1990s
1994
1995
1996
1997
1998
1999
2000s
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010s
2010
2011
2012
2013
2014
2015
2016
{| class="wikitable sortable" width="100%"
! style="width:60%;" | Title
! style="width:20%;" | Premiere
! style="width:20%;" | Finale
|-
| Wish I May
| January 18, 2016
| May 20, 2016
|-
| That's My Amboy
| January 25, 2016
| April 29, 2016
|-
| Hanggang Makita Kang Muli
| March 7, 2016
| July 15, 2016
|-
| The Millionaire's Wife
| March 14, 2016
| June 24, 2016
|-
| Poor Señorita
| March 28, 2016
| July 15, 2016
|-
| Naku, Boss Ko!
| April 25, 2016
| May 5, 2016
|-
| Once Again
| May 2, 2016
| July 22, 2016
|-
| Juan Happy Love Story
| May 16, 2016
| September 2, 2016
|-
| Magkaibang Mundo
| May 23, 2016
| September 16, 2016
|-
| Calle Siete
| June 13, 2016
| October 21, 2016
|-
| Sa Piling ni Nanay | June 27, 2016
| January 27, 2017
|-
| Sinungaling Mong Puso
| rowspan="2" | July 18, 2016
| October 28, 2016
|-
| Encantadia| May 19, 2017
|-
| Someone to Watch Over Me| September 5, 2016
| January 6, 2017
|-
| Oh, My Mama!| rowspan="2" | September 19, 2016
| December 2, 2016
|-
| Alyas Robin Hood
| November 24, 2017
|-
| Trops| October 24, 2016
| September 22, 2017
|-
| Hahamakin ang Lahat
| October 31, 2016
| February 17, 2017
|-
| Ika-6 na Utos
| December 5, 2016
| March 17, 2018
|}
2017
2018
2019
2020s
2020
2021
2022
2023
2024
Unaired
Boys Over Flowers Captain Barbell Meets Darna Familia de Honor Haram L.U.V. Pow Mrs. Snow White Rosang Agimat Sanggang Dikit Sine Novela's Ang Pinakamagandang Hayop sa Balat ng Lupa Sine Novela's Bakit Kay Tagal ng Sandali? Sine Novela's Muling Buksan ang Puso''
See also
List of Philippine drama series
References
GMA Network original drama series
GMA Network
Original drama series of GMA Network |
https://en.wikipedia.org/wiki/Mastiii | Mastiii is a Hindi language free to air music television channel. owned by Sri Adhikari Brothers Television Network Ltd. it was among the top five channels in the Hindi music category after just one month of launch. Mastiii Bollywood music channel also available on DD Free dish DTH at channel number 62.
Programs
Love Kal Aaj aur Kal
Evergreen Hits
Hit Hai Toh Bajega
Just Mohabbat
Mastiii Doubles
Raat Ke Humsafar
The Golden Era with Annu Kapoor
Morning Masti
Hit Melodies
References
External links
Official website
Music television channels in India
Television stations in Mumbai
Indian music mass media
Hindi-language television channels in India
Television channels and stations established in 2001
Sri Adhikari Brothers Television |
https://en.wikipedia.org/wiki/German%20Climate%20Computing%20Centre | The German Climate Computing Centre (Deutsches Klimarechenzentrum, DKRZ) is a central service center for the German climate research and Earth system research. It operates high performance computing for applied and basic research in climate science and related disciplines. The main task of the DKRZ is to provide computing power and technical support for models and simulations of climate research.
The group commissioned a new supercomputer made by French company Atos in March 2022.
Organization
The main shareholders of the German Climate Computing Centre are the Max Planck Society (55%) and the City of Hamburg (27%, represented by Hamburg University). Other partners are the Alfred Wegener Institute for Polar and Marine Research (9%) and the Helmholtz Centre in Geesthacht (9%, Helmholtz-Zentrum Hereon GmbH, hereon). The DKRZ is sponsored by the Federal Ministry for Education and Research. The German Climate Computing Centre is one of four partners within the Cluster of Excellence CliSAP and member of the network KlimaCampus Hamburg.
External links
Home page of the German Climate Computing Centre
References
Supercomputer sites
Governmental meteorological agencies in Europe
Meteorological organisations based in Germany
Organisations based in Hamburg |
https://en.wikipedia.org/wiki/Beier%E2%80%93Neely%20morphing%20algorithm | Image morphing is a technique to synthesize a fluid transformation from one image (source image) to another (destination image). Source image can be one or more than one images. There are two parts in the image morphing implementation. The first part is warping and the second part is cross-dissolving.
The algorithm of Beier and Neely is a method to compute a mapping of coordinates between 2 images from a set of lines; i.e., the warp is specified by a set of line pairs where the start-points and end-points are given for both images. The algorithm is widely used within morphing software.
Also noteworthy, this algorithm only discussed about the situation with at most 2 source images as there are other algorithms introducing multiple source images.
See also
Morphing
Image warping
Image processing
References
External links
Description of the algorithm by Evan Wallace of Brown University
Computer graphics algorithms |
https://en.wikipedia.org/wiki/Saffron%20Technology | Saffron Technology, Inc., is a technology company headquartered in Cary, North Carolina, that develops cognitive computing systems that use incremental learning to understand and unify by entity (person, place or thing) the connections between an entity and other “things” in data, along with the context of their connections and their raw frequency counts. Saffron learns from all sources of data including structured and unstructured data to support knowledge-based decision making. Its patented technology captures the connections between data points at the entity level and stores these connections in an associative memory. Similarity algorithms and predictive analytics are then combined with the associative index to identify patterns in the data. Saffron’s Natural Intelligence platform was utilized across industries including manufacturing, energy, defense and healthcare, to help decision-makers manage risks, identify opportunities and anticipate future outcomes, thus reducing cost and increasing productivity. Its competitors include IBM Watson and Grok. Intel purchased the company in 2015, then shuttered it less than 3 years later.
History
Saffron was founded in 1999 by Dr Manuel Aparicio, and Mr. James Fleming.
In 2000, former National Security Advisor Admiral (Dr.) John Poindexter joined the board with a focus of applying Associative Memory technology in the fields of National Security and Intelligence.
In the first years, the company did most of its work with the U.S. Department of Defense, including in Iraq, analyzing and predicting where IED’s would be located so insurgent bombers could be proactively targeted.
In 2010, the analyst firm Gartner identified Saffron as a "Cool Vendor" in Information Infrastructure for Enterprise Information Management
In 2011, Forrester Research highlighted Saffron Technology as the leader of associative indexing in "The Dawning of a New Age in BI DBMS".
On March 3, 2014 Saffron Technology raised a round of Series B funding.
In October 2015, Intel bought Saffron Technology for an undisclosed price. Intel offered the licensed software with engineering services contracted to develop client applications and support ongoing use.
In August 2018, Intel discontinued the Saffron software offering and supporting engineering services. Intel never issued a press release; it either reassigned or laid off all supporting staff and redirected the original URL to one that does not acknowledge Saffron's existence.
Executives
Gayle Sheppard, chairman and chief executive officer; former executive at PeopleSoft, Pleasanton, CA. and J.D. Edwards and Company, Denver, CO.
Manuel Aparicio, Ph.D., chief memory maker and evangelist, former chief scientist at IBM Knowledge Management and Intelligent Agent Center, Raleigh, NC.
James Fleming, chief software engineer, former software developer at IBM Knowledge Management and Intelligent Agent Center, Raleigh, NC.
Toufic Boubez, Ph.D., chief technology officer, former SOA archi |
https://en.wikipedia.org/wiki/Personal%20public%20transport | Personal public transport (PPT) is a network of private rental vehicles for users to drive, distributed at fixed locations throughout an area and available to the general public in such a way that each user has the ability to determine the route and schedule on a self-service basis (without advance prebooking). The design of a PPT system encourages utility (usually trips) over revenue.
Overview
While most public transport systems operate on specific routes with set timetables, PPT systems utilize a network of vehicles at various locations for users when they desire them, allowing those users to take any route that serves their needs and to return the vehicle to any designated point within the coverage area. The user operates or directs, in an auto-drive vehicle, the vehicle to the destination versus this being done by a driver or conductor in traditional public transport options. Similar to traditional public transport options, the system is managed by a transit authority or private transport operator but the pricing model encourages users to return the vehicle quickly. Maximizing vehicle utility over revenue means operators seek revenue from other sources such as advertising, subsidy and system sponsorship.
Terminology
Personal public transport was conceptualized to explain the unique difference in service provided over traditional public transport options such as bus, rail, taxi and rapid transit as well as paratransit and personal rapid transport.
Coverage area
Instead of utilizing routes, in the way that traditional public transport does, a PPT system operates within a defined area, termed the coverage area. Vehicles can be found or left anywhere the law allows within that area or at specific locations within the coverage area. Examples of specific locations can be public or private demarcated areas shared with other vehicles or specific station locations.
Vehicles and services
The vehicle is designed to cater to an individual user or a small party's transport needs (not shared with strangers for the rental duration like public transport). The vehicles are intended for a single trip on public thoroughfares either shared by other modes or segregated. The user is responsible for adhering to all laws and regulations while using the vehicle and enforcement is done through existing public law enforcement mechanisms such as licensing and ticketing.
Access to PPT
While a PPT is a general public transport service not requiring advance prebooking, it generally requires users to be registered with the system or to pay a deposit to ensure the return of the vehicle in good working condition. The tipping point of successful PPT systems has been the application of information technology systems (ITS) enabling user identification and vehicle tracking in a system. This is usually aided by Radio Frequency Identification Devices (RFID) and real-time information flow using wireless internet. GPS tracking devices are also common in vehicles to guard against |
https://en.wikipedia.org/wiki/Golan%20Telecom | Golan Telecom () is a telecommunication provider and mobile network operator in Israel. It was founded in 2010 and offers a range of mobile phone, telecommunications and internet services to residential and business customers. In July 2011 the company won a tender to operate a 3G wireless network in Israel beginning in 2012, The company was one of the first low-cost mobile phone companies that led to increased competition in the cellular communications market in Israel, due to the price policy adopted by the company at the beginning of its activity.
History
The company was founded by Michael Golan (b. Michaël Boukobza, Paris, France, 1978), a businessman who immigrated to Israel from France in 2007, and his partner Xavier Niel – with whom Golan previously developed several telecom ventures as an executive of the Iliad SA group in France, using a business model emphasizing low-cost fixed monthly pricing rather than metered usage.
Golan Telecom is the fifth operator to enter the mobile communications market in Israel, after Pelephone, Cellcom, Partner and Hot Mobile, and is the first brand new company to do so in Israel since 1999. The company received the prefix 058 and on 14 May 2012 began offering no-contract packages of calls (including free long-distance calling to certain international destinations), text messages and unlimited Internet surfing for ₪99 a month and a low-cost metered package starting at ₪9.90 a month which includes 100 minutes, unlimited text messages, and 100 MB of data.
At the beginning of July 2012 Golan announced 80,000 users in two months, equaling 10,000 new customers per week. On 4 December 2013 Golan Telecom claimed 380,000 subscribers, a 134,000 increase from the start of the year. On 30 June 2014 this number grew to 500,000 subscribers, and in May 2015 it hit 750,000 subscribers. At the end of 2016, Golan's subscriber base reached 900,000.
Golan Telecom built its business around the somewhat blunt and unusual slogan, "Enough of being a sucker," which is currently shown as part of its logo. The direct approach in choosing such slogan arose from the frustration of Israeli consumers with the high cost of living in Israel, with cellular communication rates in particular, and as a means of empathy with consumers. Indeed, upon their introduction, Golan's rates were significantly lower than those offered by the existing wireless providers in the country and quickly forced the other providers to drastically reduce their prices, thus providing a boon to many Israeli wireless telephone subscribers. Iliad SA had previously made similar market-disrupting moves in the telecom sector in France.
Network
In December 2011 Golan Telecom signed agreements to install base-stations manufactured by Nokia Siemens Networks. Its network is an HSPA+ network in the 2100 MHz band, with roaming in areas not yet covered. Roaming was first carried by Cellcom's 1800 MHz GSM and 2100 MHz HSPA+ network, then moved to Hot Mobile's network, whic |
https://en.wikipedia.org/wiki/Frankfurt-Sindlingen%20station | Frankfurt-Sindlingen station is a suburban station on the network of the Rhine-Main S-Bahn in the district of Sindlingen in the German city of Frankfurt. The station is classified by Deutsche Bahn as a category 5 station.
Location
The S-Bahn station is located in the centre of the Frankfurt district of Sindlingen in the state of Hesse. The station is located where the main street of the suburb, Sindlinger Bahnstraße, passes under the Taunus Railway (). To the north of the platform is a municipal building called the Haus Sindlingen ("Sindlingen House"), which is used as a community centre and library. It was used for a trial of members of the Red Army Faction, including Astrid Proll, in 1973–74.
History
In the 19th century the northern and central parts of Sindlingen were undeveloped. The rural town had just 750 inhabitants. The Taunus Railway, which was opened between Höchst and Hattersheim on 24 November 1839, ran through this area and crossed the highway to Zeilsheim (now called Sindlinger Bahnstraße, literally "Sindlingen railway street"). The progressive industrialisation of the area, in particular the growth of the factories of Hoechst AG, caused considerable population growth in Sindlingen and the surrounding villages. Eventually stations would be built in the district on the Taunus Railway and the Main-Lahn Railway, which was opened a little further north in 1877, although the northern station was not completed for more than a century.
In 1893, the station was opened with the name of Sindlingen-Zeilsheim at the level crossing on Sindlinger Bahnstraße. The station building was replaced by a new one in 1968, which, however, was completely burned down on 29 February 1984 after an explosion. In 1974, the Frankfurter Verkehrs- und Tarifverbund (Frankfurt Transport and Fares Association, the predecessor of the Rhein-Main-Verkehrsverbund) introduced S-Bahn-like operations on the line, operating as line R 1; this was replaced by line S 1 in 1978. A major change came in 1980 when the level crossing was replaced by an underpass.
In 2007, the long-planned Frankfurt-Zeilsheim station was opened on the Main-Lahn Railway, 500 metres further north, also on Sindlinger Bahnstraße.
Design
The architecture of the station is similar to the Frankfurt-Nied station. In contrast, however, the northern and southern platforms are on the opposite sides of Sindlinger Bahnstraße. Access to the platforms is via a pedestrian underpass that crosses the railway tracks parallel with and at the same level as the road underpass. In order to cross the road there are two pedestrian overbridges that run parallel on either side of the railway bridge. As well as the main entrances from Sindlinger Bahnstraße, there are additional external entrance from park and ride car parks.
The platforms built after the old station building was destroyed in 1984 are very austere, but the so-called “DB-Plus” point provides waiting passengers with a shelter.
Operations
The only trains th |
https://en.wikipedia.org/wiki/Pasi%C3%B3n%20prohibida | Pasión Prohibida () is a Spanish-language romantic drama telenovela produced by United States-based television network Telemundo Television Studios, Miami. It is a remake of the Turkish telenovela Aşk-ı Memnu by Ece Yörenç and Melek Gençoğlu. It has been adapted from Halit Ziya Uşaklıgil's novel Aşk-ı Memnu, published in 1900, but takes place in the modern-day Miami, instead of the novel's late 19th-century Istanbul setting. Jencarlos Canela and Mónica Spear starred as the protagonists. Although Telemundo announced a second season, Spear's 2014 murder brought an end to production.
United States broadcast
Telemundo aired the serial during the 2013 season. From January 22, 2013 to June 21, 2013, Telemundo aired Pasión Prohibida weeknights at 8 pm/7c, replacing Rosa Diamante. Dama y Obrero replaced Pasión Prohibida on June 24, 2013. As with most of its other telenovelas, the network broadcast English subtitles as closed captions on CC3.
Cast
Main
Recurring
Awards and nominations
References
External links
Summary of the novel Aşk-ı Memnu at turkishauthors.com
Official song of the telenovela
2013 American television series debuts
2013 American television series endings
Spanish-language American telenovelas
Telemundo telenovelas
2013 telenovelas
Non-Turkish television series based on Turkish television series |
https://en.wikipedia.org/wiki/EUR-ACE%20label | The EUR-ACE (European Accredited Engineer) Label is a certificate of quality awarded to degree programmes in Engineering.
The EUR-ACE label is awarded after authorization from the European Network for Accreditation of Engineering Education (ENAEE). ENAEE grants this authorization to agencies that accredit degree programmes in Engineering in accordance with the European Qualifications Framework (EQF) standards and with ENAEE standards.
Agencies authorised to award the EUR-ACE label
As of January 2019, the agencies authorised to award the EUR-ACE label are as follows:
Finland – FINEEC – Kansallinen Koulutuksen Arviointikeskus Karv
France – CTI Commission des titres d'ingénieur
Germany – ASIIN – Fachakkreditierungsagentur für Studiengänge der Ingenieurwissenschaften, der Informatik, der Naturwissenschaften, und der Mathematik
Ireland – Engineers Ireland
Italy – Quacing – Agenzia per la Certificazione di Qualità e l’Accreditamento EUR-ACE dei Corsi di Studio in Ingegneria
Kazakhstan – KazSEE – Kazakhstan Society for Engineering Education
Poland – KAUT – Accreditation Commission of Universities of Technology
Portugal – OE Ordem dos Engenheiros
Romania – ARACIS – The Romanian Agency for Quality Assurance in Higher Education
Russia – AEER – Association for Engineering Education of Russia
Slovakia – ZSVTS – Association of Slovak Scientific and Technological Societies
Spain – ANECA/ IIE – National Agency for Quality Assessment and Accreditation of Spain, with Instituto de la Ingeniería de España
Switzerland – AAQ – Agence Suisse d'Accréditation et d'Assurance Qualité
Turkey – MÜDEK – Association for Evaluation and Accreditation of Engineering Programmes
United Kingdom – Engineering Council
EUR-ACE labelled programmes
As of January 2019, the EUR-ACE label has been awarded to about 3,000 engineering degree programmes in 35 countries both within and outside of Europe.
References
Engineering education
Higher education accreditation
Professional certification in engineering
Education in Europe |
https://en.wikipedia.org/wiki/Conference%20on%20Computer%20Communications | The IEEE Conference on Computer Communications (INFOCOM) addresses key topics and issues related to computer communications, with emphasis on traffic management and protocols for both wired and wireless networks.
The first INFOCOM conference took place in the United States in Las Vegas, Nevada, in 1982. Since then it was held in many locations around the world, including China, Japan, Israel, Italy, Spain, Brazil, as well as many other regions of the United States.
References
External links
IEEE INFOCOM
Computer conferences |
https://en.wikipedia.org/wiki/Parks%20and%20Recreation%20%28season%205%29 | The fifth season of Parks and Recreation originally aired in the United States on the NBC television network, from September 20, 2012 and concluded on May 2, 2013. This season consisted of 22 episodes. It stars Amy Poehler, Rashida Jones, Aziz Ansari, Nick Offerman, Aubrey Plaza, Chris Pratt, Adam Scott, and Rob Lowe, with supporting performances from Jim O'Heir and Retta.
Season 5 focuses on Leslie Knope (Amy Poehler) and her staff at the parks and recreation department of the fictional Indiana town of Pawnee. Although not having an overarching storyline like Season 4, this season details the aftermath of Leslie's role as a Councilwoman in Pawnee, and her rivalry with councilman Jeremy Jamm (Jon Glaser). Other storylines include Ben Wyatt (Adam Scott) and April Ludgate (Aubrey Plaza)'s career move to Washington D.C., Ann Perkins (Rashida Jones)'s attempts to get pregnant, the progress in Ben and Leslie's relationship, Andy's attempts at becoming a police officer, and Ron Swanson (Nick Offerman) meeting single mother Diane (Lucy Lawless).
Cast
Main
Amy Poehler as Leslie Knope, is a council woman for the town of Pawnee, with a strong love of her home town, who has not let politics dampen her sense of optimism; her ultimate goal is to become President of the United States. Poehler departed from the NBC sketch comedy series Saturday Night Live, where she was a cast member for nearly seven years, to star in Parks and Recreation. It was only after she was cast that Daniels and Schur established the general concept of the show and the script for the pilot was written.
Rashida Jones as Ann Perkins, a nurse and political outsider who becomes Leslie's best friend and also becomes more involved in Pawnee government through her friendship with Leslie.
Aziz Ansari as Tom Haverford, Leslie's sarcastic and underachieving subordinate who seeks to present himself as extremely hip and trendy and always has a scheme in the works.
Nick Offerman as Ron Swanson, the deadpan parks and recreation director who, as a libertarian, believes in as small a government as possible. As such, Ron strives to make his department as ineffective as possible, and favors hiring employees who do not care about their jobs or are poor at them. Nevertheless, Ron consistently demonstrates that he secretly cares deeply about his fellow co-workers.
Aubrey Plaza as April Ludgate, a cynical and uninterested parks department intern who eventually becomes the perfect assistant for Ron, but leaves the department with Ben Wyatt.
Chris Pratt as Andy Dwyer, a goofy and dim-witted but lovable slacker; he is April's husband.
Adam Scott as Ben Wyatt, Leslie's boyfriend, and later husband, who leaves Pawnee for Washington, D.C., to join a political campaign.
Rob Lowe as Chris Traeger, an excessively positive and extremely health-conscious government official.
Starring
Jim O'Heir as Jerry Gergich, a sweet-natured but painfully incompetent longtime city employee who is the main target of the |
https://en.wikipedia.org/wiki/APIM | APIM may refer to:
API Management (Computer Science); a way to create API (application programming interface) gateways for back-end services using products such as Apigee, Azure API Management, TIBCO Mashery, Mulesoft, WSO2, AWS API Gateway.
OCP-APIM, an open-source API Management developed by Microsoft and the Open Compute Project
AEEC (Airlines Electronic Engineering Committee) Project Initiation/Modification
Asia Pacific Institute of Management
Ford Sync, Accessory Protocol Interface Module
Lille Metropole Development Agency |
https://en.wikipedia.org/wiki/Harry%20Gschoesser | Harald "Harry" Gschoesser (born July 25, 1961) is an Austrian entrepreneur and musician. He is the founder of the social network for musicians, Speedgig. He is also a former band drummer of Racer X, which is an American heavy metal band based out of Los Angeles, and former drummer of Austrian rock bands No Bros and Speedy Weekend Band.
Early life
Gschoesser was born in Tirol, Austria. He started playing the drums at the late age of 17. He first attracted the attention of the Austrian band, Scream, with Andy Woerz, who later became an Austrian actor and singer. In 1981, Gschoesser started drumming for the Speedy Weekend Band, which became the most popular heavy metal band in Austria at that time. Playing all over Austria, they also opened for Eric Burdon, Roger Chapman, and others during their Austrian tour.
History with No Bros
After the Speedy Weekend Band broke up, Gschoesser was picked up by No Bros in 1983, an Austrian rock band. Managed by Gotthard Rieger, the band started recording later that year and released the album Our Own Way. In subsequent years, No Bros went on European tours with other bands such as Saxon, Samson, Girlschool, and Ginger Baker and Band, who was the former drummer of Cream.
Racer X
In 1985, Gschoesser moved to Los Angeles and enrolled at the Musicians Institute, where he met fellow students and future Racer X bandmates Paul Gilbert and Juan Alderete. Later that year, Paul Gilbert, who later helped form the popular band Mr. Big, asked Gschoesser to be his drummer for Racer X. Soon after, Juan Alderete, came on as the bass player and later Jeff Martin as their singer. Gilbert entered in a Guitar competition, Guitar Wars, with Gschoesser and Alderete at Gazzarries on the Sunset Strip. Racer X won the competition.
The band started their recording process at Sun Parrier studio near San Francisco in 1985. Since Gschoesser was only on a student visa, he was not allowed to record. The band received legal permission for Gschoesser to work for 24 hours. This allowed Gschoesser to record his drum sequence, while the rest of the band finished up the record in two weeks. After, Racer X released its debut album Street Lethal on January 1, 1986, on Mike Varney's Shrapnel Records label.
Gschoesser left the band. Guitarist Bart Walsh, former member of David Lee Roth Band, connected Gschoesser with the American band Icebreaker. Gschoesser replaced the drummer, Eric Singer. The band performed at Los Angeles nightclubs The Roxy and Whisky a Go Go.
After three years in Los Angeles, Gschoesser returned to Austria when his visa expired.
Speedgig
Back in Austria in 2011, Gschoesser started Speedgig, a social network that allows musicians from all over the world to connect with each other and gain access to the music industry.
Personal life
Gschoesser resides in Austria with his wife and two children.
Discography
Racer X
Street Lethal (1986)
No Bros
1983: Our Own Way (LP/MC)
1983: Hey You (Single)
1983: Princess of My Town (S |
https://en.wikipedia.org/wiki/Pictures%20of%20You%20%28TV%20series%29 | Pictures of You is an Australian talk show program that aired on the Seven Network on 27 March 2012. It was hosted by Brian Nankervis in front of a studio audience and was produced by Working Dog Productions. This interview-style series features well-known personalities who share their old photos, along with personal stories from their formative years.
In March 2013, the series was cancelled after not being renewed for a second season.
Personalities who appeared on the show included Anh Do, Cal Wilson, Carl Barron, Frank Woodley, Denise Scott, Julia Morris, Peter Helliar, Ross Noble, Russell Gilbert and Shane Jacobson.
References
Seven Network original programming
Australian television talk shows
2012 Australian television series debuts
English-language television shows |
https://en.wikipedia.org/wiki/Caldera%20%28film%29 | Caldera is an 11-minute computer-animated short film released in 2012. It was directed by Evan Viera, co-written by Chris Bishop, co-produced by Chris Perry, and created in conjunction with Bit Films, the computer animation incubator program at Hampshire College in Amherst, Massachusetts.
Caldera received a Prix Ars Electronica Award of Distinction in the Computer Animation category in 2012.
Plot
Caldera is about a young girl who goes off her medication and leaves a bleak metropolis to immerse herself in a vibrant oceanic cove. Ultimately, the story is about the young girl's impossible predicament, where she can not live in either the fantastical and haunting world of psychosis or in the marginalizing society that mandates her medication.
Awards
2012
Prix Ars Electronica – Award of Distinction (Computer Animation)
Seattle International Film Festival - Award of Innovation
Rome Independent Film Festival - Best Short Animation
References
External links
2012 films
Computer-animated short films
Animated films without speech
American animated short films
2012 animated films
2010s animated short films
2010s American animated films
2012 short films
2010s English-language films
Films about mental disorders |
https://en.wikipedia.org/wiki/Small%20cell%20%28disambiguation%29 | A small cell is the radio access node that make up a cellular network that has a cell size between 10 meters to 2 kilometers.
Small cell may also refer to:
Small-cell carcinoma, a type of highly malignant cancer that most commonly arises within the lung
Small cell melanoma, a tumor that contains variably-sized, large nests of small melanocytes with hyperchromatic nuclei and prominent nucleoli
B-cell chronic lymphocytic leukemia, the most common type of leukemia and a stage of small lymphocytic lymphoma
See also
Large cell |
https://en.wikipedia.org/wiki/Wild%20date%20palm | Wild date palm is a common name for several plants and may refer to:
Senegal data palm, Phoenix reclinata
Silver date palm, Phoenix sylvestris |
https://en.wikipedia.org/wiki/Business%20reporting | Business reporting or enterprise reporting refers to both "the public reporting of operating and financial data by a business enterprise," and "the regular provision of information to decision-makers within an organization to support them in their work."
Business reporting is a fundamental part of the larger movement towards improved business intelligence and knowledge management. It also involves the smooth transfer of information from lower management to the bord of decision makers in the business co-operation or company hence reducing the resistance that would otherwise be there for effective decision making processes to network inter-connectively
Implementation often involves extract, transform, and load (ETL) procedures in coordination with a data warehouse and then using one or more reporting tools. Reports can be distributed in print form, via email or accessed via a corporate intranet.
Unified reports
With the expansion of information technology there has been an increase in the production of unified reports which join different views of an organization in one place. This reporting process involves querying data sources with different logical models to produce a human-readable report. For example, a decision maker may need to query a human resources databases and a capital improvements databases to show how efficiently space is being used across an entire corporation.
Acceptance of business reports
Reporting can also be used for verification and cross-checks. Audit teams like the Financial Industry Regulatory Authority (FINRA) and the U.S. Securities and Exchange Commission (SEC) adhere to reports for all business firms. Standard Business Reporting is a group of international programs instigated by a number of governments with the end of make business the center when it comes to managing business-to-government reporting obligations.
Formalities
Business reports can be presented in many forms, including digital or physical representations. Digital reports can be in interactive media and viewed through a standard web browser,
or other software, or more statically represented as for example in a PDF file, or printed on paper. A pagination of a business report may be formatted to be more suitable for printing to paper or PDF, including specification of physical measurements which matches the paper, page splits, and how data is split across multiple pages.
See also
Data reporting
Operational reporting
References
Business intelligence terms |
https://en.wikipedia.org/wiki/Hansj%C3%B6rg%20Schmidt | Hansjörg Schmidt (born ) is a German Social Democratic politician and Member of the Hamburg Parliament since 7 March 2011.
Life and work
After his final exams and computer science studies Schmidt founded the software company WICE GmbH in 2001 together with four of his fellow students. Currently, Schmidt is the chief marketing officer of WICE GmbH.
Political career
Schmidt has been a member of the SPD in Hamburg-Mitte since 1997, and was their deputy parliamentary group leader between 2001 and 2008. Since 2008 he is the parliamentary group leader and SPD's speaker in the urban planning commission of Hamburg. Schmidt ran for the 2008 Hamburg state election in voting district 1 (Hamburg-Mitte), resulting in 8.0 percent of the votes in his district. He was elected into Parliament at the election of 2008. A rerun for the 2011 Hamburg state election was successful and Schmidt gathered 10.2 percent of the votes in the same district. Since 7 March 2011 Hansjörg Schmidt has been a Member of the Hamburg Parliament.
References
External links
Hansjörg Schmidt on abgeordnetenwatch.de
Hansjörg Schmidt on hh-zeitung.de
1974 births
Living people
Social Democratic Party of Germany politicians
People from Hamburg-Mitte
Businesspeople in information technology
Members of the Hamburg Parliament |
https://en.wikipedia.org/wiki/%C2%BFQui%C3%A9n%20eres%20t%C3%BA%3F | ¿Quién eres tú? ('Infringement) (also known in developing as La Otra Cara) is a 2012 Spanish-language telenovela produced by RTI Producciones and Televisa for Mexico-based television network Gala TV and United States-based television network UniMás (formally Telefutura). It is a remake of La usurpadora.
Julian Gil stars as the protagonist, while Laura Carmine stars as the dual protagonist/antagonist, portraying twin sisters Natalia and Veronica.
History
A January 7, 2013 airdate was confirmed by UniMás (previously Telefutura) on December 12, 2012. From January 7 to January 18, 2013, UniMás broadcast ¿Quién Eres Tú? weeknights at 10pm/9c. It was removed from the airwaves after only ten episodes due to low ratings. As of January 21, 2013, UniMás is airing Rosario Tijeras weeknights at 10pm/9c, replacing ¿Quién Eres Tú?.
Cast
Main cast
Special Cast
Broadcasters
References
2012 telenovelas
RTI Producciones telenovelas
Televisa telenovelas
Spanish-language American telenovelas
2012 Colombian television series debuts
2013 Colombian television series endings
2012 Mexican television series debuts
2013 Mexican television series endings
2012 American television series debuts
2013 American television series endings
Mexican television series based on Venezuelan television series
American television series based on Venezuelan television series
Television series about twins |
https://en.wikipedia.org/wiki/Najat%20Kaanache | Najat Kaanache (born 28 November 1980) is the host of AMC Networks' cooking series "Cocina Marroquí" which airs on Canal Cocina in Spain and El Gourmet throughout 20 countries in Latin America. Kaanache was born and raised in San Sebastián of Spain's Basque Country. She gained fame as a lead actress on Spanish daytime television series "Goenkale" and then traveled throughout the Middle East and South America working in philanthropy to empower women and street kids. She later attended culinary school and gained fame as "The Pilgrim Chef" by blogging throughout her four years training with the world's top chefs: Ferran Adrià, René Redzepi, Thomas Keller, Grant Achatz, Heston Blumenthal and Martín Berasategui.
After spending two years working as an apprentice in the kitchens at Chicago's Alinea, Napa's The French Laundry, New York's Per Se (restaurant), and Copenhagen's Noma Kaanache went on to achieve the auspicious Executive and Creative Haute Cuisine Certification after completing her apprenticeship during the final two seasons at Spain's El Bulli. Ferran Adrià stated to the Maghreb Arabe Presse that "Najat Kaanache represents the soul of Morocco through the language of the kitchen. Her passion for creativity and innovation should be a reference for the country." After El Bulli's historic closure, Kaanache traveled extensively to instruct chefs across the globe in the latest gastronomic techniques and taught and lectured alongside White House Executive Pastry Chef, Bill Yosses on the science of cooking at Harvard University (pictured), New York University and at the 2013 World Science Festival in NYC (pictured) and 2013 Beijing Science Festival in China.
She was the opening chef partner of Souk Restaurant in Dallas, TX. She was the opening chef partner of Piripi Restaurant in the Village of Merrick Park in Coral Gables, FL; She is the chef and owner of Nur Restaurant, in the Medina of Fez, Morocco.
References
External links
Spanish television actresses
Spanish humanitarians
Spanish chefs
Moroccan chefs
People from San Sebastián
Basque women
Living people
Spanish people of Moroccan descent
1980 births
20th-century Spanish actresses
Spanish television chefs
Basque-language actors
Spanish expatriates in the United States |
https://en.wikipedia.org/wiki/Bandwidth-sharing%20game | A bandwidth-sharing game is a type of resource allocation game designed to model the real-world allocation of bandwidth to many users in a network. The game is popular in game theory because the conclusions can be applied to real-life networks.
The game
The game involves players.
Each player has utility for units of bandwidth.
Player pays for units of bandwidth and receives net utility of .
The total amount of bandwidth available is .
Regarding , we assume
is increasing and concave;
is continuous.
The game arises from trying to find a price so that every player individually optimizes their own welfare. This implies every player must individually find . Solving for the maximum yields .
Problem
With this maximum condition, the game then becomes a matter of finding a price that satisfies an equilibrium. Such a price is called a market clearing price.
Possible solution
A popular idea to find the price is a method called fair sharing. In this game, every player is asked for the amount they are willing to pay for the given resource denoted by . The resource is then distributed in amounts by the formula . This method yields an effective price .
This price can proven to be market clearing; thus, the distribution is optimal. The proof is as so:
Proof
We have
.
Hence,
from which we conclude
and thus
Comparing this result to the equilibrium condition above, we see that when is very small, the two conditions equal each other and thus, the fair sharing game is almost optimal.
References
Game theory game classes |
https://en.wikipedia.org/wiki/Paldo%20%28operating%20system%29 | paldo ("pure adaptable linux distribution") is a Linux distribution. It was originally developed by Jürg Billeter and Raffaele Sandrini and released in 2004, mainly under the GNU GPL.
Overview
paldo was developed primarily for desktop computers using the IA-32 (i686) and x86-64 architectures to utilize applications that remain as close to their upstream source as possible. It has a history of frequent stable releases starting in 2004 (generally every 3 months) and a "rolling release" style of continual updating of the system and application packages. paldo has typically been offered in stable and unstable versions and is one of the relatively few independent distributions listed on DistroWatch.
A stated intent of the paldo project is to only use selected programs in the distribution that satisfy a "just works" principle, with limited intervention needed by the user to compile or update, and minimal duplication of applications designed to accomplish the same task. Another principle is to minimize patching of paldo application packages, preserving adaptability for the end user to make changes or customize the system. Minimal customization of applications may also allow any required patches to be more easily available to the maintainers of the original packages. A customized installer application was developed, however, to simplify installation of live CD releases to the user's computer.
In 2009, the version 7 release of the Swedish-based ExTiX Linux distribution was based on paldo version 1.18(stable), using Linux kernel 2.6.30 and Gnome desktop environment 2.26.1.
In 2016, Jesse Smith reviewed paldo GNU/Linux 2015 in DistroWatch Weekly:
Around April of every years they announce the adding major software updates which are GNOME, LibreOffice, Firefox, Linux, glibc and gcc
Featured Applications
paldo has primarily used the GNOME desktop in release snapshots available on the Live/Install CD. The default web browser is Epiphany, the default browser for the GNOME desktop environment, although other browsers are available or can be built using the native Upkg package manager.
Typical applications found on the paldo Live/Install CD and in the repository have included:
Epiphany
Tomboy
LibreOffice
GNOME Videos
Pidgin
GNOME Text Editor
Subsequent to the 1.22 stable release, paldo adopted a rolling release format and by April 2011 paldo stable included GNOME 3.0, the Linux 2.6.38.3 kernel, and had already moved to systemd, a few weeks earlier than Fedora.
Package management system
paldo uses the Upkg package manager to update/upgrade the system and to install applications. Upkg was uniquely developed for the paldo project and is responsible for the distribution's character as a mixed source and binary based operating system. Written in C#, Upkg uses the Mono runtime to build packages from source, or to install pre-built binaries, using XML specifications that can be customized by the user. It relies on the command-line interface rather than a |
https://en.wikipedia.org/wiki/Darsham%20Marshes | Darsham Marshes is a 20 hectare nature reserve south of Darsham in Suffolk, England. It is owned and managed by the Suffolk Wildlife Trust.
This marsh and fen site has two ponds and a network of dykes. The wildlife is diverse and flowering plants include ragged-robin, yellow flag, marsh marigold and southern marsh orchid. There are birds such as marsh harriers and hen harriers, and mammals include otters and water voles.
There is access from Westleton Road.
References
Suffolk Wildlife Trust |
https://en.wikipedia.org/wiki/Open%20Source%20Routing%20Machine | The Open Source Routing Machine or OSRM is a C++ implementation of a high-performance routing engine for shortest paths in road networks. Licensed under the permissive 2-clause BSD license, OSRM is a free network service. OSRM supports Linux, FreeBSD, Windows, and Mac OS X platform.
Overview
It combines sophisticated routing algorithms with the open and free road network data of the OpenStreetMap (OSM) project. Shortest path computation on a continental sized network can take up to several seconds if it is done without a so-called speedup-technique. OSRM uses an implementation of contraction hierarchies and is able to compute and output a shortest path between any origin and destination within a few milliseconds, whereby the pure route computation takes much less time. Most effort is spent in annotating the route and transmitting the geometry over the network.
Since it is designed with OpenStreetMap compatibility in mind, OSM data files can be easily imported. A demo installation is sponsored by Karlsruhe Institute of Technology and previously by Geofabrik. The screen shot image shown is since September 2015 out of date with loss of attendant routing service features.
OSRM was part of the 2011 Google Summer of Code class.
Features
'Click-to-drag' dynamic routing, in the manner of Google Maps
Alternative routes
Free-to-use API
Free and open-source under the simplified two-clause BSD license
See also
GraphHopper
References
Further reading
External links
Project homepage
Demonstration from the project's homepage
Free software programmed in C++
OpenStreetMap
Route planning software
Web mapping
Software using the BSD license |
https://en.wikipedia.org/wiki/Saadatabad | Saadatabad is the former name of Saadat Shahr, a city in Fars Province, Iran.
Saadatabad () may also refer to:
Fars Province
Saadatabad, Abadeh, a village in Abadeh County
Saadatabad, Arsanjan, a village in Arsanjan County
Saadatabad, Darab, a village in Darab County
Saadatabad, Firuzabad, a village in Firuzabad County
Saadatabad, Mamasani, a village in Mamasani County
Saadatabad, Marvdasht, a village in Marvdasht County
Saadatabad-e Olya, a village in Marvdasht County
Saadatabad-e Sofla, a village in Marvdasht County
Saadatabad-e Vasat, a village in Marvdasht County
Saadatabad, Sarvestan, a village in Sarvestan County
Saadatabad, Sepidan, a village in Sepidan County
Saadatabad, Shiraz, a village in Shiraz County
Hormozgan Province
Saadatabad, Hormozgan
Isfahan Province
Saadatabad, Isfahan, a village in Isfahan County
Saadatabad, Semirom, a village in Semirom County
Saadatabad, Padena-ye Sofla, a village in Semirom County
Saadatabad, Padena-ye Vosta, a village in Semirom County
Kerman Province
Saadatabad, Kerman
Saadatabad, Bardsir, Kerman Province
Saadatabad, Golbaf, Kerman County, Kerman Province
Saadatabad, Narmashir, Kerman Province
Saadatabad-e Golshan, Narmashir County, Kerman Province
Saadatabad, Rafsanjan, Kerman Province
Saadatabad, Sirjan, Kerman Province
Saadatabad Rural District, in Kerman Province
Khuzestan Province
Saadatabad, Khuzestan
Kohgiluyeh and Boyer-Ahmad Province
Saadatabad, Kohgiluyeh and Boyer-Ahmad
Saadatabad-e Lishtar, Kohgiluyeh and Boyer-Ahmad Province
Markazi Province
Saadatabad, Markazi
Mazandaran Province
Saadatabad, Mazandaran
Razavi Khorasan Province
Saadatabad, Rashtkhvar, Razavi Khorasan Province
South Khorasan Province
Tehran Province
Sa'adat Abad, neighbourhood of Tehran
Yazd Province
See also
Sadatabad (disambiguation) |
https://en.wikipedia.org/wiki/Food%20Network%20Star%20%28season%208%29 | The eighth season of the American reality television series Food Network Star premiered Sunday, May 13, 2012 and consisted of 11 episodes. The format for the eighth season changed to three 5-member teams, each coached by a Food Network host — Alton Brown, Bobby Flay or Giada De Laurentiis. This season viewers had the opportunity to follow the show (#Star) or their favorite team (#TeamAlton, #TeamBobby or #TeamGiada) on Twitter.
Contestants
Eliminated
(in order of elimination)
Cristie Schoen – New Orleans, Louisiana – Team Alton
Kara Sigle – Chicago, Illinois – Team Bobby
Josh Lyons – Jupiter, Florida – Team Giada
Eric Lee – Petaluma, California – Team Bobby
Judson Allen – Chicago, Illinois – Team Alton
Linkie Marais – North Attleborough, Massachusetts – Team Giada
Emily Ellyn – Orlando, Florida – Team Alton
Malcolm Mitchell – Washington, D.C. – Team Bobby
Martita Jara – San Diego, California – Team Giada
Nikki Martin – West Hollywood, California – Team Bobby
Philip "Ippy" Aiona – Kamuela, Hawaii – Team Giada
Runners-Up
Martie Duncan – Birmingham, Alabama – Team Alton
Michele Ragussis – Brooklyn, New York – Team Bobby
Yvan Lemoine – Maspeth, New York – Team Giada
Winner
Justin Warner – Brooklyn, New York – Team Alton
Contestant Progress
Team Alton Team Bobby Team Giada
(WINNER) The contestant won the competition and became the next "Food Network Star".
(RUNNER-UP) The contestant made it to the finale, but did not win.
(WIN) The contestant was a member of the winning team and was one of the committee's favorites for that week.
(WIN) The contestant was a member of the winning team.
(HIGH) The contestant was one of the committee's favorites for that week, but was not on the winning team.
(IN) The contestant was not a member of the winning team, but was not one of the committee's least favorites. They were not up for elimination.
(LOW) The contestant was one of the committee's three or four least favorites for that week, but won the Producer's Challenge, and was safe.
(LOW) The contestant was one of the committee's two least favorites for that week, but won the Producer's Challenge, and was safe.
(OUT) The contestant was one of the committee's least favorites for that week, lost the Producer's Challenge, and was eliminated.
Episode summaries
Week 1: Impossible Beginnings
The contestants were introduced and chosen by their mentors.
Star Challenge: The teams were challenged to each open a new restaurant in 24 hours, with $5,000 total to spend on food and decorations. Then, the teams had to present their restaurants to 150 guests, who would decide which restaurant they would like to go to, Robert Irvine, and the Selection Committee. The restaurants that were opened were Do South (Team Alton), The Tasting Space (Team Bobby) and Blu (Team Giada).
Winners: Team Bobby: Eric (Handcrafted Mushroom Lasagna), Kara (Carmelito Cookies with Vanilla Whipped Cream and Candied Nuts), Malcolm (LoLa Shrimp and Parmesan Polenta |
https://en.wikipedia.org/wiki/Air%20pollution%20in%20India | Air pollution in India is a serious environmental issue. Of the 30 most polluted cities in the world, 21 were in India in 2019. As per a study based on 2016 data, at least 140 million people in India breathe air that is 10 times or more over the WHO safe limit and 13 of the world's 20 cities with the highest annual levels of air pollution are in India. 51% of the pollution is caused by industrial pollution, 27% by vehicles, 17% by crop burning and 5% by other sources. Air pollution contributes to the premature deaths of 2 million Indians every year. Emissions come from vehicles and industry, whereas in rural areas, much of the pollution stems from biomass burning for cooking and keeping warm. In autumn and spring months, large scale crop residue burning in agriculture fields – a cheaper alternative to mechanical tilling – is a major source of smoke, smog and particulate pollution. India has a low per capita emissions of greenhouse gases but the country as a whole is the third largest greenhouse gas producer after China and the United States. A 2013 study on non-smokers has found that Indians have 30% weaker lung function than Europeans.
The Air (Prevention and Control of Pollution) Act was passed in 1981 to regulate air pollution but has failed to reduce pollution because of poor enforcement of the rules.
In 2015, Government of India, together with IIT Kanpur launched the National Air Quality Index. In 2019, India launched 'The National Clean Air Programme' with tentative national target of 20%-30% reduction in PM2.5 and PM10 concentrations by 2024, considering 2017 as the base year for comparison. It will be rolled out in 102 cities that are considered to have air quality worse than the National Ambient Air Quality Standards. There are other initiatives such as a 1,600-kilometre-long and 5-kilometre-wide The Great Green Wall of Aravalli green ecological corridor along Aravalli range from Gujarat to Delhi which will also connect to Shivalik hill range with planting of 1.35 billion (135 crore) new native trees over 10 years to combat the pollution. In December 2019, IIT Bombay, in partnership with the McKelvey School of Engineering of Washington University in St. Louis, launched the Aerosol and Air Quality Research Facility to study air pollution in India. According to a Lancet study, nearly 1.67 million deaths and an estimated loss of USD 28.8 billion worth of output were India's prices for worsening air pollution in 2019.
Causes
Fuel and biomass burning
Fuel wood and biomass burning is the primary reason for near-permanent haze and smoke observed above rural and urban India, and in satellite pictures of the country. Fuelwood and biomass cakes are used for cooking and general heating needs. These are burnt in cook stoves known as chulha (also chullha or chullah) in some parts of India. These cook stoves are present in over 100 million Indian households, and are used two to three times a day, daily. Some reports, including one by the World |
https://en.wikipedia.org/wiki/Pare%20%26%20Pare | Pare & Pare () is a 2012 Philippine television comedy musical talk show broadcast by GMA Network. Hosted by Ogie Alcasid and Michael V., it premiered on May 20, 2012. The show concluded on August 12, 2012 with a total of 12 episodes.
Segments
The Week in Review
Barako Tips
Sabi-Sabi Po
Bet Mo, Bet Ko
Masa Poll
Ratings
According to AGB Nielsen Philippines' Mega Manila household television ratings, the pilot episode of Pare & Pare earned a 20.3% rating. While the final episode scored a 10.8% rating.
Accolades
References
2012 Philippine television series debuts
2012 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine television talk shows |
https://en.wikipedia.org/wiki/Social%20networking%20pedagogy | Social networking pedagogy is a philosophy of education described by curriculum theorists Thomas Patrick Huston and Hallie DeCatherine Jones as a form of learner-driven participatory culture where the user's experience is reciprocal, consisting of a range of input and output experiences mediated by social networking technologies. The range of individual and unique differentiated user experiences form a composite impression on the individual which functions as an epistemic form of how we come to know and experience the world and its social, cultural, political and economic realities.
In educational settings, social networking pedagogical approaches place social networking technologies at their core, thus presenting expansive opportunities for education to extend the curriculum beyond the traditional walls of educational institutions by reaching into the daily-lived experiences of individuals. The archival features and lack of temporal constraints associated with Internet technologies sustain continually changing currents that educators can connect to student-driven interests by engaging them with trending topics. Through social network pedagogy, educators can develop a teaching praxis where the classroom and social space blend and individuals' creative contributions are acknowledged for their cultural value.
Jones and Huston began theorizing the development of social networking pedagogy during their tenure as doctoral students at the Indiana University School of Education where they were colleagues in the Department of Curriculum and Instruction. They point to the fields of cultural studies and critical pedagogy, especially the contributions of David Trend with his book Cultural Pedagogy: Art, Education, Politics and the critical theorist Henry Giroux.
Philosophy of education
Social networks
Pedagogy
Critical pedagogy
Cultural studies |
https://en.wikipedia.org/wiki/Kinetic%20diameter%20%28data%29 | A kinetic diameter data structure is a kinetic data structure which maintains the diameter of a set of moving points. The diameter of a set of moving points is the maximum distance between any pair of points in the set. In the two dimensional case, the kinetic data structure for kinetic convex hull can be used to construct a kinetic data structure for the diameter of a moving point set that is responsive, compact and efficient.
2D Case
The pair of points with maximum pairwise distance must be one of the pairs of antipodal points of the convex hull of all of the points. Note that two points are antipodal points if they have parallel supporting lines. In the static case, the diameter of a point set can be found by computing the convex hull of the point set, finding all pairs of antipodal points, and then finding the maximum distance between these pairs. This algorithm can be kinetized as follows:
Consider the dual of the point set. The points dualize to lines and the convex hull of the points dualizes to the upper and lower envelope of the set of lines. The vertices of the upper convex hull dualize to segments on the upper envelope. The vertices of the lower convex hull dualize to segments on the lower envelope. The range of slopes of the supporting lines of a point on the hull dualize to the x-interval of segment that point dualizes to. When viewed in this dualized fashion the antipodal pairs, are pairs of segments, one from the upper envelope, one from the lower, with overlapping x ranges. Now, the upper and lower envelopes can be viewed as two different x-ordered lists of non overlapping intervals. If these two lists are merged, the antipodal pairs are the overlaps in the merged list.
The overlaps in the merged list of x-intervals can be maintained by storing the endpoints of the intervals in a kinetic sorted list. When points swap, the list of antipodal pairs are updated. The upper and lower envelopes can be maintained using the standard data structure for kinetic convex hull. The maximum distance between pairs of antipodal can be maintained with a kinetic tournament. Thus, using kinetic convex hull to maintain the upper and lower envelopes, a kinetic sorted list on these intervals to maintain the antipodal pairs, and a kinetic tournament to maintain the pair of maximum distance apart, the diameter of a moving point set can be maintained.
This data structure is responsive, compact and efficient. The data structure uses space because the kinetic convex hull, sorted list, and tournament data structures all use space. In all of the data structures, events, inserts, and deletes can be handled in time, so the data structure are responsive, requiring per event. The data structure is efficient because the total number of events is for all and the diameter of a point set can change times, even if the points are moving linearly. This data structure is not local because one point may be in many antipodal pairs, and thus appear many times in th |
https://en.wikipedia.org/wiki/Kinetic%20triangulation | A kinetic triangulation data structure is a kinetic data structure that maintains a triangulation of a set of moving points. Maintaining a kinetic triangulation is important for applications that involve motion planning, such as video games, virtual reality, dynamic simulations and robotics.
Choosing a triangulation scheme
The efficiency of a kinetic data structure is defined based on the ratio of the number of internal events to external events, thus good runtime bounds can sometimes be obtained by choosing to use a triangulation scheme that generates a small number of external events.
For simple affine motion of the points, the number of discrete changes to the convex hull is estimated by , thus the number of changes to any triangulation is also lower bounded by . Finding any triangulation scheme that has a near-quadratic bound on the number of discrete changes is an important open problem.
Delaunay triangulation
The Delaunay triangulation seems like a natural candidate, but a tight worst-case analysis of the number of discrete changes that will occur to the Delaunay triangulation (external events) was considered an open problem until 2015; it has now been bounded to be between and .
There is a kinetic data structure that efficiently maintains the Delaunay triangulation of a set of moving points, in which the ratio of the total number of events to the number of external events is .
Other triangulations
Kaplan et al. developed a randomized triangulation scheme that experiences an expected number of external events, where is the maximum number of times each triple of points can become collinear, , and is the maximum length of a Davenport-Schinzel sequence of order s + 2 on n symbols.
Pseudo-triangulations
There is a kinetic data structure (due to Agarwal et al.) which maintains a pseudo-triangulation in events total. All events are external and require time to process.
References
Kinetic data structures
Triangulation (geometry) |
https://en.wikipedia.org/wiki/Statistics%20and%20Computing | Statistics and Computing is a peer-reviewed academic journal that deals with statistics and computing. It was established in 1991 and is published by Springer.
External links
Mathematics journals
Academic journals established in 1991
Statistics journals
Computer science journals
Springer Science+Business Media academic journals |
https://en.wikipedia.org/wiki/Tanel%20Tammet | Tanel Tammet is an Estonian computer scientist, professor, software engineer, and computer programmer. He was also one of the founding members of the Estonian Greens party, and helped found the IT College in Tallinn.
Life and career
Born in 1965, Tammet had early access to the University of Tartu's computers through his father's work at the physics department. As a result, he eventually graduated the university's maths department in applied mathematics, specializing in information technology. He took interest in automated theorem proving and graduated the Gothenburg Chalmers University of Technology in with a Ph.D. in 1992. He lived in Sweden for the most part of that decade, then returned to Tallinn.
Tammet received international renown for his automated theorem proving program Gandalf, which won different categories of the Conference on Automated Deduction (CADE) CASC competition six times between 1997 and 2003. He has been the Estonian delegate to the Information Systems Technology Panel of the NATO Research and Technology Organisation, and written about cyber security. He often teaches or speaks about artificial intelligence, and has asserted that it already exists, albeit in a primitive and distributed form.
From 2006, Tammet was a founding member and member of the board of the Estonian Greens. The party was elected into the Riigikogu the following year with 7.1% of the nationwide vote, which granted them six seats. In 2010, amid growing tensions following their failed runs in the European Parliament and local elections in 2009, Tammet along with 19 other members was thrown out of the party. It subsequently failed to reach the minimum 5% of the vote needed in the 2011 parliamentary elections and faded.
Tammet is a professor at the Tallinn University of Technology and is the faculty manager of its computer science institute. Formerly he had helped found the Tallinn IT College and was on its board of advisors from its inception in 2003. Tammet has also worked in the Institute of Cybernetics in Tallinn. In 2012, he received attention for the creation of Sightsmap, a website which visualizes the popularity of places around the world based on data from Panoramio, Wikipedia, and Foursquare City Guide.
Tammet has four sons. In 2002, he was issued the fifth class of the Order of the White Star.
Books
Tammet, Tanel; Teejuht võrgumaailma, Tartu : Ilmamaa, 1997.
Tamme, Tõnu; Tammet, Tanel; Prank, Rein; Loogika: Mõtlemisest tõestamiseni, Tartu : Tartu Ülikooli Kirjastus, 1997.
References
External links
Personal page on Google Sites
Sightsmap
1965 births
Living people
Estonian computer scientists
Estonian Greens politicians
University of Tartu alumni
Scientists from Tallinn
21st-century Estonian politicians
Recipients of the Order of the White Star, 5th Class |
https://en.wikipedia.org/wiki/Vectored%20interrupt | In computer science, a vectored interrupt is a processing technique in which the interrupting device directs the processor to the appropriate interrupt service routine. This is in contrast to a polled interrupt system, in which a single interrupt service routine must determine the source of the interrupt by checking all potential interrupt sources, a slow and relatively laborious process.
Implementation
Vectored interrupts are achieved by assigning each interrupting device a unique code, typically four to eight bits in length. When a device interrupts, it sends its unique code over the data bus to the processor, telling the processor which interrupt service routine to execute.
References
Computer architecture
Interrupts |
https://en.wikipedia.org/wiki/Aula365 | Aula365 is an Argentine education and entertainment social network. It is the educational platform that served as an environment for the creation of 365 Social Comic Adventures in the World of the Future, winner on November 8, 2011, of the Guinness Record Award to the comics with the world's largest number of authors.
Aula365 is considered an educational website, as it has a multimedia platform for school age students with contents divided into initial, primary, secondary, and university levels, and contents for teachers and parents, in line with the Core Learning Priorities set out in the educational curricula of the different Ibero-American countries.
At the same time, this site is a social network, since the group of users can exchange knowledge when discussing the contents, making recommendations, asking and answering questions from other users, among other activities seeking to develop collaborative intelligence, which is a feature of the so- called Web 2.0.
Contents
Aula365 operates in eleven countries in America and Europe. According to EFE agency, Aula365 is considered “the world’s largest school” because it has school-related educational contents for minors, teenagers and adults.
The site has a content library classified by ages and courses with interactive films, blogs, infographics, simulators and other resources. It is possible to consult virtual teachers, who answer any type of questions related to school contents.
It also has English courses that offer interactive videos to stimulate children's interest.
Record Guinness
On November 8, 2011, Adventures in the World of the Future or 365 Social Comic, a web comic created by Aula365, was awarded with the Guinness Record to the collaborative comic with the world's largest number of authors. Adventures in the World of the Future was composed of 20 episodes which were published every 15 days on Aula365 site. The production period lasted from April to October 2011.
References
https://web.archive.org/web/20131021173534/http://argentina.aula365.com/
Argentine social networking websites |
https://en.wikipedia.org/wiki/Saint%20Joseph%20Mercy%20Health%20System | Saint Joseph Mercy Health System (SJMHS) one of the largest health care networks based in southeast Michigan, United States is now known as Trinity Health Michigan. It consist of five prime hospitals, nine Urgent Care Centers, and five Health Centers spread around metro Detroit, providing health care in six counties that include Livingston, Macomb, Oakland, St. Clair, Washtenaw, and Wayne.
Foundation
In 1911, four Sisters of Mercy arrived in Ann Arbor from Dubuque, Iowa. They came at the invitation of local medical and religious leaders who dreamed of founding a community hospital to serve area residents. That dream became a reality on November 21, 1911, when the Sisters opened St. Joseph's Sanitarium, a small hospital located in a former student rooming house at the corner of State and Kingsley streets.
The little hospital had a nine-member medical staff and 17 beds on the second and third floors, including eight private rooms. Surgeons operated on the first floor, then carried their patients up the stairs to their rooms above. In its first year, 243 patients were admitted.
By 1914, St. Joe's had moved to a new facility on Ingalls Street. In 1977, the hospital relocated to its present location on East Huron River Drive in Superior Township.
Hospitals
IHA Health Services
Merging in 2010, IHA Health Services is a wholly owned subsidiary of St. Joseph Health System. IHA is the largest, fully integrated physician group practice in southeast Michigan, with approximately 70 practice locations and 650 providers.
References
Hospital networks in the United States
Medical and health organizations based in Michigan
Catholic hospital networks in the United States
Catholic health care |
https://en.wikipedia.org/wiki/Next%20Caller%20%28TV%20series%29 | Next Caller is an unaired American television comedy series that was scheduled to premiere mid-season on NBC as part of the 2012–13 television schedule. The network placed a series order in May 2012. Season one was set to feature seven half-hour episodes.
On October 12, 2012, NBC announced the cancellation of the series after only four episodes had been filmed, citing creative differences with star Dane Cook, and that the filmed episodes would not be aired. It became the second series of the 2012–13 television season to be canceled, after Made in Jersey.
Premise
A very unlikely pair of satellite radio disc jockeys are forced to share the microphone for a relationship call-in show in New York City. Cam (Dane Cook) is crude, egotistical, and unwilling to share the spotlight, while Stella (Collette Wolfe) is a perky feminist who has just moved over from NPR.
Cast
Dane Cook as Cam Dunne
Collette Wolfe as Stella Hoobler
Jeffrey Tambor as Jefferson Mingus
Joy Osmanski as Winnie Hyde
Wolé Parks as Keith Calhoun
Desmin Borges as Derek
Trey Gerrald as Kent
Chris Perfetti as Cody the Intern
Tia Shipman as Angry Bob
Episodes
See also
List of television series canceled before airing an episode
References
External links
Unaired television shows |
https://en.wikipedia.org/wiki/Nearest%20neighbor%20value%20interpolation | In mathematics applied to computer graphics, nearest neighbor value interpolation is an advanced method of image interpolation. This method uses the pixel value corresponding to the smallest absolute difference when a set of four known value pixels has no mode. Proposed by Olivier Rukundo in 2012 in his PhD dissertation, the first work presented at the fourth International Workshop on Advanced Computational Intelligence, was based only on the pixel value corresponding to the smallest absolute difference to achieve high resolution and visually pleasant image. This approach was since upgraded to deal with a wider class of image interpolation artefacts which reduce the quality of image, and as a result, several future developments have emerged, drawing on various aspects of the pixel value corresponding to the smallest absolute difference.
References
Multivariate interpolation |
https://en.wikipedia.org/wiki/Noncommutative%20signal-flow%20graph | In automata theory and control theory, branches of mathematics, theoretical computer science and systems engineering, a noncommutative signal-flow graph is a tool for modeling interconnected systems and state machines by mapping the edges of a directed graph to a ring or semiring.
A single edge weight might represent an array of impulse responses of a complex system (see figure to the right), or a character from an alphabet picked off the input tape of a finite automaton, while the graph might represent the flow of information or state transitions.
As diverse as these applications are, they share much of the same underlying theory.
Definition
Consider n equations involving n+1 variables {x0, x1,...,xn}.
with aij elements in a ring or semiring R. The free variable x0 corresponds to a source vertex v0, thus having no defining equation. Each equation corresponds to a fragment of a directed graph G=(V,E) as show in the figure.
The edge weights define a function f from E to R. Finally fix an output vertex vm. A signal-flow graph is the collection of this data S = (G=(V,E), v0,vm V, f : E → R). The equations may not have a solution, but when they do,
with T an element of R called the gain.
Successive Elimination
Return Loop Method
There exist several noncommutative generalizations of Mason's rule. The most common is the return loop method (sometimes called the forward return loop method (FRL), having a dual backward return loop method (BRL)). The first rigorous proof is attributed to Riegle, so it is sometimes called Riegle's rule.
As with Mason's rule, these gain expressions combine terms in a graph-theoretic manner (loop-gains, path products, etc.). They are known to hold over an arbitrary noncommutative ring and over the semiring of regular expressions.
Formal Description
The method starts by enumerating all paths from input to output, indexed by j J. We use the following definitions:
The j-th path product is (by abuse of notation) a tuple of kj edge weights along it:
To split a vertex v is to replace it with a source and sink respecting the original incidence and weights (this is the inverse of the graph morphism taking source and sink to v).
The loop gain of a vertex v w.r.t. a subgraph H is the gain from source to sink of the signal-flow graph split at v after removing all vertices not in H.
Each path defines an ordering of vertices along it. The along path j, the i-th FRL (BRL) node factor is (1-Si(j))−1 where Si(j) is the loop gain of the i-th vertex along the j-th w.r.t. the subgraph obtained by removing v0 and all vertices ahead of (behind) it.
The contribution of the j-th path to the gain is the product along the path, alternating between the path product weights
and the node factors:
so the total gain is
An Example
Consider the signal-flow graph shown. From x to z, there are two path products: (d) and (e,a). Along (d), the FRL and BRL contributions coincide as both share same loop gain (whose split reappea |
https://en.wikipedia.org/wiki/Emissaries%20of%20Divine%20Light | Emissaries of Divine Light is an intentional community initiated by Lloyd Arthur Meeker in 1932. The foundational premise of the network is that human beings' true qualities can only be known as they are expressed in practical daily living.
History
Beginnings
Lloyd Arthur Meeker was born on February 25, 1907. By 1929 he had already begun to experiment with Attunement. Emissaries of Divine Light dates its origin to Meeker’s spiritual awakening on September 16, 1932. On three successive evenings, Meeker had been compelled to write and, as he did so, he was said to have experienced a higher spiritual awareness that flowed through him. He reported that he had been looking for a teacher but realized through his awakening that the teacher he sought was within him.
Meeker lectured, taught, and practiced Attunement in various locations in North America from 1929 to 1945. He wrote under the pen name Uranda, and he was known to his followers by that name. In 1945 Meeker established his headquarters at Sunrise Ranch, which was a dryland farm at the time. From 1952 to 1954 he conducted six-month Servers Training School classes at Sunrise Ranch, teaching Attunement and the spiritual understanding behind the practice, as well as practical spirituality. These classes were attended by people from many backgrounds and included GPC (God-Patient-Chiropractor) chiropractors, led by a former Major League Baseball pitcher, George Shears, and others.
In 1954 Meeker died in a plane crash in San Francisco Bay with his wife, Kathy Meeker. A close associate of Meeker’s, Albert Ackerley, and two children also died in the crash. Lord Martin Cecil (1909-1988), who had worked closely with Meeker, assumed the responsibility for leading Emissaries of Divine Light from 1954 until he died in 1988. Lord Martin succeeded his older brother to become The 7th Marquess of Exeter in October 1981.
Development under Lord Martin Cecil's leadership
Lord Martin Cecil was the second son of William Cecil, 5th Marquess of Exeter and was descended from William Cecil, 1st Baron Burghley, chief adviser to Queen Elizabeth I. He led a ranching operation on his family’s property in the Cariboo country of British Columbia. In 1948, Cecil formed a spiritual community at 100 Mile House, BC. On the death of his brother, David Cecil, 6th Marquess of Exeter, in October 1981, he became The 7th Marquess of Exeter and a member of the House of Lords of the United Kingdom. However, he never spoke in the House.
Under Lord Martin's leadership, the network grew to about 4,000 adherents. Many young people, disenchanted with the Vietnam War and inspired by the idealism of the 1960s and ’70s, were drawn to his message and the network that was growing around him. Twelve centers developed around the world, and numerous other nonprofit organizations were birthed by participants in Emissaries of Divine Light. These included an outdoor adventure educational organization, Educo; an association of spiritually based bus |
https://en.wikipedia.org/wiki/Kinetic%20priority%20queue | A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum) priority element (key-value pair) when the priority of every element is changing as a continuous function of time. Kinetic priority queues have been used as components of several kinetic data structures, as well as to solve some important non-kinetic problems such as the k-set problem and the connected red blue segments intersection problem.
Implementations
The operations supported are:
: create an empty kinetic priority queue
(or find-min): - return the (or for a ) value stored in the queue at the current virtual time .
: - insert a key into the kinetic queue at the current virtual time, whose value changes as a continuous function of time .
- delete a key at the current virtual time .
There are several variants of kinetic priority queues, which support the same basic operations but have different performance guarantees. Some of the most common implementations are kinetic heaps which are simple to implement but don't have tight theoretical performance bounds, and their randomized variants - kinetic heaters and kinetic hangers - which are easier to analyze. There is also a heap-like structure based on the dynamic convex hull data structure which achieves better performance for affine motion of the priorities, but doesn't support curved trajectories. The kinetic tournament is another commonly used implementation. It achieves, deterministically, the same performance bounds as the heater or hanger, however it is less local and responsive than the heap-based data-structures.
Here, denotes the inverse Ackermann function.-intersecting curves refer to curves where each pair has at most intersections, and refers to a term in the Davenport-Schinzel sequence, which gives the maximum size of the upper envelope of intersecting curves. is the largest number of elements in the queue at any given time, while refers to the total number of elements that are ever in the queue.
Applications
Kinetic priority queues are used as part of other kinetic data structures/algorithms such as kinetic closest pair, kinetic max-cut or kinetic clustering.
They can also be used to solve problems such as broadcast scheduling or the connected red blue segments intersection problem.
References
Kinetic data structures
Abstract data types
Priority queues |
https://en.wikipedia.org/wiki/Kinetic%20width | A kinetic width data structure is a kinetic data structure which maintains the width of a set of moving points. In 2D, the width of a point set is the minimum distance between two parallel lines that contain the point set in the strip between them. For the two dimensional case, the kinetic data structure for kinetic convex hull can be used to construct a kinetic data structure for the width of a point set that is responsive, compact and efficient.
2D case
Consider the parallel lines which contain the point set in the strip between them and are of minimal distance apart. One of the lines must contain an edge of the convex hull, and the other line must go through a point c of the convex hull such that (a,c) and (b,c) are antipodal pairs. ab and c are referred to as an antipodal edge-vertex pair.
Consider the dual of the point set. The points dualize to lines and the convex hull of the points dualizes to the upper and lower envelope of the set of lines. The vertices of the upper convex hull dualize to segments on the upper envelope. The vertices of the lower convex hull dualize to segments on the lower envelope. The range of slopes of the supporting lines of a point on the hull dualize to the x-interval of segment that point dualizes to. When viewed in this dualized fashion the antipodal pairs, are pairs of segments, one from the upper envelope, one from the lower, with overlapping x ranges. Now, the upper and lower envelopes can be viewed as two different x-ordered lists of non overlapping intervals. If these two lists are merged, the antipodal pairs are the overlaps in the merged list. If a pair and c is an antipodal edge-vertex pair, then the x-interval for a and b must both intersect the x-interval for c. This means that the common endpoint of the x intervals for a and b must lie within the x-interval for c.
The endpoints of both of the sets of x-intervals can be maintained in a kinetic sorted list. When points swap, the list of antipodal edge-point pairs are updated appropriately. The upper and lower envelopes can be maintained using the standard data structure for kinetic convex hull. The minimum distance between edge-point pairs can be maintained with a kinetic tournament. Thus, using kinetic convex hull to maintain the upper and lower envelopes, a kinetic sorted list on these intervals to maintain the antipodal edge-vertex pairs, and a kinetic tournament to maintain the pair of minimum distance apart, the diameter of a moving point set can be maintained.
This data structure is responsive, compact and efficient. The data structure uses space because the kinetic convex hull, sorted list, and tournament data structures all use space. In all of the data structures, events, inserts, and deletes can be handled in time, so the data structure are responsive, requiring per event. The data structure is efficient because the total number of events is for all and the width of a point set can change times, even if the points are moving linear |
https://en.wikipedia.org/wiki/Toulouse%20Tech | Toulouse Tech, also called the Toulouse Institute of Technology, is one of the grandes écoles network in France. Created in 2007, it gathers 16 French grandes écoles, covering engineering science, management, architecture and veterinary, aiming to be of comparable status to the most famous universities of technology around the world.
Colleges and institutes
École nationale de l'aviation civile
École nationale supérieure de formation de l’enseignement agricole
École nationale d'ingénieurs de Tarbes
École nationale de la météorologie
École nationale supérieure d'architecture de Toulouse
École nationale supérieure en génie des technologies industrielles
École des mines d'Albi-Carmaux
École nationale vétérinaire de Toulouse
École d'ingénieurs de Purpan
Institut catholique d'arts et métiers
École Nationale Supérieure Agronomique de Toulouse
École Nationale Supérieure d'Électronique, d'Électrotechnique, d'Informatique, d'Hydraulique et des Télécommunications
École nationale supérieure des ingénieurs en arts chimiques et technologiques
Institut National des Sciences Appliquées de Toulouse
Institut Supérieur de l'Aéronautique et de l'Espace
Facts and figures
From the official website:
850 teachers-researchers
14,000 students
22 million euros in research
References
External links
Toulouse Tech
Toulouse Formation
Trouver une formation à Toulouse
Universities and colleges in Toulouse
Technical universities and colleges in France
Toulouse
Educational institutions established in 2007
2007 establishments in France |
https://en.wikipedia.org/wiki/Evertek | Evertek may refer to:
Businesses
Evertek Computer Corporation, US Consumer Wholesaler (owner of US trademark "evertek")
EvertekTunisie, Tunisian brand of cell phone - part of Cellcom Tunisie
Evertek, Inc., an Iowa (US) telecommunication company
Evertec, Inc., a Puerto Rican electronic transaction processing company. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.