source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Statistical%20conclusion%20validity | Statistical conclusion validity is the degree to which conclusions about the relationship among variables based on the data are correct or "reasonable". This began as being solely about whether the statistical conclusion about the relationship of the variables was correct, but now there is a movement towards moving to "reasonable" conclusions that use: quantitative, statistical, and qualitative data. Fundamentally, two types of errors can occur: type I (finding a difference or correlation when none exists) and type II (finding no difference or correlation when one exists). Statistical conclusion validity concerns the qualities of the study that make these types of errors more likely. Statistical conclusion validity involves ensuring the use of adequate sampling procedures, appropriate statistical tests, and reliable measurement procedures.
Common threats
The most common threats to statistical conclusion validity are:
Low statistical power
Power is the probability of correctly rejecting the null hypothesis when it is false (inverse of the type II error rate). Experiments with low power have a higher probability of incorrectly accepting the null hypothesis—that is, committing a type II error and concluding that there is no effect when there actually is (I.e. there is real covariation between the cause and effect). Low power occurs when the sample size of the study is too small given other factors (small effect sizes, large group variability, unreliable measures, etc.).
Violated assumptions of the test statistics
Most statistical tests (particularly inferential statistics) involve assumptions about the data that make the analysis suitable for testing a hypothesis. Violating the assumptions of statistical tests can lead to incorrect inferences about the cause–effect relationship. The robustness of a test indicates how sensitive it is to violations. Violations of assumptions may make tests more or less likely to make type I or II errors.
Dredging and the error rate problem
Each hypothesis test involves a set risk of a type I error (the alpha rate). If a researcher searches or "dredges" through their data, testing many different hypotheses to find a significant effect, they are inflating their type I error rate. The more the researcher repeatedly tests the data, the higher the chance of observing a type I error and making an incorrect inference about the existence of a relationship.
Unreliability of measures
If the dependent and/or independent variable(s) are not measured reliably (i.e. with large amounts of measurement error), incorrect conclusions can be drawn.
Restriction of range
Restriction of range, such as floor and ceiling effects or selection effects, reduce the power of the experiment, and increase the chance of a type II error. This is because correlations are attenuated (weakened) by reduced variability (see, for example, the equation for the Pearson product-moment correlation coefficient which uses score variance in its estimation |
https://en.wikipedia.org/wiki/1996%20Autonomous%20Region%20in%20Muslim%20Mindanao%20general%20election | General elections are held in the Autonomous Region in Muslim Mindanao for the Regional Governor and Vice-Governor were held on September 9, 1996. Comelec conducted the pilot test for their computerized counting system during this election.
Results
For Regional Governor
|-
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
|-
| style="text-align:left;" | Nurallaj Misuari
| style="text-align:left;" | Lakas-NUCD-UMDP
|-
|}
For Regional Vice-Governor
|-
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
|-
| style="text-align:left;" | Guimid P. Matalam
| style="text-align:left;" | Lakas-NUCD-UMDP
|-
|}
References
See also
Commission on Elections
Politics of the Philippines
Philippine elections
1996
1996 elections in the Philippines |
https://en.wikipedia.org/wiki/Sakura%20Shukugawa%20Station | is a passenger railway station located in the city of Nishinomiya, Hyōgo Prefecture, and is operated by the West Japan Railway Company. As a part of the JR West Urban Network, the following cards are accepted: J-Thru Card, ICOCA, Suica, and PiTaPa. The station's name comes from the park approximately 200m west of the station, Shukugawa Park (夙川公園). The park is situated on the banks of the Shukugawa riverbed and is famous for its annual display of Cherry Blossoms, and is quite a popular site for flower viewing parties.
Lines
Sakura Shukugawa Station is served by the Tōkaidō Main Line (JR Kobe Line), and is located 573.3 kilometers from the terminus of the line at and 16.9 kilometers from .
Station Layout and Design
Station Placement
Most of the JR Kobe Line runs on , meaning that there are two tracks for each direction. Similar to other stations such as Kōnan-Yamate Station, Sakura Shukugawa Station is of the island platform type, that is situated between the four tracks. Specifically, it is between the two inner tracks that provide local service. Local trains stop at this station. Rapid Service trains pass the station on the same track, but do not stop. Special Rapid Service and other Limited Express trains pass by on the outer track.
Building Design
With regard to the design of the station building, the basic concept was to give the station a natural warmth and vibrance. The roof line is a conceptual representation of waves flowing down the Shukugawa River, and the walls are the color of cherry blossoms.
Hyōgo Prefecture Highway 82 passes underneath the platform and tracks.
Gates
The station has only one gate, located on the south side of the station.
Train Platforms
Adjacent stations
History
Generally, the local government encourages people to petition for a new station to be built, however, the widening of Prefecture Road 82 was already underway and funded by the federal government. Therefore, Nishinomiya didn't have the burden of petitioning for the station, but rather JR West went to the government and began design the plans. Prefecture Road 82, directly below the station, had already been undergoing construction to widen the road, so when the construction of the station began, both construction sites were operating at the same time, one on top of the other.
In preparation of JR Sakura Shukugawa Station's opening, on 28 October 2006, both Hankyū Railway and Hanshin Electric Railway altered their schedules and changed which trains would stop at the stations that are direct competitors of JR Sakura Shukugawa Station. At Hankyū Shukugawa Station, where before only local service stopped, now Limited Express and Commuter Express would stop. At Hanshin Kōroen Station, Limited Express trains began stopping in the morning. These changes were made, it is thought, to go head-to-head with the new JR Sakura Shukugawa Station.
Before the station opened to the public, there was no practice for stopping the train at the station in |
https://en.wikipedia.org/wiki/Canal%20Road%20%28TV%20series%29 | Canal Road is an Australian television drama series on the Nine Network. The series was produced in-house, under producer Susan Bower, in collaboration with writers Sarah Smith, John Ridley and Dave Warner, and directed by Kevin Carlin. It was filmed at Channel Nine’s GTV Studio 11 and on location in and around Melbourne. The series reportedly cost A$10 million to produce.
The 13-part series went to air from 16 April 2008. The series debuted to mixed critical reception and only average ratings, which were further eroded when the series was moved to a later timeslot. Nine removed Canal Road from its schedules after the seventh episode, which drew in only 360,000 viewers; however the eighth episode was still made available online. Nine eventually aired the remaining episodes during August and December 2008.
Canal Road was released on DVD on 4 August 2008 in Australia.
Synopsis
Canal Road is a medical and legal advisory centre where the lives of inner-city professionals and their patients entwine in a story of mystery and intrigue. At the heart of the series are the tragic deaths of the wife and son of central character Spencer MacKay. Spencer is the centre's psychiatrist who is confronted by the killer of his loved ones and sets out on a journey of revenge which will implicate friends, workmates and his darkest demons.
Cast
Paul Leyden as Spencer MacKay
Diana Glenn as Olivia Bates
Brooke Satchwell as Bridget Keenan
André De Vanny as Danny Havesco
Patrick Brammall as Steve Yunnane
Peta Sergeant as Holly Chong
Charlie Clausen as Tom Squires
Alyssa McClelland as Skye Brady
Sam Anderson as Henry Walter
Grant Bowler as Detective Ray Driscoll
Sibylla Budd as Daina Connelly
Internet downloads
Since 1 April 2008, full episodes of Canal Road were offered as a free download as part of ninemsn's "Catch Up TV" service, with new episodes made available before their broadcast on Nine. In order to view them a third-party video player must be downloaded, which includes advertisements in the file and disables the ability to skip the ads.
Episodes were later made available for purchase through the iTunes Store.
Episode list
Ratings
See also
List of Australian television series
References
External links
Canal Road website
Catch Up TV – Canal Road – Full episode downloads of Canal Road
2008 Australian television series debuts
2008 Australian television series endings
2000s Australian drama television series
Nine Network original programming
Television shows set in Victoria (state) |
https://en.wikipedia.org/wiki/Got%C5%8Dji%20Line | The is a Japanese railway line in Fukuoka Prefecture connecting Tagawa-Gotōji Station in the city of Tagawa and Shin-Iizuka Station in the city of Iizuka. It is part of the JR Kyushu network.
Basic data
Operator, distances:
Kyushu Railway Company (JR Kyushu) (Services and tracks)
Tagawa-Gotōji – Shin-Iizuka:
Gauge: Narrow gauge,
Stations: 6
Double-tracking: None
Electrification: None
Railway signalling: Special automatic
Station list
All stations are located in Fukuoka Prefecture.
Rapid trains, which only operate in the direction of Tagawa-Gotōji, stop at stations marked "●" and pass stations marked "↑".
History
The Hōshū Railway Co. opened the central section of the line in 1897 to haul freight, the company merging with the Kyushu Railway Co. in 1901, which extended the line to Kami-Mio in 1902. That company was nationalised in 1909, and the line extended to Shin-Iizuka in 1920 with passenger services to Funao introduced at that time.
The Kyushu Industrial Railway Co. opened the Funao - Tagawa-Gotoji section in 1922 to service a cement plant. That company was nationalised in 1943, creating the current line. Passenger services were extended to Tagawa-Gotoji in 1945, and freight services ceased in 1987.
Former connecting lines
Shimo-Kamoo station -
A 1 km line to the Asakasa coal mine operated from 1926 until 1945.
The 8 km Urushio line to Shimo-Yamada (on the Kami-Yamada line, closed in 1986) opened between 1908 and 1913 as a freight line, with passenger services introduced in 1920. Freight services ceased in 1974, and the line closed in 1986.
References
Lines of Kyushu Railway Company
1067 mm gauge railways in Japan
Railway lines opened in 1897 |
https://en.wikipedia.org/wiki/Chityala%2C%20Jayashankar%20Bhupalpally%20district | Chityala is a village and a mandal in Jayashankar Bhupalpally district in the state of Telangana in India.
Map
https://www.google.co.in/maps/place/Chityal,+Telangana/@18.3296269,79.66992,14z/data=!4m2!3m1!1s0x3a333cb5f29d9775:0xdb3300e5d741c473?hl=en
See also
Dwarakapet
Pangidipalle
References
Mandals in Jayashankar Bhupalpally district
Villages in Jayashankar Bhupalpally district |
https://en.wikipedia.org/wiki/New%20Internet%20Computer | The New Internet Computer (NIC) was a Linux-based internet appliance released July 6, 2000 by Larry Ellison's and Gina Smith's New Internet Computer Company. The system (without a monitor) sold for US$199.
The NIC boots from a CD-ROM with a custom Linux distribution developed by Wim Coekaerts. It has no hard drive and no way to install additional software. The system's only nonvolatile storage is 4 MB of flash memory.
Ellison planned to sell 5 million units the first year, but fewer than 50,000 units were sold. The company shut its doors in June 2003. PC World ranked the NIC as the ninth worst PC of all time.
References
External links
Internet Appliance Eliminates Hard Drive J.D. Biersdorfer, New York Times, September 28, 2000
Wim Coekaerts is Oracle's Mr. Linux Steve Lipson, Oracle Magazine
Linux and the New Internet Computer Billy Hall, Linux Journal, February 2001
Personal computers |
https://en.wikipedia.org/wiki/ALGOL%2068RS | ALGOL 68RS is the second ALGOL 68 compiler written by I. F. Currie and J. D. Morrison, at the Royal Signals and Radar Establishment (RSRE).
Unlike the earlier ALGOL 68-R, it was designed to be portable, and implemented the language of the Revised Report.
Versions of ALGOL 68RS were written for the ICL 2900 Series, Multics, and VAX running VMS.
Subsequently, parts of this compiler were released into the public domain, as a translator from ALGOL 68 to C, as part of the public release of the hardware description language ELLA, also by the RSRE.
History
Although the ALGOL 68-R compiler, written by I.F. Currie, J.D. Morrison, and S.G. Bond, was a great success, it suffered from two major problems: it had been written for the nearly obsolete ICL 1900 computer, and it implemented an out-of-date version of the language as it was released before the Revised Report on ALGOL 68 was available.
RSRE needed a newer compiler for various internal projects, so the team of Currie and Morrison wrote a new compiler designed for cross-platform software portability between machines. The compiler dealt with the parsing of ALGOL 68, producing a high level intermediate language known as stream language that is then compiled to machine code by a translator. The compiler needed to know only the sizes of the various object machine data types and the character encoding (set) available.
The compiler was written in ALGOL 68, bootstrapped initially using the ALGOL 68-R compiler.
A team of two programmers at Oxford University Computing Services wrote a code generator for the ICL 2900 series.
Martyn Thomas of South West Universities Regional Computer Centre (SWURCC) arranged that this system be sponsored by International Computers Limited (ICL) and sold as an official ICL product.
Later, the Avon Universities Joint Computer Centre, a large user of Multics requested the SWURCC team to produce a Multics version of ALGOL 68RS. A version for the Digital Equipment Corporation (DEC) VAX computer was also written.
Eventually the team at SWURCC formed a company, Praxis, initially supporting the Multics version of ALGOL 68RS.
RSRE also used the ALGOL 68RS compiler for internal projects, including the Flex machine and the ELLA hardware design language. When it was decided to make ELLA freely available, Praxis was commissioned to write an ALGOL 68 to C translator named ctrans, based on the ALGOL 68RS compiler.
Restrictions in the language compiled
Like the earlier ALGOL 68-R compiler, ALGOL 68RS was a one-pass compiler, which required some restrictions on the language compiled.
Declaration before use
The ALGOL 68 program:
PROC even = (INT number) BOOL: ( number = 0 | TRUE | odd (ABS (number - 1)));
PROC odd = (INT number) BOOL: ( number = 0 | FALSE | even (ABS (number - 1)));
would have to be re-written as:
PROC (INT) BOOL odd;
PROC even = (INT number) BOOL : ( number = 0 | TRUE | odd (ABS (number - 1)));
odd := (INT number) BOOL : ( number = 0 | FALSE | even (ABS (number |
https://en.wikipedia.org/wiki/S3%20%28programming%20language%29 | S3 is a structured, imperative high-level computer programming language. It was developed by the UK company International Computers Limited (ICL) for its 2900 Series mainframes. It is a system programming language with syntax influenced by ALGOL 68 but with data types and operators aligned to those offered by the 2900 Series. It was the implementation language of the operating system VME.
Annotated Example
A rare example of an S3 program available in the public domain is the implementation of Kermit developed at the South-West Universities Regional Computer Centre, and archived in the Columbia University archive of Kermit implementations. The examples below are selected highlights of the main module (kmt_main_module).
The program starts with a module identification, and comments which we quote by way of acknowledgment to the authors:
MODULE KMT_MAIN_MODULE; @ Version 1.01 @
@------------------------------------------------------------------------------@
@ @
@ @
@ ----- S W U R C C V M E K E R M I T ----- @
@ @
@ @
@ ---------------------------------------------------------------- @
@ @
@ @
@ Version 1.00 (February 1986) @
@ @
@ Written by : Richard Andrews and David Lord, @
@ South West Universities Regional Computer Centre, @
@ Claverton Down, Bath BA2 7AY, U.K. @
@ @
@ @
@ ---------------------------------------------------------------- @
@ @
@ @
@ Version 1.01 (October 1986) @
@ @
@ Fixes by : Dave Allum and David Lord, SWURCC. @
@ ---------------------------------------------------------------- @
Next follow a number of "mode declarations". Mode is the Algol 68 term for a type.
MODE KMT_BUFFER IS (96)BYTE;
MODE KMT_STRING IS REF()BYTE;
MODE KMT_WORD IS REF()BYTE;
M |
https://en.wikipedia.org/wiki/Videcom%20International | Videcom International Limited is a United Kingdom travel technology company based in Henley-on-Thames. It designs, develops and provides modern computer reservations systems to airlines and the travel industry, specializing in the hosting and distribution of airline sales.
The system is connected to the Global Distribution Systems of Sabre, Amadeus, Galileo, Worldspan and Abacus, which travel agents use to make airline bookings, and is also connected to other airline systems for interline bookings. The IATA airline designator for Videcom is U1.
History
Founded in 1972, the company originally manufactured computer terminals for uses throughout the aviation and travel sectors, including airline reservation centers, airport operations and travel agency systems. Over 450,000 computer terminals were manufactured between 1972 and 2002 and refurbishments are still supported today, with many units still in use globally at airlines and airports. The company diversified into airline software development in 1987.
In 1976, Videcom International along with British Airways, British Caledonian and CCL, launched Travicom, the world's first multi-access reservations system. It was wholly based on Videcom technology. They formed a network to thousands of travel agents in the UK providing distribution for 49 subscribing international airlines, including British Airways, British Caledonian, TWA, Pan American World Airways, Qantas, Singapore Airlines, Air France, Lufthansa, SAS, Air Canada, KLM, Alitalia, Cathay Pacific, JAL) and some African airlines. It allowed agents and airlines to communicate via a common distribution language and network, handling 97% of UK airline business trade bookings by 1987.
The system went on to be replicated by Videcom in other areas of the world including the Middle East (DMARS), New Zealand, Kuwait (KMARS), Ireland, Caribbean, United States and Hong Kong. The Travicom multi access system was eventually replaced by Galileo in the UK and in 1988, Travel Automations Services Ltd (trading as Travicom) changed its trading name to Galileo UK and agents using Travicom were migrated to Galileo.
Since the late 1980s to the current day, Videcom has continued to develop products mostly related to airlines and airports, including terminal emulator software, airport check-in systems, Common Use Terminal Equipment (CUTE), Aircraft Weight and Balance systems, Unit Load Device management, and a modern Airline Reservations System, including an integrated Departure Control System.
In 2004, Videcom sold some of their standalone products, such as standalone DCS, Weight and Balance and the Common Use System, to Ultra Electronics.
The new product suite, which the company has provided to approximately 35 airlines since 2001, includes VRS, the Airline Reservations Systems and an integrated Departure Control System used by regional and international airlines.
Products used by airlines today
Inventory Hosting
Airline Hosting Platform
Fare Distribution
|
https://en.wikipedia.org/wiki/HP%20OpenCall | HPE OpenCall is a range of network and telephony products offered by the "Communications & Media Solutions" branch of technology company HPE. It is most commonly described as a suite of software and hardware applications which allow implementation of common telecom operator services such as voicemail, sms (short message service), prepaid, billing, hlr, etc. It implements industry standard telecom protocols and standards such as SS7, ISUP, TCAP, SIP, MRCP, RTSP, and VoiceXML.
Products
The HPE OpenCall line of telecommunications platforms is offered by HPE Communications & Media Solutions organization in four main areas—media server, service and charging control, signaling, and subscriber mobility. The HPE OpenCall Media Platform is a voice and video server and media resource function platform used for developing and deploying messaging, portals and interactive services.
HPE offers three service and charging platforms for telecommunication service providers. They include HPE OpenCall Service Access Controller for prepaid and postpaid voice and data services; HP OpenCall Service Controller, an open platform for constructing multi-network-based services and developing applications in 2G and 3G architectures; and the HP OpenCall Intelligent Network Server used for operations like e911 on legacy wireline, wireless and next-generation communication systems.
There are three HPE OpenCall signaling platforms. The HPE Open IP Signaling Transfer Gateway that allows the convergence and delivery of advanced services for fixed, mobile and broadband networks. The HPE OpenCall SIP Network Server is an “all-in-a-box” Session Initiation Protocol network element for next generation and IMS networks, facilitating the deployment and growth of advanced telecommunication services. The HP OpenCall Universal Signaling Platform (USP) connects SS7 and IP SIGTRAN networks and provides a development environments for deploying, 2G, 2.5G and 3G services.
HPE Communications & Media Solutions markets three subscriber mobility products. The HPE Home Location Register and Home Subscriber Server (HLR/HSS) are used for subscriber management and new service deployment via a centralized system. The HP OpenCall Position Determination Entity is a location information platform that is used by emergency and commercial services to pinpoint a mobile terminal's position. The HPE OpenCall XML Document Management Server is used for deploying instant messaging and group communication services while shielding information privacy.
There are two subscriber policy offerings. The HPE OpenCall Home Subscriber Server is used to store and manage subscriber data when moving to next-generation networks. The HPE OpenCall Profile Manager connects user profile and service data for Web 2.0 services.
References
Computer networking
System administration
OpenCall |
https://en.wikipedia.org/wiki/Adversarial%20information%20retrieval | Adversarial information retrieval (adversarial IR) is a topic in information retrieval related to strategies for working with a data source where some portion of it has been manipulated maliciously. Tasks can include gathering, indexing, filtering, retrieving and ranking information from such a data source. Adversarial IR includes the study of methods to detect, isolate, and defeat such manipulation.
On the Web, the predominant form of such manipulation is search engine spamming (also known as spamdexing), which involves employing various techniques to disrupt the activity of web search engines, usually for financial gain. Examples of spamdexing are link-bombing, comment or referrer spam, spam blogs (splogs), malicious tagging. Reverse engineering of ranking algorithms, click fraud, and web content filtering may also be considered forms of adversarial data manipulation.
Topics
Topics related to Web spam (spamdexing):
Link spam
Keyword spamming
Cloaking
Malicious tagging
Spam related to blogs, including comment spam, splogs, and ping spam
Other topics:
Click fraud detection
Reverse engineering of search engine's ranking algorithm
Web content filtering
Advertisement blocking
Stealth crawling
Troll (Internet)
Malicious tagging or voting in social networks
Astroturfing
Sockpuppetry
History
The term "adversarial information retrieval" was first coined in 2000 by Andrei Broder (then Chief Scientist at Alta Vista) during the Web plenary session at the TREC-9 conference.
See also
Information retrieval
Spamdexing
References
External links
AIRWeb: series of workshops on Adversarial Information Retrieval on the Web
Web Spam Challenge: competition for researchers on Web Spam Detection
Web Spam Datasets: datasets for research on Web Spam Detection
Information retrieval genres
Internet fraud |
https://en.wikipedia.org/wiki/R%20%28Datafin%20plc%29%20v%20Panel%20on%20Take-overs%20and%20Mergers | R v Panel on Take-overs and Mergers; Ex parte Datafin plc [1987] QB 815 is a UK constitutional law, company law and administrative law case of the Court of Appeal. It extended the scope of judicial review in English law to private bodies exercising public functions. Before Datafin, only bodies established by statute could be judicially reviewed, while private bodies could only be sued for their actions in contract or tort law.
Facts
The Panel on Take-overs and Mergers is the City of London's self-regulating mechanism for dealing with mergers and acquisitions. The applicant complained about a breach of the Panel code by another company involved in the process and were unhappy with the Panel's decision. The case ended up in the Court of Appeal, due to the fact that the High Court felt that it had before it a matter that was outside its jurisdictional reach. Because it considered that the defendant wasn't amenable to judicial review, it wasn't able to grant the claimant the required leave to continue on with the claim.
The main issue facing the Court was whether to review the decision of a Panel set up under private law using the standards usually applied in administrative law.
Judgment
The Court of Appeal held that the powers exercised by the Panel (regulating take-overs and enforcing a code of conduct on them) were essentially in the domain of public law and formed part of the Government's scheme to regulate the City. Those affected had no choice but to submit to the Panel's jurisdiction. As a result, the Panel had the duty to act judicially and its decisions could be checked by means of judicial review. On the merits, however, the Court found no ground to quash the disputed decision.
Sir John Donaldson, the Master of the Rolls, gave the leading judgment.
Significance
This decision is important in the light of an increasing "privatization" of public powers. In recent years, the Government has delegated many of its powers to formally private bodies, which nevertheless can make decisions affecting individual citizens and the society at large. Following the Datafin case, such decisions are now amenable to judicial review by courts.
In the later case of R v Panel on Takeovers and Mergers, ex parte Guinness plc, the judicial authority of the Panel was tested further in respect of the manner in which it handles investigations into breaches of the City Code on Takeovers and Mergers. In this case, the Panel refused to adjourn the appellant's hearing which related to its takeover of Distillers Co plc, in undisclosed concert with a Swiss bank, for which the Court of Appeal held that less there was any real injustice caused by the Panel's procedure, it would take exceptional circumstances for the court to intervene (particularly in the event, as was the case, that the appellant had not made use of the appeals tribunal existing within the realms of the Panel).
See also
UK constitutional law
UK company law
Notes
1986 in United Kingdom case law
1986 i |
https://en.wikipedia.org/wiki/SedDB | SedDB was created as an online data management and information system for sediment geochemistry.
SedDB is based on a relational database that contains the full range of analytical values for sediment samples, primarily from marine sediment cores, including major and trace element concentrations, radiogenic and stable isotope ratios, and data for all types of material such as organic and inorganic components, leachates, and size fractions. SedDB also archives a vast array of metadata relating to the individual sample. Examples of Seddb metadata are: sample latitude and longitude; elevation below sea surface; material analyzed; analytical methodology; analytical precision and reference standard measurements. As of April, 2013 SedDB contains nearly 750,000 individual analytical data points of 104,000 samples. SedDB contents have been migrated to The EarthChem Portal.
Purpose
SedDB was developed to complement current geological data systems (PetDB, EarthChem, NavDat and Georoc) with an integrated and easily accessible compilation of geochemical data of marine and continental sediments to be utilized for sedimentological, geochemical, petrological, oceanographic, and paleoclimate research, as well as for educational purposes.
Funding and management
SedDB was developed, operated and maintained by a joint team of disciplinary scientists, data scientists, data managers and information technology developers at the Lamont–Doherty Earth Observatory as part of the Integrated Earth Data Applications (IEDA) Research Group funded by the US National Science Foundation. SedDB was built collaboratively by researchers and information technologists at the Lamont–Doherty Earth Observatory, Oregon State University, Boston University, and Boise State University.
References
External links
EarthChem Portal
Lamont Doherty Earth Observatory
Petrological Database of the Ocean Floor
Earthchem
EarthChem Library
Geochemistry |
https://en.wikipedia.org/wiki/Consumer%20Action%20Network | The Consumer Action Network (CAN) is a tax-exempt, not-for-profit, professional peer advocacy program incorporated in the District of Columbia in February 2003. The organization’s mission is to empower mental health consumers by promoting recovery and self-advocacy.
"CAN’s Executive Team consists of Directors and Co-founders Effie Smith, Director of Advocacy/Program Development, and Mary Blake, (no longer with CAN) Director of Training/Communications. Both Directors have served on national and local boards and advisory groups, including SAMHSA’s National Anti-Stigma Campaign Work Committee, the DC Partnership Council, the National Center for Trauma-informed Care, and the State Mental Health Planning Council, among others. CAN is also a member of the newly formed National Coalition of Mental Health Consumer/Survivor Organizations (NCMHCSO)."
Sources
Mental health organizations in Washington, D.C. |
https://en.wikipedia.org/wiki/SQL%20Server%20Compact | Microsoft SQL Server Compact (EOL, See SQL Express) (SQL CE) is a compact relational database produced by Microsoft for applications that run on mobile devices and desktops. Prior to the introduction of the desktop platform, it was known as SQL Server for Windows CE and SQL Server Mobile Edition.
It includes both 32-bit and 64-bit native support. SQL CE targets occasionally connected applications and applications with an embedded database. It is free to download and redistribute. An ODBC driver for SQL CE does not exist, nor is one planned. Native applications may use SQL CE via OLE DB.
The latest, and last, release is the SQL Server Compact 4.0. In February 2013 SQL Server Compact Edition had been deprecated; no new versions or updates are planned, although Microsoft continued to support the product until July 2021.
Overview
SQL Server Compact shares a common API with the other Microsoft SQL Server editions. It also includes ADO.NET providers for data access using ADO.NET APIs, and built-in synchronization capabilities, as well as support for LINQ and Entity Framework. Future releases will unify the synchronization capabilities with Microsoft Synchronization Services. Unlike other editions of Microsoft SQL Server, SQL CE runs in-process with the application which is hosting it. It has a disk footprint of less than 2 MB and a memory footprint of approximately 5 MB. SQL CE is optimized for an architecture where all applications share the same memory pool.
Windows Store apps for Windows 8 cannot use SQL Server Compact edition, or any other edition of SQL Server.
Support
SQL CE databases can support ACID-compliance, but do not meet the durability requirement by default because AutoFlush buffers changes in memory (including enlisted ambient transactions and explicit SQL CE transactions that do not override the Commit() call with an CommitMode.Immediate value). Therefore, committed transaction changes can be lost. To meet the durability requirement the commit call on the transaction must specify the immediate flag. Like Microsoft SQL Server, SQL CE supports transactions, referential integrity constraints, locking as well as multiple connections to the database store. However, nested transactions are not supported, even though parallel transactions (on different tables) are. The current release does not support stored procedures or native XML data type either. It uses a subset of T-SQL for querying and due to lack of XML support, XQuery is not supported either. Queries are processed by an optimizing query processor. SQL CE databases also support indexing, as well as support remote data replication (local caching of data in remote databases) and merge replication (bidirectional synchronization with master databases).
SQL CE databases can be created and managed from Microsoft Visual Studio and some older versions of SQL Server Management Studio as well.
File format
SQL CE databases reside in a single .sdf file, which can be up to 4 GB in size. |
https://en.wikipedia.org/wiki/HTC%20P4350 | The HTC P4350 is a Pocket PC smartphone manufactured by High Tech Computer Corporation (HTC) of Taiwan. It is also known as the HTC Herald, T-Mobile Wing, and XDA Terra. An updated model running Windows Mobile 6, the HTC P4351, has been sold as the HTC Atlas. It features a right-side QWERTY slide and runs the Windows Mobile 6.0/6.1 Professional Edition operating system.
Basics
Size: 2.3 x 4.3 x 0.7 inches
Weight: 6 ounces
Internal battery: Li-Ion polymer
Talk time: up to 4 hours
Standby time: up to 6 days
Band (frequency): 850 MHz; 900MHz ;1800MHz; 1900 MHz
Features
Windows Mobile 6.0/6.1 (P4351 and P4350 under some licenses) or Windows Mobile 5 (P4350)
Built-in right side QWERTY Keypad
GPRS/EDGE and Wi-Fi enabled
2.0-megapixel camera (2.0 After Quality Loss from origin 2.3)
E-mail
myFaves capable
Voice-activated functions
MicroSD memory slot (P4351: MicroSDHC)
Bluetooth wireless technology
Video camera
Picture messaging
Real web browsing
Instant messaging: Yahoo!, MSN, and AOL
Quad-band world phone (850/900/1800/1900 MHz)
Text messaging
Speaker phone
Wireless calendar synchronization with Outlook
Windows Media Player
Services
Call Forwarding
Call Waiting
Caller ID
Customer Care
Emergency Calls
Messaging
Instant messaging: Yahoo!, MSN, and AOL instant messaging, and text messaging.
For Google GTalk users, there is a Java-based free client available, called MGtalk.
The HTC P4350 can connect to Microsoft Office Communication Server using the Office Communicator 2007 Mobile client which allows chat with users on corporate network and access to a corporate address book.
The VoIP client Skype works well on WiFi, but it will inhibit performance of the device. WiFi drains the battery quickly.
It has Outlook Mobile as email client, which works well with most of the email service providers and supports standard protocols like POP, IMAP, SMTP. The push-mail functionality works with Exchange 2003 SP2, Exchange 2007 and above email servers using the ActiveSync protocol.
The P4350 is equipped with a slide out qwerty keyboard.
External links
Official Spec Sheet
Official support page at HTC
Official T-Mobile Page
Official Windows Mobile Page
HTC Source: a news blog dedicated to HTC devices
HTC Wiki Page: The official HTC Smartphone Forum.
P4350
Windows Mobile Professional devices
Mobile phones with an integrated hardware keyboard |
https://en.wikipedia.org/wiki/Society%20for%20International%20Hockey%20Research | The Society for International Hockey Research (SIHR) is a network of writers, statisticians, collectors, broadcasters, academics and ice hockey buffs. The society, based in Toronto, Ontario, has an international membership. The society cultivates and encourages the study of ice hockey. The society has been prominent in determining the origins of ice hockey.
History
The society was formed in 1991. A group of 17 members attending the Canadian Association of Sports Heritage meeting at Kingston, Ontario, met in a special session with the aim of founding an organization dedicated to promoting, developing and encouraging the study of hockey, to establish an accurate historical account of the game, and to assist in the dissemination of the findings and studies derived from member research. Under the leadership of founding president Bill Fitsell, a retired journalist with the Kingston Whig-Standard, SIHR's general objectives were: "To encourage and cultivate the study of ice hockey as an important athletic and social institution in Canada and other countries in which it was played." A six-page, 25-article constitution was adopted at Montreal on May 22, 1993.
Among the charter members, also known as the "Kingston 17," were representatives from three provinces (New Brunswick, Quebec and Ontario) and two states (Illinois and New York). In its fledgling year, the society membership grew to 29 and in its second year the roster of 52 could be typed on one page. SIHR's membership list today stands at more than 550, with members in all ten Canadian provinces, 31 U.S. states and the District of Columbia, plus Australia, England, Finland, France, Germany, Italy, Japan, Russia, Scotland, Slovakia, Sweden, Switzerland and Wales. SIHR counts among its members a former Prime Minister of Canada, Stephen Harper.
At its 2001 annual meeting, SIHR struck a committee to examine the claim of Windsor, Nova Scotia, to be the birthplace of ice hockey. The committee's report, released in May 2002, that the Windsor proponents had not offered credible evidence that the town was the birthplace of hockey. The report expressed no opinion on when or where hockey originated.
The SIHR committee indicated that the March 3, 1875 game at the Victoria Skating Rink in Montreal was the earliest documented ice hockey game that it was aware of. "It is the earliest eyewitness account known, at least to this SIHR committee, of a specific game of hockey in a specific place at a specific time, and with a recorded score, between two identified teams."
In 2003, SIHR started developing its statistical database, available to members on its web site. Starting with the paper records, combined with the input of a 10,000 player database, SIHR's database has grown to include hundreds of thousands, coaches and officials. The database includes statistics dating back to the 1886–87 season for various professional, semi-professional and amateur male and female leagues. The player profiles include notes, bi |
https://en.wikipedia.org/wiki/Schema%20matching | The terms schema matching and mapping are often used interchangeably for a database process. For this article, we differentiate the two as follows: schema matching is the process of identifying that two objects are semantically related (scope of this article) while mapping refers to the transformations between the objects. For example, in the two schemas DB1.Student (Name, SSN, Level, Major, Marks)
and DB2.Grad-Student (Name, ID, Major, Grades); possible matches would be: DB1.Student ≈ DB2.Grad-Student; DB1.SSN = DB2.ID etc. and possible transformations or mappings would be: DB1.Marks to DB2.Grades (100-90 A; 90-80 B: etc.).
Automating these two approaches has been one of the fundamental tasks of data integration. In general, it is not possible to determine fully automatically the different correspondences between two schemas — primarily because of the differing and often not explicated or documented semantics of the two schemas.
Impediments
Among others, common challenges to automating matching and mapping have been previously classified in especially for relational DB schemas; and in – a fairly comprehensive list of heterogeneity not limited to the relational model recognizing schematic vs semantic differences/heterogeneity. Most of these heterogeneities exist because schemas use different representations or definitions to represent the same information (schema conflicts); OR different expressions, units, and precision result in conflicting representations of the same data (data conflicts).
Research in schema matching seeks to provide automated support to the process of finding semantic matches between two schemas. This process is made harder due to heterogeneities at the following levels
Syntactic heterogeneity – differences in the language used for representing the elements
Structural heterogeneity – differences in the types, structures of the elements
Model / Representational heterogeneity – differences in the underlying models (database, ontologies) or their representations (key-value pairs, relational, document, XML, JSON, triples, graph, RDF, OWL)
Semantic heterogeneity – where the same real world entity is represented using different terms or vice versa
Schema matching
Methodology
Discusses a generic methodology for the task of schema integration or the activities involved. According to the authors, one can view the integration.
Preintegration — An analysis of schemas is carried out before integration to decide upon some integration policy. This governs the choice of schemas to be integrated, the order of integration, and a possible assignment of preferences to entire schemas or portions of schemas.
Comparison of the Schemas — Schemas are analyzed and compared to determine the correspondences among concepts and detect possible conflicts. Interschema properties may be discovered while comparing schemas.
Conforming the Schemas — Once conflicts are detected, an effort is made to resolve them so that the merging of various schem |
https://en.wikipedia.org/wiki/Michael%20H.%20Albert | Michael Henry Albert (born September 20, 1962) is a mathematician and computer scientist, originally from Canada, and currently a professor in the computer science department at the University of Otago in Dunedin, New Zealand. His varied research interests include combinatorics and combinatorial game theory.
Education and career
Albert received his B.Math in 1981 from the University of Waterloo. In that year Albert received the Rhodes Scholarship, and he completed his D. Phil. in 1984 at the University of Oxford. He then returned to the University of Waterloo. From 1987 to 1996 he was a professor at Carnegie Mellon University. Albert has been at the University of Otago since 1998.
Contributions
Together with J.P. Grossman and Richard Nowakowski, Albert invented the game Clobber. Albert has also contributed to the Combinatorial Game Suite game analysis software, and is a coauthor of Lessons in Play: An Introduction to Combinatorial Game Theory. Another significant topic of his research has been permutation patterns.
See also
List of University of Waterloo people
References
External links
Michael H. Albert's page at the University of Otago
Living people
1962 births
20th-century Canadian mathematicians
21st-century Canadian mathematicians
Canadian computer scientists
Canadian expatriates in New Zealand
Canadian Rhodes Scholars
People from Penetanguishene
Combinatorial game theorists
Academic staff of the University of Otago
University of Waterloo alumni |
https://en.wikipedia.org/wiki/WEVC | WEVC (107.1 FM) is a radio station licensed to Gorham, New Hampshire. The station is owned by New Hampshire Public Radio, and is an affiliate of their public radio network.
The station signed on in May 1995 as commercial station WXLQ. The station carried country music and classic rock formats during its five years of commercial operation. In 1999, founder Gladys Powell sold the station to NHPR, which made it part of its network on January 10, 2000. It is the only station to be acquired by NHPR (all other NHPR stations were built and signed on by the network).
References
External links
nhpr.org
EVC
Coös County, New Hampshire
Radio stations established in 1995
NPR member stations |
https://en.wikipedia.org/wiki/WJCM | WJCM is a commercial radio station in Sebring, Florida, broadcasting to the Sebring area on 1050 AM. WJCM's format is sports, with programming from ESPN Radio.
WJCM is in Highlands County, Florida.
WJCM originally broadcast on 960 AM. For many years the studios located in downtown Sebring on Commerce St. On-air personalities included Ron Wilson, who also served as program director, and John Wright.
On July 1, 2016, WJCM changed their format from oldies to sports, with programming from ESPN Radio.
Translators
In addition to the main station, WJCM is relayed by an FM translator.
External links
JCM
Radio stations established in 1950
1950 establishments in Florida
Sports radio stations in the United States |
https://en.wikipedia.org/wiki/Petrological%20Database%20of%20the%20Ocean%20Floor | The Petrological Database of the Ocean Floor (PetDB) is a relational database for global geochemical data on igneous and metamorphic rocks generated at mid-ocean ridges including back-arc basins, young seamounts, and old oceanic crust, as well as ophiolites and terrestrial xenoliths from the mantle and lower crust and diamond geochemistry. These data are obtained by analyses of whole rock powders, volcanic glasses, and minerals by a wide range of techniques including mass spectrometry, atomic emission spectrometry, x-ray fluorescence spectrometry, and wet chemical analyses. Data are compiled from the scientific literature by PetDB data managers, and entered after methodical metadata review. Members of the scientific community can also suggest entry of specific data that has been entered into the EarthChem Library. PetDB is administered by the EarthChem group under the IEDA facility at LDEO headed by K. Lehnert. PetDB is supported by the U.S. National Science Foundation.
About
Developments of PetDB began in 1995, by Lamont–Doherty Earth Observatory (LDEO) scientists C. Langmuir (now at Harvard University), W. Ryan, and A. Boulanger, when they realized what impact the World Wide Web and relational databases could have on the use of scientific data in research and in the classroom.
The initial funding phase of PetDB (1996–2001) supported the development of the database structure and population with data values. Renewed funding (2002–2007) permitted the migration of the database into an ORACLE-based environment administered by the Center for International Earth Science Information Network (CIESIN) of Columbia University, continued data entry, and enhancement of the web-interface with a more user-friendly design.
PetDB is now maintained by EarthChem and funded by the US National Science Foundation, and is governed by the Interdisciplinary Earth Data Alliance facility as part of an ecosystem of related projects, including The System for Earth Sample Registration (SESAR), and the Astromaterials Data System (AstroMat).
Since its inception, PetDB has supported a wide array of scientific endeavors, providing easy access to a comprehensive global dataset of geochemical data for mid-ocean ridge basalts, abyssal peridotites and also xenolith samples from the Earth's mantle and lower crust.
The relational database structure of PetDB is a sample-based implementation, and designed to accommodate chemical, isotopic and mineralogical data for any type of rock sample, along with essential metadata, which provide information about each sample (e.g. location and time of collection, taxonomy, petrographic description) and the data quality, including analytical procedure, reference standard measurements etc. (Lehnert et al. 2000).
Initially developed for PetDB and its European counterpart, GEOROC, this relational data model has demonstrated utility and flexibility by its application in subsequent geochemical database projects including several collaborations th |
https://en.wikipedia.org/wiki/Genuine%20Scooters | Genuine, or The Genuine Scooter Company is a Chicago-based manufacturer of motorscooters, notably the Stella and Buddy models. The company markets scooters and accessories through a network of over 240 dealers in the United States. In 2018 it began selling a 400cc air-cooled, single-cylinder motorcycle, under a sister brand 'Genuine Motorcycles'.
History
Founded in 2002, the company was an extension of the vintage scooter business, Scooterworks USA, which sold vintage Vespa and Lambretta scooters via a mail-order catalog, featuring scooter parts and accessories. Scooterworks USA continues to specialize in aftermarket parts and accessories for Genuine, Vespa, Honda, Yamaha, and other scooter brands including Chinese scooters.
Genuine Scooters' first model was a 4-speed manual, two-stroke 150CC "Stella" model, manufactured by LML in India in the year 2002. The Stella was successful, and in 2006 the company began a relationship with PGO Scooters, a Taiwanese manufacturer. Genuine developed the "Buddy", an automatic scooter with a CVT. The Buddy features several engine sizes and versions ranging from 49cc, licensed as a moped in many US states, to 170cc with fuel injection. Later introductions were the Rattler 110 (discontinued), the Roughhouse 50, designed more aggressively than the previous classic designs, and the Blur 220i (discontinued), a scooter with a higher-powered fuel-injected engine capable of maintaining expressway speeds. In 2010, Genuine introduced a version of the Stella with a redesigned 150cc four-stroke engine compliant with California emissions standards, and a 170cc version of the Buddy with fuel injection instead of a carburetor. Following these introductions, and as a result of the economic crash of 2008, it received additional capitalization through investment banker Livingstone Partners. In 2014, the Stella 125 Automatic was introduced, the first Stella with an automatic (CVT) transmission and a newly redesigned high output 125cc engine.
From time to time, Genuine produces special limited-edition scooters. These include a "GB150" version of the Stella with British-themed trim, a Black Cat Fireworks scooter similar to the Roughhouse, a high-performance "Psycho" Buddy 125, A high-performance Riot Buddy 50 and Buddy 125, and (in conjunction with neighboring Ferrara Pan Candy Company) the Atomic Fireball Stella and a Lemonhead Buddy 50. In late 2015 they introduced the special diamond edition 10-Year Anniversary Buddy 50 & 125, celebrating ten years of Buddy.
In 2015, a second sister scooter company was created, 'Chicago Scooter Company to offer a value-based line of scooters to compete with the lower-priced Chinese scooters in the market. As of 2019, their two models are the "go." and "go. MAX", both 50cc 4 T-based scooters.
Products
Genuine Scooters features the following scooters in its product line as of January 2019:
Buddy 50 (50 cc, 2T)
Buddy 125 (125 cc, 4T)
Buddy 170i (170 cc, 4T, fuel-injected)
Buddy |
https://en.wikipedia.org/wiki/FCS%20Network | The FCS Network - (Future Combat Systems) Brigade Combat Team (BCT) Network consists of five layers that deliver data to forward-deployed Army units.
When fully adopted by the Army over the next two decades, the FCS (BCT) Network will possess the adaptability and management functionality required to maintain pertinent services, while the assigned FCS Brigade Combat Team fights on a rapidly shifting battlespace. The FCS (BCT) network will also dispatch targeting and other coordinating data to Navy and Air Force components for total force integration in the battlespace.
Sensors and platforms layer
Sensors are the hardware and software that will provide FCS with the ability to "see first" and achieve situational awareness and understanding of the battlefield. Sensor layer allows soldiers to detect, identify, and track both enemy and friendly systems and to survey the terrain around them. The intelligence, surveillance and reconnaissance sensors will be integrated onto all manned and unmanned ground vehicles, and will be capable of accomplishing a variety of missions. The unmanned aerial vehicles will be able to maneuver to an area of attack and the onboard sensors will provide surveillance of targets and terrain, among other functions. In addition, FCS has two types of unattended ground sensor systems, Tactical-Unattended Ground Sensors (T-UGS) and Urban-Unattended Ground Sensors (U-UGS). T-UGS provide intelligence, surveillance, and reconnaissance awareness to the BCTs, while U-UGS support clearing operations in confined spaces or urban chokepoints. All sensors are connected to the Common Operational Picture. The Common Operational Picture (COP) gives the soldier a good overview and understanding of their battlespace.
Applications layer
The applications layer is responsible for providing the integrated ability to assess, plan, and execute network-centric mission operations using a common interface. It consists of ten software packages known as Battle Command applications. The combined capabilities of the Battle Command software packages enable full interaction among the FCS (BCTs), and provide the ability to understand the battle situation first. Understanding first is the ability to see the patterns, understand the enemy's concept of operations, his scheme of maneuver, and then exploit his decisive points and vulnerabilities. The applications layer provides the ability for cross Battlefield Functional Area (BFA) problem solving and decision aiding capability for all brigades and below echelons.
Services layer
The services layer is commonly referred to as System-of-Systems Common Operating Environment (SoSCOE). SoSCOE provides interoperability with existing systems, intra and inter platform networking (including e-mail and web services), data services and information assurance, and search capabilities. The Services Layer also contains administrative applications that provide capabilities including login service, startup, logoff, erase, alert/em |
https://en.wikipedia.org/wiki/Karger%27s%20algorithm | In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. It was invented by David Karger and first published in 1993.
The idea of the algorithm is based on the concept of contraction of an edge in an undirected graph . Informally speaking, the contraction of an edge merges the nodes and into one, reducing the total number of nodes of the graph by one. All other edges connecting either or are "reattached" to the merged node, effectively producing a multigraph. Karger's basic algorithm iteratively contracts randomly chosen edges until only two nodes remain; those nodes represent a cut in the original graph. By iterating this basic algorithm a sufficient number of times, a minimum cut can be found with high probability.
The global minimum cut problem
A cut in an undirected graph is a partition of the vertices into two non-empty, disjoint sets . The cutset of a cut consists of the edges between the two parts. The size (or weight) of a cut in an unweighted graph is the cardinality of the cutset, i.e., the number of edges between the two parts,
There are ways of choosing for each vertex whether it belongs to or to , but two of these choices make or empty and do not give rise to cuts. Among the remaining choices, swapping the roles of and does not change the cut, so each cut is counted twice; therefore, there are distinct cuts.
The minimum cut problem is to find a cut of smallest size among these cuts.
For weighted graphs with positive edge weights the weight of the cut is the sum of the weights of edges between vertices in each part
which agrees with the unweighted definition for .
A cut is sometimes called a “global cut” to distinguish it from an “- cut” for a given pair of vertices, which has the additional requirement that and . Every global cut is an - cut for some . Thus, the minimum cut problem can be solved in polynomial time by iterating over all choices of and solving the resulting minimum - cut problem using the max-flow min-cut theorem and a polynomial time algorithm for maximum flow, such as the push-relabel algorithm, though this approach is not optimal. Better deterministic algorithms for the global minimum cut problem include the Stoer–Wagner algorithm, which has a running time of .
Contraction algorithm
The fundamental operation of Karger’s algorithm is a form of edge contraction. The result of contracting the edge is a new node . Every edge or for to the endpoints of the contracted edge is replaced by an edge to the new node. Finally, the contracted nodes and with all their incident edges are removed. In particular, the resulting graph contains no self-loops. The result of contracting edge is denoted .
The contraction algorithm repeatedly contracts random edges in the graph, until only two nodes remain, at which point there is only a single cut.
The key idea of the algorithm is that it is far more likely for non min-c |
https://en.wikipedia.org/wiki/Steelbox%20Networks | Steelbox Networks Inc. was a privately owned company that engineered devices to distribute, store and retrieve large amounts of video data across IP networks. The company was noted for revolutionizing the video surveillance industry through the development of a specialized digital operating system (RTIK) addressing specific needs of video security networks such as problems with large scale storage and playback control. The technology provides secure paths to distribute, store and playback large amounts of live and recorded video. Its primary customer base was businesses and organizations that use video monitoring systems, such as law enforcement, military and transportation.
Corporate history
Steelbox was founded in 2003 in Atlanta, Georgia by six engineers most of whom have worked together for 20 years and completed projects for Cisco Systems, Scientific Atlanta and Nortel Networks. The core team developed the operating system behind the Cisco PIX Firewall, which is widely used throughout the world today. The team also developed the concept of load balancing, a technology that speeds up the flow of information over the Internet by determining the best way to route data requests to the most appropriate sources. Prior to Steelbox, the founders worked for Pharsalia Technologies, which was led by Steelbox CEO, Richard "Chip" Howes. Howes holds 30 patents for designs related to securing and speeding the flow of information over the Internet.
Founders
Richard "Chip" Howes
Bill LeBlanc
Jim Jordan
Tom Bohannon
Scott Higgins
Bill Vaughan
Sample of Customers
UK Highways Agency
Moscow Metro
National Roads Telecommunication Services
Port of Oostende, Belgium Products/ Solutions
A Critic
"The New York City Transit Authority purchased 36 of these units along with a DMSS for each, and had nothing but problems. After a multitude of firmware updates, visits by their field engineers, and failures in the field, they wished they had gone with another vendor such as NICE or Teleste. It is not surprising that the company is now closed.(Robert Marshall, CTA, NYCTA)"
The units described in this quote are the 5600 NAS. This was a new product built explicitly for the NYCTA because of their cabinet depth requirement. The 5600s were Linux NAS units, not Steelbox switches (DMSS).
Companies established in 2003
Companies based in Atlanta
Networking companies |
https://en.wikipedia.org/wiki/The%20Wild%20Bunch%20%28video%20game%29 | The Wild Bunch is a computer game released in 1984 for the ZX Spectrum and 1985 for the Amstrad CPC by Firebird Software. Despite its name, it has no relation to the 1969 film but is set in the Wild West. The title refers to a fictitious gang of outlaws featured in the game, loosely based on the real Wild Bunch gang who were prominent in the 1890s.
The game music is the cowboy ballad "Streets of Laredo".
Gameplay
The Wild Bunch is a text-based adventure game, with limited use of graphics. The player controls a protagonist who finds a dying man who was attacked by a member of the Wild Bunch gang. Before dying he describes the culprit and gives the player his Colt 45, just as the local sheriff arrives on the scene. The player is assumed to be the murderer and the sheriff tries to arrest them, but they escape. The object of the game is to prove the protagonist's innocence by tracking down the real murderer and handing him over to the law. Along the way the player can also arrest and hand in other members of the gang, whose descriptions are obtained from wanted posters. Scoring is based on the money earned from rewards, gambling at poker or finding gold nuggets while travelling. The game ends if the protagonist dies due to their strength reaching zero, they are killed in a gunfight or are arrested. It is, however, won by successfully tracing, identifying and handing in the real murderer, which usually involves not killing him in a gunfight but taking him in at gunpoint.
At all times during the game the player is pursued by Charles A. Siringo of the Pinkerton Detective Agency. Charlie Siringo was a real life lawman during the time that the game was set, though the game is not based on any true story.
At the start of the game, the player can choose to start off in one of five towns. Each town has a number of premises which can be visited to obtain information about the Wild Bunch gang and how to avoid being arrested. The player can also earn money by playing poker, increase their strength by drinking in the saloon bar or buy items of use in the store. The player can travel between towns (journey time is reduced by buying a horse and saddle). When travelling, food and water are consumed on a daily basis and each day the player runs a risk of encountering enemies which must be dealt with by fleeing, fighting or bribing them. Random events such as sandstorm, rockslides and even the player's horse going lame will increase journey times. Running out of food or water reduces the player's strength and their horse can also die from this. The traveling environment will affect the supplies used. While in the plains the player's horse does not consume horse food or water, apparently finding sufficient from the plains. While traveling through the mountains or deserts, however, the player will consume water from canteens and their horse will consume horse food. If their horse runs out of food in the mountains the game will comment: "Horses don't eat rocks". If |
https://en.wikipedia.org/wiki/Fox%20Sports%20Net%20Chicago | Fox Sports Net Chicago (often branded as FSN Chicago) was an American regional sports network that was headquartered in Chicago, Illinois and was owned by Cablevision for most of its history (from 1987 to 2005). News Corporation acquired a minority ownership interest in the network in 1997, which Cablevision bought out in 2005. The network was affiliated with SportsChannel from 1987 to 1997, when it became an affiliate of Fox Sports Net.
The network carried games from most of the Chicago area's major league sports teams including the Chicago Cubs and Chicago White Sox Major League Baseball franchises; the NHL's Chicago Blackhawks; the NBA's Chicago Bulls; the Chicago Fire of Major League Soccer; and the Arena Football League's Chicago Rush. The network also aired local and national collegiate sports, including teams sourced from its sister network Fox Sports Detroit.
History
Early history
SportsChannel Chicago was first launched in 1981 when Cablevision obtained rights to 81 Chicago White Sox homes games for the 1981 season. Shortly after another deal was made to carry sporting events from Notre Dame both on SportsChannel Chicago and New York.
The agreement with Cablevision was supposed to be a two year deal. However, the White Sox's new owners Jerry Reinsdorf and Eddie Einhorn launched a new cable service named SportsVision which also contracted with ONTV to provide the games as an over-the-air premium service, since many parts of Chicago still were not wired for cable television service. SportsVision also formed a partnership with the Blackhawks, Bulls and Sting to bring their games to the new network as well. The move of the White Sox games from SportsChannel led to Cablevision filing a breach of contract lawsuit. SportsChannel Chicago would disappear from channel lineups, but not permanently.
Due to the fact that Chicago was one of the last major U.S. cities where cable television was still not widely available, SportsVision initially operated as an over-the-air subscription service. They broadcast over WPWR each weeknight and weekend. Viewers were required to purchase a set-top converter and pay a monthly fee to view the telecasts, which included Bulls, White Sox, and Blackhawks games, as well as college sports events of local interest. Some sports telecasts were also simulcast on ONTV, a co-owned subscription service that broadcast part-time over WSNS-TV (channel 44). The Bulls and White Sox continued to broadcast a number of games on broadcast television locally, while the Blackhawks moved all of their game broadcasts over to SportsVision, ending a longstanding partnership with WSNS. After the move, some set-top converters which were sold as part of ONTV and SportsVision subscriptions, began incorporating a switch to allow subscribers to tune to either ONTV or SportsVision. By 1984, White Sox games began airing on ONTV as well.
The decision to move most of the White Sox broadcasts to paid television led longtime announcer Harry Caray |
https://en.wikipedia.org/wiki/Handle%20%28computing%29 | In computer programming, a handle is an abstract reference to a resource that is used when application software references blocks of memory or objects that are managed by another system like a database or an operating system.
A resource handle can be an opaque identifier, in which case it is often an integer number (often an array index in an array or "table" that is used to manage that type of resource), or it can be a pointer that allows access to further information. Common resource handles include file descriptors, network sockets, database connections, process identifiers (PIDs), and job IDs. PIDs and job IDs are explicitly visible integers; while file descriptors and sockets (which are often implemented as a form of file descriptor) are represented as integers, they are typically considered opaque. In traditional implementations, file descriptors are indices into a (per-process) file descriptor table, thence a (system-wide) file table.
Comparison to pointers
While a pointer contains the address of the item to which it refers, a handle is an abstraction of a reference which is managed externally; its opacity allows the referent to be relocated in memory by the system without invalidating the handle, making it similar to virtual memory for pointers, but even more abstracted. Similarly, the extra layer of indirection also increases the control that the managing system has over the operations performed on the referent. Typically the handle is an index or a pointer into a global array of tombstones.
A handle leak is a type of software bug that occurs when a computer program does not free a handle that it previously allocated. This is a form of resource leak, analogous to a memory leak for previously allocated memory.
Security
In secure computing terms, because access to a resource via a handle is mediated by another system, a handle functions as a capability: it not only identifies an object, but also associates access rights. For example, while a filename is forgeable (it is just a guessable identifier), a handle is given to a user by an external system, and thus represents not just identity, but also granted access.
For example, if a program wishes to read the system password file (/etc/passwd) in read/write mode (O_RDWR), it could try to open the file via the following call:
int fd = open("/etc/passwd", O_RDWR);
This call asks the operating system to open the specified file with the specified access rights. If the OS allows this, then it opens the file (creates an entry in the per-process file descriptor table) and returns a handle (file descriptor, index into this table) to the user: the actual access is controlled by the OS, and the handle is a token of that. Conversely, the OS may deny access, and thus neither open the file nor return a handle.
In a capability-based system, handles can be passed between processes, with associated access rights. Note that in these cases the handle must be something other than a systemwide-unique s |
https://en.wikipedia.org/wiki/Chloromethane%20%28data%20page%29 | This page provides supplementary chemical data on chloromethane.
Safety data sheet
The handling of this chemical may incur notable safety precautions. It is highly recommended that you seek the safety data sheet for this chemical from a reliable source such as SIRI, and follow its directions. SDS for chloromethane is available at Supelco Inc
Structure and properties
Thermodynamic properties
Vapor pressure of liquid
Table data obtained from CRC Handbook of Chemistry and Physics 44th ed.
Spectral data
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Microsoft%20PixelSense | Microsoft PixelSense (formerly called Microsoft Surface) was an interactive surface computing platform that allowed one or more people to use and touch real-world objects, and share digital content at the same time. The PixelSense platform consists of software and hardware products that combine vision based multitouch PC hardware, 360-degree multiuser application design, and Windows software to create a natural user interface (NUI).
Overview
Microsoft Surface 1.0, the first version of PixelSense, was announced on May 29, 2007, at the D5 Conference. It shipped to customers in 2008 as an end-to-end solution with Microsoft producing and selling the combined hardware/software platform. It is a 30-inch (76 cm) 4:3 rear projection display (1024×768) with an integrated PC and five near-infrared (IR) cameras that can see fingers and objects placed on the display. The display is placed in a horizontal orientation, giving it a table-like appearance. The product and its applications are designed so that several people can approach the display from all sides to simultaneously share and interact with digital content. The cameras’ vision capabilities enable the product to see a near-IR image of what’s placed on the screen, captured at approximately 60 times per second. The Surface platform processing identifies three types of objects touching the screen: fingers, tags, and blobs. Raw vision data is also available and can be used in applications. The device is optimized to recognize 52 simultaneous multitouch points of contact. Microsoft Corporation produced the hardware and software for the Microsoft Surface 1.0 product. Sales of Microsoft Surface 1.0 were discontinued in 2011 in anticipation of the release of the Samsung SUR40 for Microsoft Surface and the Microsoft Surface 2.0 software platform.
Microsoft and Samsung partnered to announce the current version of PixelSense, the Samsung SUR40 for Microsoft Surface (“SUR40”), at the Consumer Electronics Show (CES) in 2011. Samsung began shipping the new SUR40 hardware with the Microsoft Surface 2.0 software platform to customers in early 2012.
The Samsung SUR40 is a 40-inch (102 cm) 16:9 LED backlit LCD (1920×1080) with integrated PC and PixelSense technology, which replaces the cameras in the previous product. PixelSense technology enables Samsung and Microsoft to reduce the thickness of the product from 22 in (56 cm) to 4 in (10 cm). The size reduction enables the product to be placed horizontally, and adds the capability to be mounted vertically while retaining the ability to recognize fingers, tags, blobs and utilize raw vision data. Samsung produces the hardware and Microsoft produces the software platform for the SUR40.
Target market
PixelSense is designed primarily for use by commercial customers to use in public settings. People interact with the product using direct touch interactions and by placing objects on the screen. Objects of a specific size and shape, or with tag patterns, can be uniquely |
https://en.wikipedia.org/wiki/TC%20Works%20Spark | TC Works Spark was a 2-track audio editing application for the Mac OS 9 and Mac OS X, developed by TC Works, the former computer recording subsidiary of TC Electronic, from 1999 to 2003. Spark was discontinued in 2003.
Features
2 track audio editing.
CD burning.
Audio processing with included or third party VST or AU plug-ins.
Audio analysis tools.
Batch conversion.
Noise reduction tools.
Variants
Spark was available in these versions:
Spark ME - a free version available for download from the TC Works website.
Spark LE - a version bundled with early TC PowerCore cards.
Spark LE Plus - a version only available for purchase from the TC webshop
Spark XL - the flagship application, bundled with several audio plug-ins.
Spark - the predecessor to Spark XL.
Spark Modular - a collection of software modules for building your own modular synthesizer.
Spark FX Machine - a matrix similar to the one found in the TC Electronic FireworX hardware unit.
References
Classic Mac OS software
Audio editors |
https://en.wikipedia.org/wiki/The%20TV%20Wheel | The TV Wheel is a 1995 television pilot created by and starring Joel Hodgson, of Mystery Science Theater 3000 fame. The pilot was funded by cable network HBO, but they ultimately passed on picking up the show. The pilot episode eventually aired once on Comedy Central as a special presentation following the last new episode of MST3K to be broadcast on that network.
The program is a sketch comedy show. A single stationary camera was mounted inside the center of a large rotating platform. As the platform rotated around the camera, a scene would come into view of the camera. The wheel would stop and a sketch would play out in the scene, which was often framed by some piece of appropriate artwork or prop (for the purposes of forced perspective). At the end of the scene, the wheel would rotate, carrying one scene out of the camera's view and bringing another in, and a new sketch would begin in the new scene. Some scenes were self-contained on the platform, while others were open to the studio beyond the platform (and additional action would take place in the background).
In early designs, the project was known as the "X-Box" (unrelated to Microsoft's later gaming system), and was designed as an X-shaped enclosure that would rotate around the camera.
Hodgson made an early test version of the program, called The X-Box is Turning, which a less polished show which featured different content than The TV Wheel. The test program, along with a brief documentary on the making of the Xbox, was offered for sale on VHS during Comedy Central's only broadcast of The TV Wheel.
A number of comedians and writers appeared on both The TV Wheel and The X-Box is Turning, including Morwenna Banks, Steve Bannos, David Cross, Paul Feig, Doug Benson, Melissa Samuels and Fred Stoller. In addition, Brian Posehn appeared in X-Box and Andy Kindler appeared in TV Wheel.
References
External links
1990s American television specials
Television pilots not picked up as a series |
https://en.wikipedia.org/wiki/Nigel%20Horspool | R. Nigel Horspool is a retired professor of computer science, formerly of the University of Victoria. He invented the Boyer–Moore–Horspool algorithm, a fast string search algorithm adapted from the Boyer–Moore string-search algorithm. Horspool is co-inventor of dynamic Markov compression and was associate editor and then editor-at-large of the journal Software: Practice and Experience from 2007 to 2017. He is the author of C Programming in the Berkeley UNIX Environment.
Nigel Horspool is British by birth, but is now a citizen of Canada.
After a public school education at Monmouth School, he studied at Pembroke College, Cambridge, where he received a BA in natural science, but specializing in theoretical physics, in 1969.
After two years employment as an assembly language programmer on a partially successful air traffic control system project, he went to the University of Toronto for an MSc followed by a PhD in computer science.
This was followed by seven years as an assistant professor and then an associate professor at McGill University.
In 1983, he made a permanent move to the University of Victoria. As of July 2016, he retired from the university but retains the title of professor emeritus.
References
Canadian computer scientists
British computer scientists
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Surface%20computer | A surface computer is a computer that interacts with the user through the surface of an ordinary object, rather than through a monitor, keyboard, mouse, or other physical hardware.
The term "surface computer" was first adopted by Microsoft for its PixelSense (codenamed Milan) interactive platform, which was publicly announced on 30 May 2007. Featuring a horizontally-mounted 30-inch display in a coffee table-like enclosure, users can interact with the machine's graphical user interface by touching or dragging their fingertips and other physical objects such as paintbrushes across the screen, or by setting real-world items tagged with special bar-code labels on top of it. As an example, uploading digital files only requires each object (e.g. a Bluetooth-enabled digital camera) to be placed on the unit's display. The resulting pictures can then be moved across the screen, or their sizes and orientation can be adjusted as well.
PixelSense's internal hardware includes a 2.0 GHz Core 2 Duo processor, 2GB of memory, an off the shelf graphics card, a scratch-proof spill-proof surface, a DLP projector, and five infrared cameras to detect touch, unlike the iPhone, which uses a capacitive display. These expensive components resulted in a price tag of between $12,500 to $15,000 for the hardware.
The first PixelSense units were used as information kiosks in the Harrah's family of casinos. Other customers were T-Mobile, for comparing several cell phones side by side, and Sheraton Hotels and Resorts, to service lobby customers in numerous ways. These products were originally branded as "Microsoft Surface", but was renamed "Microsoft PixelSense" on June 18, 2012, after the manufacturer adopted the "Surface" name for its new series of tablet PCs.
See also
Surface computing
Table computer
TouchLight
Jeff Han FTIR
References
External links
Microsoft PixelSense
Computing input devices |
https://en.wikipedia.org/wiki/Jacqueline%20Pillon | Jacqueline Patricia Pillon (born December 27, 1977) is a Canadian actress. She is best known as the voice of Matt in Cyberchase and Cookie Falcone (MacDougall) in Fugget About It.
Life and career
Early life
Pillon was born in Windsor, Ontario, Canada as the youngest of four children. She was educated and graduated from the renowned Monsignor Feeney Choir school in London. She ultimately graduated with an Hon. B.Sc. in Physical Anthropology from The University of Toronto.
Career
At the age of 12, she started her first work in theatre. As a voice actress, she first appeared in Gahan Wilson's The Kid as the title character. Other roles included Jane Doe, Crossed Over, Master Spy: The Robert Hanssen Story, and Gilda Radner: It's Always Something as comedy writer Anne Beatts. She also appeared in Queer as Folk and Street Time.
Her first major animation role is Matt in the PBS animated series Cyberchase. Her voice has been featured in Medabots, Chilly Beach, Odd Job Jack, and Fugget About It. She starred in the Christmas special A Very Barry Christmas opposite Colin Mochrie. She used to provide the voice for the W Network in Canada before she was replaced.
Filmography
References
External links
1977 births
Living people
Canadian film actresses
Canadian voice actresses
Canadian television actresses
Actresses from Windsor, Ontario
Franco-Ontarian people |
https://en.wikipedia.org/wiki/SOCOM%20U.S.%20Navy%20SEALs%3A%20Tactical%20Strike | SOCOM U.S. Navy SEALs: Tactical Strike is a tactical shooter video game developed by Slant Six Games and published by Sony Computer Entertainment for PlayStation Portable.
The online servers for this game, along with other PlayStation 2 and PlayStation Portable SOCOM titles, were shut down on August 31, 2012.
Gameplay
SOCOM U.S. Navy Seals: Tactical Strike focuses on the player being able to maintain tight control of a four-man special operations squad. The game represents a major departure from the "run and gun" gameplay of the previous SOCOM U.S. Navy SEALs games. In Tactical Strike, the player character is never able to physically shoot, run, etc. Instead, he or she must tell the squad to do such actions. The player often has to evaluate a situation and plan accordingly, usually having to move with some stealth. The squad is moved around using a "skimmer" (the analog stick of the PSP); the player can preview where the individual members of the squad will move to before they opt to actually move the team. The squad can be controlled from the points of view of different soldiers; additionally, the four man-team can be split up into two teams of two. The player can even choose to select an individual member of the squad.
At the start of the campaign, the player chooses from one of nine special forces teams to command: the Australian SASR, the German KSK, the British SAS, the French GIGN, the U.S. Navy SEALs, the Spanish UOE, the South Korean 707th Special Missions Battalion, the Italian Col Moschin, or the Dutch KCT. Although the storyline of the campaign is the same for every team, the voice track is voiced by native speakers of the different languages (with English subtitles).
Before each mission, the player can choose the loadout and accessories for each individual, upgrade each soldier's attributes with skill points obtained from previous missions (skill points are awarded for killing enemies and completing objectives), and choose one of two places to insert into the mission (if applicable).
Reception
SOCOM U.S. Navy SEALs: Tactical Strike received "mixed or average" reviews, according to review aggregator Metacritic.
References
External links
2007 video games
Multiplayer and single-player video games
PlayStation Portable games
PlayStation Portable-only games
SOCOM U.S. Navy SEALs
Video games about police officers
Video games about the Special Air Service
Video games about the United States Navy SEALs
Video games developed in Canada
Video games scored by Justin Burnett
Slant Six Games games |
https://en.wikipedia.org/wiki/Fucked%20For%20Life | Fucked For Life (FFL) is a criminal network in Sweden, probably founded by Daniel Maiorana (born ). At the core of the network are 12 men, some of whom have "FFL" tattooed on their arms or neck.
History
The gang was initially named "Tumba Lords" after Tumba, a southern suburb of Stockholm, but later changed its name "Fucked For Life" at the end of the 1990s. The gang originally consisted of 5 members, but police estimates said the number had increased to approximately 40 members in 2004. FFL had begun with the theft of mopeds and motocross-cycles, but in recent years they have been occupied with robbing ATMs and armoured transports.
Maiorana was released from Hall Prison on 14 February 2002, where he had served a -year sentence for robbery and assault. After his release, a crime wave associated with FFL began in Stockholm, until he was arrested and sentenced to seven years in prison.
He escaped from custody on 18 January 2004 but was arrested again. He escaped yet again on 28 July 2004, together with Tony Olsson, a convict serving a life sentence for the Malexander murders. Both men were again arrested shortly after their escape.
References
Sources
DN mentioning the organization "The Postal Robbery in Gothenburg" 22 January 2008
Fucked for life Brottsförebyggande rådet, 2005.
Moppestöld första brottet Aftonbladet.
Gangs in Sweden |
https://en.wikipedia.org/wiki/Data%20collection | Data collection or data gathering is the process of gathering and measuring information on targeted variables in an established system, which then enables one to answer relevant questions and evaluate outcomes. Data collection is a research component in all study fields, including physical and social sciences, humanities, and business. While methods vary by discipline, the emphasis on ensuring accurate and honest collection remains the same. The goal for all data collection is to capture evidence that allows data analysis to lead to the formulation of credible answers to the questions that have been posed.
Regardless of the field of or preference for defining data (quantitative or qualitative), accurate data collection is essential to maintain research integrity. The selection of appropriate data collection instruments (existing, modified, or newly developed) and delineated instructions for their correct use reduce the likelihood of errors.
Methodology
Data collection and validation consist of four steps when it involves taking a census and seven steps when it involves sampling.
A formal data collection process is necessary as it ensures that the data gathered are both defined and accurate. This way, subsequent decisions based on arguments embodied in the findings are made using valid data. The process provides both a baseline from which to measure and in certain cases an indication of what to improve.
Tools
Data collection system
Data management platform
Data management platforms (DMP) are centralized storage and analytical systems for data, mainly used in marketing. DMPs exist to compile and transform large amounts of demand and supply data into discernible information. Marketers may want to receive and utilize first, second and third-party data. DMPs enable this, because they are the aggregate system of DSPs (demand side platform) and SSPs (supply side platform). DMPs are integral for optimizing and future advertising campaigns.
Data integrity issues
The main reason for maintaining data integrity is to support the observation of errors in the data collection process. Those errors may be made intentionally (deliberate falsification) or non-intentionally (random or systematic errors).
There are two approaches that may protect data integrity and secure scientific validity of study results:
Quality assurance – all actions carried out before data collection
Quality control – all actions carried out during and after data collection
Quality assurance (QA)
QA's focus is prevention, which is primarily a cost-effective activity to protect the integrity of data collection. Standardization of protocol, with comprehensive and detailed procedure descriptions for data collection are central for prevention. The risk of failing to identify problems and errors in the research process is often caused by poorly written guidelines. Listed are several examples of such failures:
Uncertainty of timing, methods and identification of the responsible p |
https://en.wikipedia.org/wiki/Bart%20de%20Graaff | Bart Frederikus de Graaff (; 16 April 1967 – 25 May 2002) was an influential Dutch television presenter, comedian and creator, as well as the founder and chairman of the public broadcasting network BNN.
Early life
Bart Frederikus de Graaff was born on 16 April 1967 in Haarlem in the Netherlands.
Because of a car accident in his youth in 1976, De Graaff suffered from serious kidney failure for most of his life. This also caused a growth disorder which caused de Graaff to appear much younger than his actual age. In his career as a television presenter he often used his childlike appearance to his advantage, for instance, when he hosted the children's TV show B.O.O.S..
Career
In 1997, he founded a public broadcasting network, Bart's News Network (BNN). After his death, it was renamed to Bart's Neverending Network. Targeted at a youthful audience, the network quickly became known for its sometimes provocative programming. A television show De Grote Donorshow (The Big Donor Show) by BNN won an Emmy Award for Best Non-scripted Entertainment.
Death
At the end of 1997 De Graaff received a donor kidney and was for a time able to live a relatively normal life. In 1999 the kidney was rejected and his health deteriorated quickly. De Graaff died on 25 May 2002 at the age of 35.
References
External links
1967 births
2002 deaths
Deaths from kidney failure
Dutch male comedians
Dutch people of Indonesian descent
Dutch television presenters
Dutch children's television presenters
Dutch public broadcasting administrators
Kidney transplant recipients
Mass media people from Haarlem
20th-century comedians |
https://en.wikipedia.org/wiki/Xcas | Xcas is a user interface to Giac, which is an open source computer algebra system (CAS) for Windows, macOS and Linux among many other platforms. Xcas is written in C++. Giac can be used directly inside software written in C++.
Xcas has compatibility modes with many popular algebra systems like WolframAlpha, Mathematica, Maple, or MuPAD. Users can use Giac/Xcas to develop formal algorithms or use it in other software. Giac is used in SageMath for calculus operations. Among other things, Xcas can solve equations (Figure 3) and differential equations (Figure 4) and draw graphs. There is a forum for questions about Xcas.
CmathOOoCAS, an OpenOffice.org plugin which allows formal calculation in Calc spreadsheet and Writer word processing, uses Giac to perform calculations.
Features
Here is a brief overview of what Xcas is able to do:
Xcas has the ability of a scientific calculator that provides show input and writes pretty print
Xcas works also as a spreadsheet;
computer algebra;
2D geometry in the plane;
3D geometry in space;
spreadsheet;
statistics;
regression (exponential, linear, logarithmic, logistic, polynomial, power)
programming;
solve equations even with complex roots (Figure 2);
solving trigonometric equations
solve differential equations (Figure 3);
draw graphs;
calculate differential (or derivative) of functions (Figure 2);
calculate antiderivative of functions (Figure 2);
calculate area and integral calculus;
linear algebra
Example Xcas commands:
Produce mixed fractions: propfrac(42/15) gives 2 +
Calculate square root: sqrt(4) = 2
Draw a vertical line in coordinate system: line(x=1) draws the vertical line in the output window
Draw graph: plot(function) (for example, plot(3 * x^2 - 5) produces a plot of
Calculate average: mean([3, 4, 2]) is 3
Calculate variance: variance([3, 4, 2]) is
Calculate standard deviation: stddev([3, 4, 2]) is
Calculate determinant of a matrix: is
Calculate local extrema of a function: extrema(-2*cos(x)-cos(x)^2,x) is [0, π]
Calculate cross product of two vectors: cross([1, 2, 3], [4, 3, 2]) is
Calculate permutations: nPr()
Calculate combinations: nCr()
Solve equation: solve(equation,x)
Factoring Polynomials: factor(polynomial,x) or cfactor(polynomial,x)
Differentiation of function: diff(function,x)
Calculate indefinite integrals/antiderivatives: int(function,x)
Calculate definite integrals/area under the curve of a function: int(function,x,lowerlimit,upperlimit)
Calculate definite integral aka solid of revolution - finding volume by rotation (around the x-axis): int(pi*function^2,x,lowerlimit,upperlimit)
Calculate definite integral aka solid of revolution - finding volume by rotation (around the y-axis) for a decreasing function: int(2*pi*x*function,x,lowerlimit,upperlimit)
Separation of variables: split((x+1)*(y-2),[x,y]) produces
desolve differential equation (the derivatives are written as y or y): desolve(differential equation,y)
Supported operating systems
|
https://en.wikipedia.org/wiki/Comparison%20of%20popular%20optical%20data-storage%20systems | , multiple consumer-oriented, optical-disk media formats are or were available:
Compact Disc ("CD"): digital audio disc
CD-R: write once read many (WORM) CD
CD-RW: rewriteable CD
DVD: digital video disc
DVD-R: WORM DVD defined by the DVD Forum
DVD-RW: rewritable DVD defined by DVD Forum
DVD+R: WORM DVD defined by the DVD+RW Alliance
DVD+RW: rewriteable DVD defined by DVD+RW Alliance
DVD-RAM rewriteable, capable of random write access, not generally format-compatible with DVD
Blu-ray Disc: DVD successor, capable of high-definition video
BD-R: WORM Blu-ray Disc by the Blu-ray Disc Association
BD-RE: rewriteable BD
HD DVD: failed HD format defined by the DVD Forum
Ultra HD Blu-ray: BD successor, capable of 4K resolution
Overview
Nomenclature
In optical storage, three types of storage are usually recognized, and given customary abbreviations: read-only ("ROM"), Write once ("R") and read/writable ("RW", or for Blu-ray, "E" for "erasable"). Examples:
CD-ROM represents the CD format, in its pre-recorded "read only" use
DVD+R represents a DVD "+" disc which can be written once only
DVD-RW represents a DVD "-" disc which can be read or written many times
BD-RE represents a Blu-ray disc which can be read or written many times.
In addition some of these media support MultiLevel Recording formats, for example dual layer (written as "DL"), and DVD also supports a "RAM" version (similar to RW), although this is not widely used in the popular consumer market.
Coverage
DVD has three variants, known as "+", "-" and "RAM". For the purposes of this article, DVD+ and DVD- are considered together as "DVD"; they share many of the same characteristics. Differences are noted below.
DVD-RAM, which did not gain wide penetration of the consumer market, is discussed briefly in the same section but otherwise excluded from the article.
ROM formats are excluded; they perform rather like write-once "R" formats, without the capacity to write to the disc. Likewise other niche formats are excluded, such as GD-ROM (used by some Sega game consoles) and Ultra Density Optical and the like (commercial archiving storage rather than mass market).
Thus the article covers the following popular recordable formats: CD (CD-R, CD-RW); DVD (DVD±R, DVD±RW); HD DVD (); Blu-ray (BD-R, BD-E), and for all except CD, their respective dual- or multi-layer formats.
History
Although research into optical data storage has been ongoing for many decades, the first popular system was CD, introduced in 1982, adapted from audio (CD-DA) to data storage (the CD-ROM format) with the 1985 Yellow Book, and re-adapted as the first mass market optical storage medium with CD-R and CD-RW in 1988. Compact Disc is still the de facto standard for audio recordings, although its place for other multimedia recordings and optical data storage has largely been superseded by DVD.
DVD (initially an acronym of "Digital Video Disc", then backronymed as "Digital Versatile Disc" and officially just "DVD" |
https://en.wikipedia.org/wiki/Gpart | gpart is a software utility which scans a storage device, examining the data in order to detect partitions which may exist but are absent from the disk's partition tables. Gpart was written by Michail Brzitwa of Germany. The release on the author's website is now older than the releases some distributions are using. It appears that Michail Brzitwa does not actively maintain the code, instead the various distributions (I.E. Fedora or Debian) appear to maintain their own versions.
gpart tries to guess partitions from any device that can be partitioned, even a file. If the primary partition table has been lost, overwritten or destroyed the partitions still exist on the media but the operating system cannot access them.
gpart ignores the primary partition table and scans the disk (or disk image file) sector after sector for several filesystem/partition types. It does so by "asking" filesystem recognition modules if they think a given sequence of sectors resembles the beginning of a filesystem or partition type.
Michail Brzitwa,: man page "gpart(8) - Linux man page", January 2001
A list of these modules are listed below. Also modules can be written for future filesystems and used in the detection process.
If recovering partitions is needed that are damaged on the only bootable disk in a machine, a live CD can be used such as knoppix to start the machine and use the utilities from the disk.
It is also good at finding and listing the types, locations, and sizes of inadvertently-deleted partitions, both primary and logical. It gives you the information you need to manually re-create them (using fdisk, cfdisk, sfdisk, etc.). The guessed partition table can also be written to a file or (if you firmly believe the guessed table is entirely correct) directly to a disk device.
With some badly damaged devices it is a good idea to use a utility such as ddrescue to make a backup. Then when you have a copy of the device, use gpart to guess the partitions on the copy. If it is successful, you can try writing them back to the device. You may find that when using ddrescue you get read errors because the device is damaged but if you can get the partitions readable with your copy then you can try using Mount (Unix) and retrieve the data from the copy.
$ mount -t <part type> /path/to/imagefile -o loop,offset=<part offset> /mnt/loop
This will mount the partition at offset <part offset> on /mnt/loop so you can recover your data from the file.
To get the partition offset you can use either fdisk -ul /path/to/imagefile or use the output from gpart.
Look at the sample output at the size line, the last pair of round brackets has the start (16) and then end (3906559).
When specifying the offset, always specify the start.
Sample output
This is sample output from a scan of an 8GB flash memory stick with two partitions, one FAT16B 2GB partition and one xfs 6GB partition.
Begin scan...
Possible partition (DOS FAT), size (1907mb), offset (0mb)
Possible |
https://en.wikipedia.org/wiki/Synnex | Synnex was an American multinational corporation that provides information technology (IT) services to businesses. It merged with competitor Tech Data to form TD Synnex. It was founded in 1980 by Robert T. Huang and based in Fremont, California. As an information technology supply chain services company, it offered services to original equipment manufacturers, software publishers and reseller customers.
History
Originally founded as a technology hardware distributor, Synnex distributes products and related logistics services. As a business process outsourcing and contract assembly it works with industry suppliers of IT systems, peripherals, system components, software and networking equipment. The company is one of the major employers in Greenville, South Carolina. On 21 December 2009, Synnex acquired Jack of All Games from Take-Two Interactive. In December 2010 Synnex acquired the managed business solutions division of e4e, an ITes service provider located in Bangalore in India.
In 2012 Hyve Solutions announced a partnership with IBM and Zettaset to produce a bundled "turnkey" platform for Hadoop-based analytics targeted to the needs of small- and medium-sized businesses. Synnex acquired IBM's worldwide customer care business process outsourcing (BPO) services business on 11 September 2013.
In June 2017, Synnex acquired the North and Latin American operations of Westcon-Comstor, along with 10% of the remaining part of Westcon (Westcon International) from Datatec for a reported consideration of up to $830 million.
On 28 June 2018, Convergys and Synnex announced they have reached a definitive agreement in which Synnex would acquire Convergys for $2.43 billion in combined stock and cash, and integrate it with Concentrix. On 5 October 2018, Convergys Corporation and Synnex announced that they have completed the merger.
In 2019, Synnex sits at number 158 on the Fortune 500 listing.
On 9 January 2020, Dennis Polk, President and Chief Executive Officer of Synnex, announced plans to separate SYNNEX and Concentrix into two publicly traded companies. The spinoff was completed on 1 December 2020, with Synnex shareholders getting one share of Concentrix for each share of Synnex they held.
In July 2020, the Republican National Convention's servers were hacked through Synnex. The company said it "could potentially be in connection" with the Kaseya VSA ransomware attack that unfolded days prior.
On 22 March 2021 it was announced that Synnex will merge with Tech Data for a sum of 7.2 billion USD, including debt. Synnex shareholders received 55% of the merged company. MiTAC Holdings Corp. and its affiliates, which collectively owns about 17% of Synnex shares as of 22 January 2021, voted their shares in favor of the transaction.
Merger with Tech Data
On September 1, 2021, Synnex completed a merger with Tech Data. This merger created a new company with $59.8 billion in revenue, TD Synnex. Through the combination of both companies, TD Synnex becomes the |
https://en.wikipedia.org/wiki/DWGV-FM | DWGV (99.1 FM), broadcasting as GV 99.1, is a radio station owned and operated by GV Radios Network Corporation, a subsidiary of Apollo Broadcast Investors through its licensee Cignal TV/MediaScape Inc., affiliated of Radyo5 Manila. The station's studio is located at the 4th Floor, PG Building, McArthur Highway, Balibago, Angeles City, and its transmitter is located at the Royal Golf And Country Club, Porac. It operates daily from 5:00 AM to 12:00 MN.
History
DWGV-FM signed on November 7, 1983, by GV Broadcasting System under the foundation of Emmanuel "Manoling" Galang, a licensed Electronics and Communications Engineer. Originally intended as a training background for the students of Galang Technical Institute, it later became Angeles City's center of information for Central Luzon. GV also produced programs for most prominent personalities such as Ted Failon, Erwin Tulfo, and Daniel Razon among others.
GV's broadcast franchise under Republic Act 8169 was granted in 1995, and was later amended in 1998 allowing GV expanded its broadcast operations nationwide. A second GV station (DZGV) was launched in Galang's native hometown province Batangas, followed by an AM station (GVAM 792) Angeles. Other stations were applied and approved by NTC.
Until then, the GV FM 99.1 brand and its "Drive Radio" tagline were used until 2012 when the "FM" suffix was dropped and rechristened as GV 99.1 with a new slogan "Your Good Vibes".
In 2007, GV Broadcasting was acquired by MediaQuest Holdings, Inc., a media conglomerate owned by the PLDT's Beneficial Trust Fund, with the Galangs became part of the said firm. Since then, GV Broadcasting was renamed as Mediascape Inc. GV 99.1 became available nationwide on Mediascape's own DTH satellite service Cignal TV since its launch in 2009.
In 2009, management and operations of GV radio stations were transferred to a new entity Metro City Media Services (MCMS) before merging with cable TV operations of Apollo Global Corporation and became Apollo Broadcast Investors.
Awards
References
Radio stations in Angeles City
Radio stations established in 1983
Contemporary hit radio stations in the Philippines |
https://en.wikipedia.org/wiki/Source%20route%20bridging | Source route bridging is used on Token Ring networks, and is standardized in Section 9 of the IEEE 802.2 standard. The operation of the bridge is simpler (spanning tree protocol is not necessary) and much of the bridging functions are performed by the end systems, particularly the sources, giving rise to its name.
Source-route transparent bridging, abbreviated SRT bridging, is a hybrid of source routing and transparent bridging, standardized in Section 9 of the IEEE 802.2 standard. It allows source routing and transparent bridging to coexist on the same bridged network by using source routing with hosts that support it and transparent bridging otherwise.
The source-route bridging algorithm was developed by IBM and was proposed to the IEEE 802.5 committee as the means to bridge between all the LANS.
Description
A field in the Token Ring header, the routing information field (RIF), is used to support source-route bridging. Upon sending a packet, a host attaches a RIF to the packet indicating the series of bridges and network segments to be used for delivering the packet to its destination. The bridges merely follow the list given in the RIF - if a given bridge is next in the list, it forwards the packet, otherwise it ignores it.
When a host wishes to send a packet to a destination for the first time, it needs to determine an appropriate RIF. A special type of broadcast packet is used, which instructs the network bridges to append their bridge number and network segment number to each packet as it is forwarded. Loops are avoided by requiring each bridge to ignore packets which already contain its bridge number in the RIF field. At the destination, these broadcast packets are modified to be standard unicast packets and returned to the source along the reverse path listed in the RIF. Thus, for each route discovery packet broadcast, the source receives back a set of packets, one for each possible path through the network to the destination. It is then up to the source to choose one of these paths (probably the shortest one) for further communications with the destination.
Two frame types are used in order to find the route to the destination network segment. Single-Route (SR) frames make up most of the network traffic and have set destinations, while All-Route (AR) frames are used to find routes. Bridges send AR frames by broadcasting on all network branches; each step of the followed route is registered by the bridge performing it. Each frame has a maximum hop count, which is determined to be greater than the diameter of the network graph, and is decremented by each bridge. to avoid indefinite looping of AR frames, frames are dropped when this hop count reaches zero. The first AR frame that reaches its destination is considered to have followed the best route, and the route can be used for subsequent SR frames; the other AR frames are discarded.
This method of locating a destination network can allow for indirect load balancing among multiple |
https://en.wikipedia.org/wiki/Spellz | Spellz was a 2006–2008 magic series featuring famed magician Jay Sankey. Produced by GAPC Entertainment in partnership with TVO Kids, with the participation of Knowledge Network from 2006 to 2009, SCN and the Canadian Television Fund, Spellz was created by Hoda Elatawi, Mike Erskine-Kellie, Jay Sankey and David Peck. The show was directed by Max Maleo, written by Susan McLennan, and executive produced by Ken Stewart, Dan Danko & Tom K. Mason.
In Spellz, Bridget Hall plays "Bridget, the Amazing Kid Assistant", the only other recurring person on the series, beside Sankey. There were kid segments for a second season of the program that were in production during March 2007; however, the scenes with Sankey and Hall were filmed in May; there are 26 episodes in Season 1, airing since September 2006, and there are 26 episodes in Season 2, which began September 2007. Both are available on DVD.
In 2007, Spellz won the Certificate for Creative Excellence in Communications at the U.S. International Film and Video Festival and the Remi award at the Houston International Film Festival in 2008.
References
TVO original programming
2000s Canadian children's television series
2006 Canadian television series debuts
Canadian preschool education television series |
https://en.wikipedia.org/wiki/Comparison%20of%20packet%20analyzers | The following tables compare general and technical information for several packet analyzer software utilities, also known as network analyzers or packet sniffers. Please see the individual products' articles for further information.
General information
Basic general information about the software—creator/company, license/price, etc.
Operating system support
The utilities can run on these operating systems.
References
Packet sniffers
Network analyzers |
https://en.wikipedia.org/wiki/Squee | Squee may refer to:
Squee!, a comic book series
Squee (character), main character of the series
Squee Allen, ice hockey player
Squee, an animal seen in the computer game Myst III: Exile
Squee, the death rattle of a robot in the Magnus: Robot Fighter comic
Squee, a character in the Magic: The Gathering trading card game
Squee, an affectionate nickname for President of Ireland, Michael D. Higgins
See also
Squeal (disambiguation)
Squealer (disambiguation) |
https://en.wikipedia.org/wiki/WLKT | WLKT (104.5 FM) is a commercial radio station licensed to Lexington-Fayette, Kentucky. The station is owned by iHeartMedia, Inc. who determines its programming in New York using automation, non-local talent, and airs a Top 40 (CHR) radio format. The station's studios are located on Nicholasville Road in south Lexington, and its transmitter is located in rural far east Fayette County, Kentucky.
Its playlist includes Pop, Rock and Hip Hop music. In middays, it carries the syndicated "On Air with Ryan Seacrest." On Sundays, "American Top 40" is heard.
104.5 The Cat is powered at 50,000 watts ERP, with its broadcast signal reaching the eastern suburbs of Louisville, Northern Kentucky suburbs of Cincinnati, Daniel Boone National Forest, Somerset and London. WLKT was the fourth station in the Lexington metropolitan area to begin broadcasting HD Radio after WUKY, WKQQ and WBUL. Its HD-2 subchannel carries an urban contemporary format, simulcast on translator station 103.9 W280DO, known as "Real 103.9."
History
The station signed on the air on July 30, 1992, as WJGG. It was owned by J.L. Givens Associates. Newport Communications, which also owned WLRS in Louisville, later acquired the station.
It was purchased by Jacor in 1997 and switched to a Top 40 (CHR) format. On May 4, 1999, Jacor was purchased by Clear Channel Communications (now iHeartMedia).
WLKT-HD2
On July 21, 2011, WLKT-HD2 changed its format from New CHR to Urban Contemporary, branded as "Wild 103.9" (also broadcasts on FM translator W280DO 103.9 FM). The station's moniker later changed to "Real 103.9."
References
External links
104.5 The Cat website
LKT
Contemporary hit radio stations in the United States
IHeartMedia radio stations |
https://en.wikipedia.org/wiki/NFL%20Classics | NFL Classics is a series of videotaped rebroadcasts of National Football League games that air on the NFL Network. The show airs weekly during the offseason and also occasionally during the NFL season. As of the 2010, the series airs on Monday night while Super Bowl Classics airs on Friday night.
The program, the first such series to air on any American television network, premiered on May 10, 2007 with a re-air of the Chicago Bears' Monday Night Football comeback victory over the Arizona Cardinals in 2006.
NFL Classics is an extension of an earlier series called Super Bowl Classics, which showed full-length re-airs of some of the most memorable Super Bowl games.
The NFL is the last United States-based major professional sports league to make such broadcasts available on TV. Previously, NFL Network and ESPN Classic had aired NFL's Greatest Games, 90-minute edited versions using footage from NFL Films. The other major leagues – MLB, NBA, NHL, and NASCAR – have all had games (or races, in NASCAR's case) air on ESPN Classic. However, at this time, full-length MLB games are shown on Classic only occasionally, while NHL games are presently aired on NHL Network.
Episode list
Super Bowl Classics
2007
January 11, 2007 – Super Bowl XL: Pittsburgh Steelers 21, Seattle Seahawks 10
January 15, 2007 – Super Bowl XXXII: Denver Broncos 31, Green Bay Packers 241
January 15, 2007 – Super Bowl XXII: Washington Redskins 42, Denver Broncos 10
January 18, 2007 – Super Bowl XXXVI: New England Patriots 20, St. Louis Rams 17
January 22, 2007 – Super Bowl XIII: Pittsburgh Steelers 35, Dallas Cowboys 312
January 25, 2007 – Super Bowl XXV: New York Giants 20, Buffalo Bills 19
January 29, 2007 – Super Bowl XXXIV: St. Louis Rams 23, Tennessee Titans 16
February 1, 2007 – Super Bowl XXXVIII: New England Patriots 32, Carolina Panthers 29
February 3, 2007 – Super Bowl XXIII: San Francisco 49ers 20, Cincinnati Bengals 16
February 3, 2007 – Super Bowl III: New York Jets 16, Baltimore Colts 7
1This was not on the original NFLN schedule; it replaced a scheduled telecast of the Las Vegas All-American Classic, which was cancelled2The last minute of the first half (including the Rocky Bleier touchdown reception) was missing from the footage.
2008
This schedule reflects only game re-airs that NFL Network did not show the previous year. Also, most of the premieres tied into the participating teams in Super Bowl XLII and to the 1972 Miami Dolphins, the only perfect team for an entire season in NFL history.
January 21, 2008- Super Bowl XLI: Indianapolis Colts 29, Chicago Bears 17
January 23, 2008- Super Bowl XX: Chicago Bears 46, New England Patriots 10
January 25, 2008- Super Bowl XXXIII: Denver Broncos 34, Atlanta Falcons 19
January 27, 2008- Super Bowl XXXI: Green Bay Packers 35, New England Patriots 21
January 28, 2008- Super Bowl XXI: New York Giants 39, Denver Broncos 20
January 31, 2008- Super Bowl XXX: Dallas Cowboys 27, Pittsburgh Steelers 17
February 1, 2008- Super B |
https://en.wikipedia.org/wiki/SeniorNet | SeniorNet a 501(c)(3) charity organization which provides computer and internet education; computer skills and instruction to veterans, the underprivileged, the disabled, older persons, and others with impairments. Volunteers across the country run SeniorNet Computer Learning Centres, which follow a standardised curriculum given by SeniorNet headquarters.
SeniorNet, headquartered in Fort Myers, Florida, has roughly 6,000 members and is run by volunteers. They have roughly 30 "Learning Centres" in various places across the country. They fund their operations with: membership dues, class fees, philanthropic donations from people, and the assistance and sponsorship of organizations and foundations all contribute to SeniorNet's income.
Background
The organization was founded in 1986 by Dr. Mary Furlong, with headquarters originally located in San Francisco, California. In 2005, headquarters were relocated to Santa Clara, California. SeniorNet grew out of a research project funded by the Markle Foundation to determine how computers and telecommunications could enhance the lives of older adults.
With an interest in how technology enhanced the lives of older adults, Mary Furlong sought out a funding source. She encountered much skepticism as she tried to find funding for a program to support seniors using computers. In 1986, the New York-based Markle foundation, led by Lloyd Morrisett, recognized the potential that existed and funded a research project, based at the University of San Francisco. Five learning centers were opened with twenty seniors that year. Apple Computer donated computers to the individuals and centers.
Milestones
1986 – SeniorNet opens their first "Learning Centers".
1987 – Newsline, SeniorNet's quarterly newsletter, makes its debut.
1988 – The first national conference is held at the University of San Francisco. The theme is ‘Building a Community of Computer-Using Seniors’. Sponsors include Apple Computer, Pacific Telesis, the Markle Foundation, and the Ophthalmologic Surgery Society.
1990 – SeniorNet is incorporated as a 501c(3) educational non-profit organization and establishes its first independent headquarters in San Francisco. Don Rawitch writes and debuts the "Seniornet Song".
1992 – SeniorNet goes global with a new Learning Center opened in Wellington, New Zealand. This year IBM becomes a major sponsor and supporter, sponsoring twelve new centers in cooperation with other companies, and later co-sponsoring seven more Learning Centers along with NYNEX.
1997 – SeniorNet launches a new program, the Solutions Forum, sponsored by Met Life, to allow seniors to collaborate on the Internet to address important national and global issues. Ann Wrixton becomes SeniorNet's Executive Director.
1998 – In collaboration with Microsoft, the AARP and Sony Lifetime Connections, SeniorNet introduces over 50,000 seniors across the U.S. to computers. SeniorNet launches "SeniorNet at Sea," a program with World Explorer Cruises to t |
https://en.wikipedia.org/wiki/Streaming%20data | Streaming data is data that is continuously generated by different sources. Such data should be processed incrementally using stream processing techniques without having access to all of the data. In addition, it should be considered that concept drift may happen in the data which means that the properties of the stream may change over time.
It is usually used in the context of big data in which it is generated by many different sources at high speed.
Data streaming can also be explained as a technology used to deliver content to devices over the internet, and it allows users to access the content immediately, rather than having to wait for it to be downloaded.
Big data is forcing many organizations to focus on storage costs, which brings interest to data lakes and data streams. A data lake refers to the storage of a large amount of unstructured and semi data, and is useful due to the increase of big data as it can be stored in such a way that firms can dive into the data lake and pull out what they need at the moment they need it. Whereas a data stream can perform real-time analysis on streaming data, and it differs from data lakes in speed and continuous nature of analysis, without having to store the data first.
Characteristics and consequences
In digital innovation management theories, five characteristics of digital innovative technologies are mentioned; homogenization and decoupling, modularity, connectivity, digital traces and programmability. Before these characteristics are explained and further elaborated with different examples of data streaming, it is important to understand the difference between digitalization and digitizing. The latter describes encoding from analog information to a digital format, such as light that enters the lens of a camera and transforms to a digital format/image (Yoo et al. 2012). Where digitalization refers to a more socio-technical process, where digitized techniques are applied to broader social and institutional contexts, meaning the process of converting information into a digital format, readable by some sort of computer. Within the context of data streaming this means that media for example, (information) has been digitized since the early 1990s, however the digitalization of ‘information/media’ has started to pick up since the beginning of this century.
Now, firstly homogenization and decoupling. “Because all digital information assumes the same form, it can, at least in principle, be processed by the same technologies. Consequently, digitizing has the potential to remove the tight couplings between information types and their storage, transmission, and processing technologies”. Within the context of data streaming, this means in theory that one can stream data now from any digital device. It also reduces the demand and use of music and films on CDs for example. One of the consequences of homogenization & decoupling is the decline of marginal costs. The marginal cost of data streaming is bec |
https://en.wikipedia.org/wiki/Palm%20Foleo | The Palm Foleo was a planned subnotebook computer that was announced by mobile device manufacturer Palm Inc. on May 30, 2007, and canceled three months later. It intended to serve as a companion for smartphones including Palm's own Treo line. The device ran on the Linux operating system and featured 256 MB of flash memory and an immediate boot-up feature.
The Foleo featured wireless access via Bluetooth and Wi-Fi. Integrated software included an e-mail client which was to be capable of syncing with the Treo E-Mail client, the Opera web browser and the Documents To Go office suite. The client did not send and retrieve mail over the Wi-Fi connection, instead transmitting via synchronization with the companion smartphone.
The device was slated to launch in the U.S. in the third quarter of 2007 for a price expected by Palm to be $499 after an introductory $100 rebate. Palm canceled Foleo development on September 4, 2007, with Palm CEO Ed Colligan announcing that the company would return its focus to its core product of smartphones and handheld computers. Soon after the device was canceled, a branch of subnotebooks called netbooks, similar to the Foleo in size and functionality, reached the market. Had it been released, the Foleo would have been the founding device in the category. At the time, Palm was performing poorly in face of heavy competition in the smartphone market. The company's sales did not recover, and it was purchased by information technology giant Hewlett-Packard in April 2010.
Software
The Foleo was initially reported to run a modified Linux kernel. The kernel was reported as being version 2.6.14-rmk1-pxa1-intc2 ("rmk1" indicates this is the ARM architectural version, "pxa1" indicates it is of the PXA family of Intel/Marvell Technology Group XScale processors, "intc2" is possibly an IRQ handler). On August 7, 2007, Palm announced that it had chosen Wind River Systems to help it customize the standard Linux kernel to make it more suitable for this device.
The device used a custom-built widget framework called HxUI, which is based on the LiTE toolbox over the DirectFB graphics subsystem. HxUI uses XML to describe its interfaces. Bundled Applications included the Opera web browser (Supports Flash and Ajax, but not Flash video), an E-mail application, a PDF viewer, and DocumentsToGo to handle Microsoft Word, Excel, and PowerPoint documents.
A number of companies had announced plans to release applications for this product. For example, LogMeIn planned to provide remote PC access capabilities to the Foleo, Avenuu planned to provide remote file access, Bluefire planned to provide VPN software. On July 26, 2007, Normsoft was the first company to announce an MP3 player for Foleo. Some executives at Palm had suggested that the fan-less CPU would probably not be able to play back video, while others had disagreed. Other companies had announced plans for games, a photo editor, and blogging tools.
Criticism
Initial reaction to the Foleo in |
https://en.wikipedia.org/wiki/NHL%20Network | NHL Network may refer to:
NHL Network (American TV channel)
NHL Network (Canadian TV channel)
The NHL Network (1975–79)
See also
National Hockey League on television |
https://en.wikipedia.org/wiki/Child%20Protection%20Registry%20Acts | A child protection registry or do not contact registry is an electronic database established by statute, to which a parent or guardian may add an "electronic contact point" that is used by or accessible to a child. The statute prohibits certain communications to contact points listed on the registry, and provides criminal penalties for violations of the prohibition.
Child protection registry acts have been enacted in Utah and Michigan.
Utah Child Protection Registry Act
The Utah Child Protection Registry Act, Utah Statutes 13-39-101 et seq., became effective on July 1, 2005. The Act prohibits the sending of a "communication" to a "contact point" that is on the registry for more than 30 days, if the communication either "advertises a product or service that a minor is prohibited by law from purchasing," or "contains or advertises material that is harmful to minors."
A "contact point" is defined as "an electronic identification to which a communication may be sent," and includes an e-mail address, or any of several other types of identifiers, to the extent provided by the Utah Division of Consumer Protection in the Department of Commerce under rulemaking authority granted by the statute, an instant message identity, a telephone number, a facsimile number, or a similar electronic address.
The Department of Commerce has also issued a policy document specifying those products that it deems to be products or services that a minor is prohibited by law from purchasing within the meaning of the statute, i.e., "an alcoholic beverage or product, any form of tobacco, pornographic materials, and any product or service that is illegal in Utah (whether purchased by a minor or an adult), such as illegal drugs, prostitution and gambling."
The Act provides that the consent of a minor to receive such a communication is not a defense to a violation, and that an Internet service provider is not liable for violating the Act "for solely transmitting a message" across its network.
The Act provides that it is a defense to an action for a violation that the violator "reasonably relied" on the electronic registry, and took "reasonable measures to comply" with the Act.
The Utah Child Registry website provides online registration for parents, and for marketers who wish to check their e-mail addresses and other contact points against the database. The Department of Commerce has adopted implementing regulations that charge a fee of $.005 per address checked against the registry, with one-fifth of the fee going to the State of Utah, and four-fifths going to the provider of the registry.
The operator of the registry is UnSpam, Inc., a Utah corporation that also operates the Michigan Child Registry.
A pornography industry trade group brought a legal challenge to the Utah Child Protection Registry Act. A federal judge found the case without merit; the trade group, the Free Speech Coalition, subsequently dropped the case. Free Speech Coalition v. Shurtleff, No. 2:05-cv-0 |
https://en.wikipedia.org/wiki/Edmonds%27%20algorithm | In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching).
It is the directed analog of the minimum spanning tree problem.
The algorithm was proposed independently first by Yoeng-Jin Chu and Tseng-Hong Liu (1965) and then by Jack Edmonds (1967).
Algorithm
Description
The algorithm takes as input a directed graph where is the set of nodes and is the set of directed edges, a distinguished vertex called the root, and a real-valued weight for each edge .
It returns a spanning arborescence rooted at of minimum weight, where the weight of an arborescence is defined to be the sum of its edge weights, .
The algorithm has a recursive description.
Let denote the function which returns a spanning arborescence rooted at of minimum weight.
We first remove any edge from whose destination is .
We may also replace any set of parallel edges (edges between the same pair of vertices in the same direction) by a single edge with weight equal to the minimum of the weights of these parallel edges.
Now, for each node other than the root, find the edge incoming to of lowest weight (with ties broken arbitrarily).
Denote the source of this edge by .
If the set of edges does not contain any cycles, then .
Otherwise, contains at least one cycle.
Arbitrarily choose one of these cycles and call it .
We now define a new weighted directed graph in which the cycle is "contracted" into one node as follows:
The nodes of are the nodes of not in plus a new node denoted .
If is an edge in with and (an edge coming into the cycle), then include in a new edge , and define .
If is an edge in with and (an edge going away from the cycle), then include in a new edge , and define .
If is an edge in with and (an edge unrelated to the cycle), then include in a new edge , and define .
For each edge in , we remember which edge in it corresponds to.
Now find a minimum spanning arborescence of using a call to .
Since is a spanning arborescence, each vertex has exactly one incoming edge.
Let be the unique incoming edge to in .
This edge corresponds to an edge with .
Remove the edge from , breaking the cycle.
Mark each remaining edge in .
For each edge in , mark its corresponding edge in .
Now we define to be the set of marked edges, which form a minimum spanning arborescence.
Observe that is defined in terms of , with having strictly fewer vertices than . Finding for a single-vertex graph is trivial (it is just itself), so the recursive algorithm is guaranteed to terminate.
Running time
The running time of this algorithm is . A faster implementation of the algorithm due to Robert Tarjan runs in time for sparse graphs and for dense graphs. This is as fast as Prim's algorithm for an undirected minimum spanning tree. In 1986, Gabow, Galil, Spencer, and Tarjan produced a faster implementation, with running time .
References |
https://en.wikipedia.org/wiki/Secret%20Service%202 | Secret Service 2: Security Breach is a computer game created by 4D Rulers and published by Activision Value. It puts the player in the position of a member of the secret service whose purpose is to defend the President. It is a sequel to Secret Service (2001).
Story
The security of the President and the nation rests squarely on the player's shoulders. As a new recruit on the rise, they will be faced with many life-threatening situations. Relying on their instincts and training, they must detect threats and stop terrorist actions before they can become a reality. It's their responsibility to deal with the "bad guys", protect the good guys and the overall well-being of their country.
Features
Escorting of officials through hostile environments
Large arsenal, including dozens of tactical weapons from handguns to rocket launchers
Graphics system with real-time lighting, particle effects, bump mapping, spectacular lighting, stencil shadowing and highly detailed environments
Environments feature destructible objects, exploding barrels and other objects
Locational damage system
Encounter many types of criminals from low-level mob enforcers to highly dangerous terrorists
External links
4D Rulers Official Homepage
IGN review
2003 video games
Video games about police officers
Video games developed in the United States
Video games set in the United States
Windows games
Windows-only games
First-person shooters |
https://en.wikipedia.org/wiki/Eutypella%20scoparia | Eutypella scoparia is a plant pathogen that causes Eutypa dieback on pecan.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Nut tree diseases
Xylariales
Fungi described in 1823 |
https://en.wikipedia.org/wiki/Didymella%20arachidicola | Didymella arachidicola (syn. Didymosphaeria arachidicola) is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Pleosporales
Fungal plant pathogens and diseases
Fungi described in 1924 |
https://en.wikipedia.org/wiki/Elsino%C3%AB%20sacchari | Elsinoe sacchari is the plant pathogen causing white rash of sugarcane.
Hosts
Hosts include sugarcane.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Elsinoë
Fungi described in 1964 |
https://en.wikipedia.org/wiki/Elsino%C3%AB%20theae | Elsinoe theae is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Elsinoë
Fungi described in 1941 |
https://en.wikipedia.org/wiki/Sphaceloma%20coryli | Sphaceloma coryli is a plant pathogen infecting hazelnuts.
References
External links
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Hazelnut tree diseases
Myriangiales
Fungi described in 1976 |
https://en.wikipedia.org/wiki/Sphaceloma%20poinsettiae | Sphaceloma poinsettiae is a fungal plant pathogen. It causes poinsettia scab, which is a spot anthracnose disease.
References
External links
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ornamental plant pathogens and diseases
Myriangiales
Fungi described in 1942 |
https://en.wikipedia.org/wiki/Sphaceloma%20randii | Sphaceloma randii is a fungus which is a plant pathogen infecting pecan.
References
External links
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Nut tree diseases
Myriangiales
Fungi described in 1965 |
https://en.wikipedia.org/wiki/Hi-5%20%28Australian%20TV%20series%29 | Hi-5 is an Australian children's television series, originally produced by Kids Like Us and later Southern Star for the Nine Network, created by Helena Harris and Posie Graeme-Evans. The program is known for its educational content, and for the cast of the program, who became a recognised musical group for children outside of the series, known collectively as Hi-5. It has generated discussion about what is considered appropriate television for children. The series premiered on 12 April 1999 on the Nine Network.
The series is designed for a pre-school audience, featuring five performers who educate and entertain through play, movement and music, which is an integral part of the series. The segments of the show are based on an educational model. The original cast was composed of Kellie Crawford, Kathleen de Leon Jones, Nathan Foley, Tim Harding and Charli Robinson. By the end of 2008, this line-up had been completely phased out and replaced with a new group of performers. Hi-5 received three Logie Television Awards for Most Outstanding Children's Program.
Harris and Graeme-Evans ended their involvement with the series in 2008 when the program was sold to Southern Star and the Nine Network. The final episode of Hi-5 aired on 16 December 2011 as a result of the Nine Network selling the property in 2012. A spin-off series, Hi-5 House, aired on Nick Jr. from 2013 to 2016, produced with no involvement from Nine. The network renewed its partnership with the brand in October 2016 and produced a revived series with a new cast, which aired on 9Go! in 2017.
Format
Hi-5 is a variety-style series for preschoolers which features music as an integral part of its premise. Aimed at children aged between two and eight, the series incorporates educational trends with a pop music appeal, using song and movement to capture the attention of children. The series employs central themes of exploration and discovery, providing children with an opportunity for a "sensitive exploration of their world". Hi-5 encourages children to "take a joyous and active part in life", with active participation encouraged. The program features five presenters who are collectively known as Hi-5, and perform songs as a group as well as presenting individual segments. All segments are integrated with music as a tool to highlight the key concepts of each episode.
The Shapes in Space segment focuses on visual and spatial awareness, with the presenter exploring shapes, colour and everyday materials such as boxes and playdough. Musicality is explored through Making Music, with an emphasis on pitch, rhythm, beat, melody, and using a variety of real and pretend instruments. The presenter of Body Move encourages children to participate in movement and dance, developing physical coordination and motor development. Linguistics and aural skills are at the centre of the Word Play segment, featuring a puppet named Chatterbox who assists in the exploration of language through stories and rhymes. Puzzl |
https://en.wikipedia.org/wiki/Entyloma%20ellisii | Entyloma ellisii is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ustilaginomycotina
Fungi described in 1890 |
https://en.wikipedia.org/wiki/Erysiphe%20graminis%20f.%20sp.%20avenae | Erysiphe graminis f. sp. avenae is a plant pathogen of oats.
References
External links
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Oats diseases
graminis f. sp. avenae
Forma specialis taxa |
https://en.wikipedia.org/wiki/Golovinomyces%20cichoracearum%20var.%20latisporus | Golovinomyces cichoracearum var. latisporus is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Leotiomycetes |
https://en.wikipedia.org/wiki/Leveillula%20compositarum%20f.%20helianthi | Leveillula compositarum f. helianthi is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Leotiomycetes |
https://en.wikipedia.org/wiki/Microsphaera%20coryli | Microsphaera coryli is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera |
https://en.wikipedia.org/wiki/Microsphaera%20ellisii | Microsphaera ellisii is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera
Fungi described in 1982 |
https://en.wikipedia.org/wiki/Microsphaera%20euphorbiae | Microsphaera euphorbiae is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera
Fungi described in 1876 |
https://en.wikipedia.org/wiki/Microsphaera%20hommae | Microsphaera hommae is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera
Fungi described in 1982 |
https://en.wikipedia.org/wiki/Microsphaera%20vaccinii | Microsphaera vaccinii is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera |
https://en.wikipedia.org/wiki/Microsphaera%20verruculosa | Microsphaera verruculosa is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Microsphaera
Fungi described in 1981 |
https://en.wikipedia.org/wiki/Ovulariopsis%20papayae | Ovulariopsis papayae is a plant pathogen affecting papayas.
See also
List of papaya diseases
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal tree pathogens and diseases
Papaya tree diseases
Leotiomycetes |
https://en.wikipedia.org/wiki/Exobasidium%20vaccinii%20var.%20japonicum | Exobasidium vaccinii var. japonicum is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ustilaginomycotina
Fungi described in 1896 |
https://en.wikipedia.org/wiki/SplitsTree | SplitsTree is a popular freeware program for inferring phylogenetic trees, phylogenetic networks, or, more generally, splits graphs, from various types of data such as a sequence alignment, a distance matrix or a set of trees. SplitsTree implements published methods such as split decomposition, neighbor-net, consensus networks, super networks methods or methods for computing hybridization or simple recombination networks. It uses the NEXUS file format. The splits graph is defined using a special data block (SPLITS block).
See also
Phylogenetic tree viewers
Dendroscope
MEGAN
References
External links
SplitsTree homepage (New Website for informations about SplitsTree)
Alternative download page for the latest version (4.15) and manual (June 2019), hosted by the Department of Computer Science at the Eberhard Karls University Tübingen
Algorithms in Bioinformatics, Daniel Huson's working group developing SplitsTree and other bioinformatics software
List of phylogeny software, hosted at the University of Washington
The Genealogical World of Phylogenetic Networks provides a wide range of examples for splits graphs, most of which were generated with SplitsTree
Who is Who in Phylogenetic Networks lists software, researchers and literature dealing with phylogenetic networks
Phylogenetics software
Molecular biology |
https://en.wikipedia.org/wiki/Kretzschmaria%20zonata | Kretzschmaria zonata is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Xylariales
Fungi described in 1845
Taxa named by Joseph-Henri Léveillé |
https://en.wikipedia.org/wiki/Nemania%20diffusa | Nemania diffusa is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Xylariales
Fungi described in 1803
Taxa named by James Sowerby |
https://en.wikipedia.org/wiki/Nemania%20serpens | Nemania serpens is a plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Xylariales
Fungi of Europe
Fungi described in 1787
Taxa named by Christiaan Hendrik Persoon |
https://en.wikipedia.org/wiki/Rosellinia%20arcuata | Rosellinia arcuata is a plant pathogen infecting tea.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Tea diseases
Xylariales
Fungi described in 1916
Taxa named by Thomas Petch |
https://en.wikipedia.org/wiki/Zopfia%20rhizophila | Zopfia rhizophila is a plant pathogen that causes Zopfia root rot in asparagus.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Vegetable diseases
Monocot diseases
Pleosporales
Taxa named by Gottlob Ludwig Rabenhorst |
https://en.wikipedia.org/wiki/Ethnodoxology | According to the Global Ethnodoxology Network (GEN), Ethnodoxology is "the interdisciplinary study of how Christians in every culture engage with God and the world through their own artistic expressions."
Other definitions developed and used during the first 20 years of the term being used:
Ethnodoxology is the theological and anthropological study, and practical application, of how every cultural group might use its unique and diverse artistic expressions appropriately to worship the God of the Bible.
Ethnodoxology is "the theological and practical study of how and why people of diverse cultures praise and glorify the true and living God as revealed in the Bible."
Ethnodoxology is a theological and anthropological framework guiding all cultures to worship God using their unique artistic expressions.
Ethnodoxology is the worldwide practice and study of arts facilitation that encourages the grassroots, local composition and production of artistry that is culturally relevant, biblically sound, and emotionally resonant, for use in the body of Christ for worship, discipleship, evangelism, and other extensions of God’s love in the world.
The term ethnodoxology was coined by Dave Hall. The earliest appearance of the term in print was a 1997 issue of the journal EM News (Vol. 6, No. 3), by the editor, Brian Schrag.
A broad resource for those in the field is a pair of volumes: Worship and Mission for the Global Church: An Ethnodoxology Handbook and its how-to companion Creating Local Arts Together: A Manual to Help Communities Reach their Kingdom Goals. The GEN YouTube channel contains many videos about the practice of ethnodoxology. The open-access scholarly journal Ethnodoxology: A Global Forum on Arts and Christian Faith contains peer-reviewed papers, working papers, and book reviews in the field.
References
External links
Global Ethnodoxology Network: Definition of Ethnodoxology
Ethnomusicology
Christian music |
https://en.wikipedia.org/wiki/Ganoderma%20lobatum | Ganoderma lobatum is a fungal plant pathogen.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal plant pathogens and diseases
Ganodermataceae
Fungi described in 1832
Taxa named by Lewis David de Schweinitz |
https://en.wikipedia.org/wiki/Idriella%20lunata | Idriella lunata is a plant pathogen that causes root rot on strawberries and was first observed in California in 1956.
References
External links
Index Fungorum
USDA ARS Fungal Database
Fungal strawberry diseases
Helotiaceae
Fungi described in 1956 |
https://en.wikipedia.org/wiki/NCAA%20Division%20I%20FBS%20football%20win%E2%80%93loss%20records | The following data is current as of the end of the 2022 season, which ended after the 2023 College Football Playoff National Championship. The following list reflects the records according to the NCAA. Not all wins and losses in this list have occurred in the highest level of play, but are recognized by the NCAA. This list takes into account results modified later due to NCAA action, such as vacated victories and forfeits. Percentages are figured to 3 decimal places. In the event of a tie, the team with the most wins is listed first.
American Athletic Conference
Atlantic Coast Conference
Big 12 Conference
Big Ten Conference
Conference USA
Independent
Mid-American Conference
Mountain West Conference
Pac-12 Conference
Southeastern Conference
Sun Belt Conference
References
Lists of college football team records |
https://en.wikipedia.org/wiki/Trichloroethylene%20%28data%20page%29 | This page provides supplementary chemical data on trichloroethylene.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as eChemPortal, and follow its directions.
Mallinckrodt Baker.
FLUKA.
Structure and properties
Thermodynamic properties
Vapor pressure of liquid
Table data obtained from CRC Handbook of Chemistry and Physics 44th ed.
Distillation data
Spectral data
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Mail%20retrieval%20agent | A mail retrieval agent (MRA) is a computer application that retrieves or fetches e-mail from a remote mail server and works with a mail delivery agent to deliver mail to a local or remote email mailbox. MRA is an automated agent that works on behalf of the user agent checks for the new incoming mail. MRAs may be external applications by themselves or be built into bigger applications like a mail user agent. Significant examples of standalone MRAs include fetchmail and getmail.
The concept of an MRA is not standardized in email architecture. Although they operate like mail transfer agents, MRAs are technically clients when they retrieve and submit messages.
Delivery mechanisms
The mail retrieval agent may support delivery of retrieved mail via the following mechanisms:
Via a mail transport agent (Listening for SMTP transfers on port 25)
Via a mail delivery agent
Direct delivery to an mbox formatted mailbox
Direct delivery to a maildir directory
Output to standard output
Multiple mailbox support
The mail retriever agent may support retrieval of mail from multiple mailboxes simultaneously. This enables a mailserver to have a centrally configured mail retriever agent that runs against a dedicated mail system account, and collects the mail for all users in a single invocation (rather than using cron to run a mail retriever agent against all the mail recipients).
See also
Email agent (infrastructure) (MxA)
References
Bibliography
Email agents |
https://en.wikipedia.org/wiki/Burstsort | Burstsort and its variants are cache-efficient algorithms for sorting strings. They are variants of the traditional radix sort but faster for large data sets of common strings, first published in 2003, with some optimizing versions published in later years.
Burstsort algorithms use a trie to store prefixes of strings, with growable arrays of pointers as end nodes containing sorted, unique, suffixes (referred to as buckets). Some variants copy the string tails into the buckets. As the buckets grow beyond a predetermined threshold, the buckets are "burst" into tries, giving the sort its name. A more recent variant uses a bucket index with smaller sub-buckets to reduce memory usage. Most implementations delegate to multikey quicksort, an extension of three-way radix quicksort, to sort the contents of the buckets. By dividing the input into buckets with common prefixes, the sorting can be done in a cache-efficient manner.
Burstsort was introduced as a sort that is similar to MSD radix sort, but is faster due to being aware of caching and related radixes being stored closer to each other due to specifics of trie structure. It exploits specifics of strings that are usually encountered in real world. And although asymptotically it is the same as radix sort, with time complexity of (w – word length and n – number of strings to be sorted), but due to better memory distribution it tends to be twice as fast on big data sets of strings. It has been billed as the "fastest known algorithm to sort large sets of strings".
References
A burstsort derivative (C-burstsort), faster than burstsort:
The data type used in burstsort:
External links
A burstsort implementation in Java: burstsort4j
Judy arrays are a type of copy burstsort: C implementation
String sorting algorithms |
https://en.wikipedia.org/wiki/YAP%20%28Prolog%29 | YAP is an open-source, high-performance implementation of the Prolog programming language developed at LIACC/Universidade do Porto and at COPPE Sistemas/UFRJ. Its Prolog engine is based in the WAM (Warren Abstract Machine), with several optimizations for better performance. YAP follows the Edinburgh tradition, and is largely compatible with the ISO-Prolog standard and with Quintus Prolog and SICStus Prolog. YAP has been developed since 1985. The original version was written in assembly, C and Prolog, and achieved high performance on m68k-based machines.
See also
Comparison of Prolog implementations
External links
YAP Prolog website
Free compilers and interpreters
Prolog programming language family |
https://en.wikipedia.org/wiki/Partners%20with%20Mel%20Tiangco | Partners with Mel Tiangco is a 2004 Philippine television talk show broadcast by GMA Network. Hosted by Mel Tiangco, it premiered on February 15, 2004 replacing Partners Mel and Jay. The show concluded on July 25, 2004 with a total of 24 episodes. It was replaced by Mel & Joey in its timeslot.
References
2004 Philippine television series debuts
2004 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine television talk shows |
https://en.wikipedia.org/wiki/Cell%20lists | Cell lists (also sometimes referred to as cell linked-lists) is a data structure in molecular dynamics simulations to find all atom pairs within a given cut-off distance of each other. These pairs are needed to compute the short-range non-bonded interactions in a system, such as Van der Waals forces or the short-range part of the electrostatic interaction when using Ewald summation.
Algorithm
Cell lists work by subdividing the simulation domain into cells with an edge length greater than or equal to the cut-off radius of the interaction to be computed. The particles are sorted into these cells and the interactions are computed between particles in the same or neighbouring cells.
In its most basic form, the non-bonded interactions for a cut-off distance are computed as follows:
for all neighbouring cell pairs do
for all do
for all do
if then
Compute the interaction between and .
end if
end for
end for
end for
Since the cell length is at least in all dimensions, no particles within of each other can be missed.
Given a simulation with particles with a homogeneous particle density, the number of cells is proportional to and inversely proportional to the cut-off radius (i.e. if increases, so does the number of cells). The average number of particles per cell therefore does not depend on the total number of particles. The cost of interacting two cells is in . The number of cell pairs is proportional to the number of cells which is again proportional to the number of particles . The total cost of finding all pairwise distances within a given cut-off is in , which is significantly better than computing the pairwise distances naively.
Periodic boundary conditions
In most simulations, periodic boundary conditions are used to avoid imposing artificial boundary conditions. Using cell lists, these boundaries can be implemented in two ways.
Ghost cells
In the ghost cells approach, the simulation box is wrapped in an additional layer of cells. These cells contain periodically wrapped copies of the corresponding simulation cells inside the domain.
Although the data—and usually also the computational cost—is doubled for interactions over the periodic boundary, this approach has the advantage of being straightforward to implement and very easy to parallelize, since cells will only interact with their geographical neighbours.
Periodic wrapping
Instead of creating ghost cells, cell pairs that interact over a periodic boundary can also use a periodic correction vector . This vector, which can be stored or computed for every cell pair , contains the correction which needs to be applied to "wrap" one cell around the domain to neighbour the other. The pairwise distance between two particles and is then computed as
.
This approach, although more efficient than using ghost cells, is less straightforward to implement (the cell pairs need to be identified over the periodic boundaries and the vector needs to be computed/stored).
Improvements
D |
https://en.wikipedia.org/wiki/Verlet%20list | A Verlet list (named after Loup Verlet) is a data structure in molecular dynamics simulations to efficiently maintain a list of all particles within a given cut-off distance of each other.
This method may easily be applied to Monte Carlo simulations. For short-range interactions, a cut-off radius is typically used, beyond which particle interactions are considered "close enough" to zero to be safely ignored. For each particle, a Verlet list is constructed that lists all other particles within the potential cut-off distance, plus some extra distance so that the list may be used for several consecutive Monte Carlo "sweeps" (set of Monte Carlo steps or moves) before being updated. If we wish to use the same Verlet list times before updating, then the cut-off distance for inclusion in the Verlet list should be , where is the cut-off distance of the potential, and is the maximum Monte Carlo step (move) of a single particle. Thus, we will spend of order time to compute the Verlet lists ( is the total number of particles), but are rewarded with Monte Carlo "sweeps" of order instead of . By optimizing our choice of it can be shown that Verlet lists allow converting the problem of Monte Carlo sweeps to an problem.
Using cell lists to identify the nearest neighbors in further reduces the computational cost.
See also
Verlet integration
Fast multipole method
Molecular mechanics
Software for molecular mechanics modeling
References
External links
Constructing a Neighbour List — from Introduction to Atomistic Simulations course at the University of Helsinki.
Molecular dynamics
Computational chemistry |
https://en.wikipedia.org/wiki/Connection%20string | In computing, a connection string is a string that specifies information about a data source and the means of connecting to it. It is passed in code to an underlying driver or provider in order to initiate the connection. Whilst commonly used for a database connection, the data source could also be a spreadsheet or text file.
The connection string may include attributes such as the name of the driver, server and database, as well as security information such as user name and password.
Examples
This example shows a Postgres connection string for connecting to wikipedia.com with SSL and a connection timeout of 180 seconds:
DRIVER={PostgreSQL Unicode};SERVER=www.wikipedia.com;SSL=true;SSLMode=require;DATABASE=wiki;UID=wikiuser;Connect Timeout=180;PWD=ashiknoor
Users of Oracle databases can specify connection strings:
on the command line (as in: sqlplus scott/tiger@connection_string )
via environment variables ($TWO_TASK in Unix-like environments; %TWO_TASK% in Microsoft Windows environments)
in local configuration files (such as the default $ORACLE_HOME/network/admin.tnsnames.ora)
in LDAP-capable directory services
References
External links
Databases
SQL data access
String (computer science) |
https://en.wikipedia.org/wiki/F-sharp | F (F-sharp) may refer to:
F (musical note)
F-sharp minor, a minor musical scale
F-sharp major, a major musical scale
F# (programming language), a .NET programming language
"F Sharp", a comedic song by Tim Minchin on his So Rock CD
"F (Wake Up)", a song on Handle With Care by Nuclear Assault
F A ∞, an album by Godspeed You! Black Emperor
Rot Lop Fan, the F-Sharp Bell of the Obsidian Deeps, a character from the Green Lantern comics
See also |
https://en.wikipedia.org/wiki/A-sharp | A-sharp, A or A# may refer to:
A-sharp major, enharmonic to B-flat major
A-sharp minor
A♯ (musical note), musical pitch
A Sharp (.NET), a port of the Ada programming language to the .NET environment
A Sharp (Axiom), a programming language for the Axiom computer algebra system |
https://en.wikipedia.org/wiki/Probabilistic%20automaton | In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix. Thus, the probabilistic automaton also generalizes the concepts of a Markov chain and of a subshift of finite type. The languages recognized by probabilistic automata are called stochastic languages; these include the regular languages as a subset. The number of stochastic languages is uncountable.
The concept was introduced by Michael O. Rabin in 1963; a certain special case is sometimes known as the Rabin automaton (not to be confused with the subclass of ω-automata also referred to as Rabin automata). In recent years, a variant has been formulated in terms of quantum probabilities, the quantum finite automaton.
Informal Description
For a given initial state and input character, a deterministic finite automaton (DFA) has exactly one next state, and a nondeterministic finite automaton (NFA) has a set of next states. A probabilistic automaton (PA) instead has a weighted set (or vector) of next states, where the weights must sum to 1 and therefore can be interpreted as probabilities (making it a stochastic vector). The notions states and acceptance must also be modified to reflect the introduction of these weights. The state of the machine as a given step must now also be represented by a stochastic vector of states, and a state accepted if its total probability of being in an acceptance state exceeds some cut-off.
A PA is in some sense a half-way step from deterministic to non-deterministic, as it allows a set of next states but with restrictions on their weights. However, this is somewhat misleading, as the PA utilizes the notion of the real numbers to define the weights, which is absent in the definition of both DFAs and NFAs. This additional freedom enables them to decide languages that are not regular, such as the p-adic languages with irrational parameters. As such, PAs are more powerful than both DFAs and NFAs (which are famously equally powerful).
Formal Definition
The probabilistic automaton may be defined as an extension of a nondeterministic finite automaton , together with two probabilities: the probability of a particular state transition taking place, and with the initial state replaced by a stochastic vector giving the probability of the automaton being in a given initial state.
For the ordinary non-deterministic finite automaton, one has
a finite set of states
a finite set of input symbols
a transition function
a set of states distinguished as accepting (or final) states .
Here, denotes the power set of .
By use of currying, the transition function of a non-deterministic finite automaton can be written as a membership function
so that if and otherwise. The curried transition function can be understood to be a matrix with matrix entries
The matrix is then a square |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.