Wiki @ Karl Jones dot com - New pages [en]

MongoDB populate

2018-09-12T15:04:18Z

Karl Jones: Created page with "In the MongoDB database, '''populate''' is a function which links documents across collections. == See also == * MongoDB == External links == * [https://medium.com..."

In the [[MongoDB]] database, '''populate''' is a function which links documents across collections.

== See also ==

* [[MongoDB]]

== External links ==

* [https://medium.com/@nicknauert/mongooses-model-populate-b844ae6d1ee7 Mongoose’s Model.Populate() - A Tutorial We Newbs Can Understand] @ Medium
* [https://stackoverflow.com/questions/38051977/what-does-populate-in-mongoose-mean What does populate in mongoose mean?] @ Stack Overflow

[[Category:Computer science]]
[[Category:Databases]]
[[Category:MongoDB]]

WordPress data model

2018-09-09T19:48:45Z

Karl Jones: Created page with "The '''WordPress data model''' is the data model used by WordPress to organize data elements and standardize how the data elements relate to one another. == See also..."

The '''WordPress data model''' is the [[data model]] used by [[WordPress]] to organize data elements and standardize how the data elements relate to one another.

== See also ==

* [[WordPress database]]

== External links ==

=== WordPress data model ===

* [https://tommcfarlin.com/models-in-wordpress/ Data Models in WordPress – Their Perspective, Not Ours]

[[Category:Databases]]
[[Category:WordPress]]

Math support in MediaWiki

2018-08-19T15:02:07Z

Karl Jones:

[[MediaWiki]] supports the display of mathematical formulas.

== Summary ==

"How does math markup in MediaWiki work? It takes LaTeX math expression and converts them into images using texvc. The texvc source comes with MediaWiki, but you’ll have to compile it yourself. Since texvc is partly written in OCaml, you’d need to install OCaml on your server just to compile it. However, there’s an easier way: just go to MediaWiki’s SourceForge site and download texvc binary. If the binary doesn’t work for you, however, you’ll have to download OCaml and compile your own binary. Once you have the texvc binary, put it in the/math/ folder of your MediaWiki installation."

Source: [https://www.scoop.it/t/webdevilopers/p/4018904758/2014/04/03/how-to-get-math-support-in-mediawiki Scoop.it]

== Installation ==

=== Math extension ===

* [https://www.mediawiki.org/wiki/Extension:Math Extension:Math] - The Math extension provides support for rendering mathematical formulae.
** An overview of what can currently be done with this extension is found at the [https://en.wikipedia.org/wiki/Help:Displaying_a_formula English Wikipedia's documentation].
**More information about installing and configuring this extension, including for older versions, can be found at [https://www.mediawiki.org/wiki/Special:MyLanguage/Extension:Math/advancedSettings Extension:Math/advancedSettings].

=== texvc ===

* [https://www.mediawiki.org/wiki/Texvc Texvc] - One of the external programs to display mathematical formulas in MediaWiki. texvc is a shortened version of TeX validator and converter. It validates AMS-LaTeX mathematical expressions and converts them to HTML, MathML, or PNG graphics.

== Troubleshooting ==

* [https://www.mediawiki.org/wiki/Manual:Enable_TeX/problems Manual:Enable TeX/problems]

== See also ==

* [[Mathematics]]
* [[MediaWiki]]

== External links ==

* [https://www.siteground.com/tutorials/mediawiki/math/ MediaWiki Math support] @ SiteGround

[[Category:MediaWiki]]
[[Category:Software]]

PlayCanvas

2018-06-16T00:34:15Z

Karl Jones: Created page with "'''PlayCanvas''' is an open source 3D game engine/interactive 3D application engine alongside a proprietary cloud-hosted creation platform that allows for simultaneous editing..."

'''PlayCanvas''' is an open source 3D game engine/interactive 3D application engine alongside a proprietary cloud-hosted creation platform that allows for simultaneous editing from multiple computers via a browser-based interface. It runs in modern browsers that support WebGL, including Mozilla Firefox and Google Chrome. The engine is capable of rigid-body physics simulation, handling three-dimensional audio and 3D animations.

PlayCanvas has gained the support of ARM, Activision and Mozilla.

The PlayCanvas engine was open-sourced on June 4, 2014.

== See also ==

== External links ==

* [http://playcanvas.com PlayCanvas] - Official website
* [https://en.wikipedia.org/wiki/PlayCanvas PlayCanvas] @ Wikipedia

Trade route

2018-05-27T12:47:01Z

Karl Jones: Created page with "A '''trade route''' is a logistical network identified as a series of pathways and stoppages used for the commercial transport of cargo. The term can also be used to refer to..."

A '''trade route''' is a logistical network identified as a series of pathways and stoppages used for the commercial transport of cargo. The term can also be used to refer to trade over bodies of water. Allowing goods to reach distant markets, a single trade route contains long distance arteries, which may further be connected to smaller networks of commercial and noncommercial transportation routes. Among notable trade routes was the Amber Road, which served as a dependable network for long-distance trade. Maritime trade along the Spice Route became prominent during the Middle Ages, when nations resorted to military means for control of this influential route. During the Middle Ages, organizations such as the Hanseatic League, aimed at protecting interests of the merchants, and trade became increasingly prominent.

In modern times, commercial activity shifted from the major trade routes of the Old World to newer routes between modern nation-states. This activity was sometimes carried out without traditional protection of trade and under international free-trade agreements, which allowed commercial goods to cross borders with relaxed restrictions. Innovative transportation of modern times includes pipeline transport and the relatively well-known trade involving rail routes, automobiles, and cargo airlines.

== See also ==

== External links ==

* [https://en.wikipedia.org/wiki/Trade_route Trade route] @ Wikipedia
* [https://merchantmachine.co.uk/medieval-trade-routes/ An Incredibly Detailed Map Of Medieval Trade Routes]

List of image generators

2018-05-25T20:18:38Z

Karl Jones: Created page with "An '''image generator''' is any tool which generates images. == See also == * Image * Image editing == External links == * [https://coolbackgrounds.io/ Cool Ba..."

An '''image generator''' is any tool which generates [[images]].

== See also ==

* [[Image]]
* [[Image editing]]

== External links ==

* [https://coolbackgrounds.io/ Cool Backgrounds]

[[Category:Arts and crafts]]
[[Category:Images]]
[[Category:Visual arts]]

Web app manifest

2018-04-17T19:20:09Z

Karl Jones:

A '''web app manifest''' is a text document which provides information about an application (such as name, author, icon, and description) in a JSON text file. The purpose of the manifest is to install web applications to the homescreen of a device, providing users with quicker access and a richer experience.

Web app manifests are part of a collection of web technologies called progressive web apps, which are web applications that can be installed to the homescreen of a device without needing the user to go through an app store, along with other capabilities such as being available offline and receiving push notifications.

== See also ==

* [[Web application]]

== External links ==

* [https://developers.google.com/web/fundamentals/web-app-manifest/ The Web App Manifest] @ developers.google.com
* [https://developer.mozilla.org/en-US/docs/Web/Manifest Web App Manifest]] @ developer.mozilla.org
* [https://www.w3.org/TR/appmanifest/ Web App Manifest] @ w3.org
* [https://medium.com/dev-channel/how-to-add-a-web-app-manifest-and-mobile-proof-your-site-450e6e485638 How to add a web app manifest] @ medium.com
* [https://thishereweb.com/understanding-the-manifest-for-web-app-3f6cd2b853d6 Understanding the Manifest for Web App] @ medium.com
* [https://tomitm.github.io/appmanifest/ Web App Manifest Generator]
* [https://app-manifest.firebaseapp.com/ Web App Manifest Generator]

[[Category:Web design]]

Robots meta directive

2018-03-26T17:28:49Z

Karl Jones: Created page with "'''Robots meta directives''' (sometimes called “meta tags”) are pieces of code that provide crawlers instructions for how to crawl or index web page content. Whereas rob..."

'''Robots meta directives''' (sometimes called “meta tags”) are pieces of code that provide crawlers instructions for how to crawl or index web page content. Whereas [[robots.txt]] file directives give bots suggestions for how to crawl a website's pages, robots meta directives provide more firm instructions on how to crawl and index a page's content.

== Description ==

There are two types of robots meta directives: those that are part of the HTML page (like the meta robotstag) and those that the web server sends as HTTP headers (such as x-robots-tag). The same parameters (i.e., the crawling or indexing instructions a meta tag provides, such as “noindex” and “nofollow” in the example above) can be used with both meta robots and the x-robots-tag; what differs is how those parameters are communicated to crawlers.

Meta directives give crawlers instructions about how to crawl and index information they find on a specific webpage. If these directives are discovered by bots, their parameters serve as strong suggestions for crawler indexation behavior. But as with [[robots.txt]] files, crawlers don’t have to follow your meta directives, so it’s a safe bet that some malicious web robots will ignore your directives.

Below are the parameters that search engine crawlers understand and follow when they’re used in robots meta directives. The parameters are not case-sensitive, but do note that it is possible some search engines may only follow a subset of these parameters or may treat some directives slightly differently.

Indexation-controlling parameters:

* Noindex: Tells a search engine not to index a page.
* Index: Tells a search engine to index a page. Note that you don’t need to add this meta tag; it’s the default.
* Follow: Even if the page isn’t indexed, the crawler should follow all the links on a page and pass equity to the linked pages.
* Nofollow: Tells a crawler not to follow any links on a page or pass along any link equity.
* Noimageindex: Tells a crawler not to index any images on a page.
* None: Equivalent to using both the noindex and nofollow tags simultaneously.
* Noarchive: Search engines should not show a cached link to this page on a SERP.
* Nocache: Same as noarchive, but only used by Internet Explorer and Firefox.
* Nosnippet: Tells a search engine not to show a snippet of this page (i.e. meta description) of this page on a SERP.
* Noodyp/noydir [OBSOLETE]: Prevents search engines from using a page’s DMOZ description as the SERP snippet for this page. However, DMOZ was retired in early 2017, making this tag obsolete.
* Unavailable_after: Search engines should no longer index this page after a particular date.

== Types of robots meta directives ==

There are two main types of robots meta directives: the meta robots tag and the x-robots-tag. Any parameter that can be used in a meta robots tag can also be specified in an x-robots-tag.

We’ll talk about both the meta robots and x-robots tag directives below.

== See also ==

* [[HTML]]
* [[HTML elements]]
* [[Meta (HTML element)]]

== External links ==

* [https://moz.com/learn/seo/robots-meta-directives Robots Meta Directives] @ moz.com
* [https://en.wikipedia.org/wiki/Noindex noindex] @ Wikipedia
* [https://blog.hubspot.com/marketing/how-to-unindex-pages-from-search-engines Using Noindex, Nofollow HTML Metatags: How to Tell Google Not to Index a Page in Search] @ blog.hubspot.com

[[Category:HTML elements]]
[[Category:Metadata]]

BSON

2018-02-06T18:01:29Z

Karl Jones: Created page with "'''BSON''' /ˈbiːsən/ is a computer data interchange format used mainly as a data storage and network transfer format in the MongoDB database. It is a binary form for r..."

'''BSON''' /ˈbiːsən/ is a computer data interchange format used mainly as a data storage and network transfer format in the [[MongoDB]] database.

It is a binary form for representing simple data structures, associative arrays (called objects or documents in MongoDB), and various data types of specific interest to MongoDB.

The name "BSON" is based on the term [[JSON]] and stands for "Binary JSON".

== See also ==

* [[JSON]]
* [[MongoDB]]

== External links ==

* [https://en.wikipedia.org/wiki/BSON BSON] @ Wikipedia

[[Category:Databases]]

Node.js library

2018-01-24T01:57:27Z

Karl Jones:

'''[[Node.js]]''' supports [[Library (computing)|libraries]].

== See also ==

* [[Library (computing)]]
* [[Node.js]]

== External links ==

Libraries of interest:

* [https://github.com/GoogleChrome/puppeteer Puppeteer] - Provides a high-level API to control headless Chrome or Chromium over the DevTools Protocol. It can also be configured to use full (non-headless) Chrome or Chromium. Most things that you can do manually in the browser can be done using Puppeteer! Here are a few examples to get you started:
** Generate screenshots and PDFs of pages.
** Crawl a SPA and generate pre-rendered content (i.e. "SSR").
** Scrape content from websites.
** Automate form submission, UI testing, keyboard input, etc.
** Create an up-to-date, automated testing environment. Run your tests directly in the latest version of Chrome using the latest JavaScript and browser features.
** Capture a timeline trace of your site to help diagnose performance issues.

[[Category:Computing]]
[[Category:Node.js]]

Apache Taverna

2017-12-29T15:30:18Z

Karl Jones:

'''Apache Taverna''' is an open source software tool for designing and executing workflows, initially created by the myGrid project under the name Taverna Workbench, now a project under the Apache incubator.

Taverna allows users to integrate many different software components, including WSDL SOAP or [[Representational state transfer|REST]] [[Web service|web services]], such as those provided by the National Center for Biotechnology Information, the European Bioinformatics Institute, the DNA Databank of Japan (DDBJ), SoapLab, BioMOBY and EMBOSS. The set of available services is not finite and users can import new service descriptions into the Taverna Workbench.

Taverna Workbench provides a desktop authoring environment and enactment engine for scientific workflows. The Taverna workflow engine is also available separately, as a Java API, command line tool or as a server.

Taverna is used by users in many domains, such as bioinformatics, cheminformatics, medicine, astronomy, social science, music, and digital preservation.

Some of the services for the use in Taverna workflows can be discovered through the BioCatalogue - a public, centralized and curated registry of Life Science Web services. Taverna workflows can also be shared with other people through the myExperiment social web site for scientists. BioCatalogue and myExperiment are another two product from the myGrid consortium.

Taverna is used in over 350 organizations around the world, both academic and commercial. As of 2011, there have been over 80,000 downloads of Taverna across different versions.

== See also ==

* [[Representational state transfer]]
* [[Software]]
* [[Web service]]

== External links ==

* [https://en.wikipedia.org/wiki/Apache_Taverna Apache Taverna] @ Wikipedia

[[Category:Software]]

IndexOf (JavaScript)

2017-10-02T13:36:35Z

Karl Jones: Created page with "In JavaScript, '''indexOf''' is a function for determining the index of a value within an array. == See also == * JavaScript Category:JavaScript {{lowercase}}"

In [[JavaScript]], '''indexOf''' is a function for determining the index of a value within an array.

== See also ==

* [[JavaScript]]

[[Category:JavaScript]]

{{lowercase}}

Xargs

2017-09-22T19:36:32Z

Karl Jones: Created page with "'''xargs''' is a command on Unix and most Unix-like operating systems used to build and execute command lines from standard input. Commands such as grep and awk..."

'''xargs''' is a command on [[Unix]] and most [[Unix-like]] operating systems used to build and execute command lines from standard input.

Commands such as [[grep]] and [[awk]] can accept the standard input as a parameter, or argument by using a [[Pipeline (Unix)|pipe]].

However, others such as [[cp]] and echo disregard the standard input stream and rely solely on the arguments found after the command.

Additionally, under the Linux kernel before version 2.6.23, and under many other Unix-like systems, arbitrarily long lists of parameters cannot be passed to a command, so xargs breaks the list of arguments into sublists small enough to be acceptable.

== Description ==

== See also ==

* [[File system]]
* [[Linux]]
* [[Unix]]
* [[Unix-like]]

== External links ==

* [https://en.wikipedia.org/wiki/Xargs xargs] @ Wikipedia

[[Category:Computing]]
[[Category:Unix]]

{{lowercase}}

Trade dress

2017-09-14T13:23:31Z

Karl Jones:

'''Trade dress''' is a legal term of art that generally refers to characteristics of the visual appearance of a product or its packaging (or even the design of a building) that signify the source of the product to consumers.

Trade dress is a form of [[intellectual property]].

== See also ==

* [[Intellectual property]]

== External links ==

* [https://en.wikipedia.org/wiki/Trade_dress Trade dress] @ Wikipedia

[[Category:Intellectual property]]

Donald M. Huber

2017-07-18T00:00:09Z

Karl Jones:

'''Donald M. Huber''' is an Emeritus Professor of Botany and Plant Pathology at Purdue University.

In January 2011, Huber sent a letter to Secretary of Agriculture Tom Vilsack, alerting the federal government to a newly discovered micro-organism that may have the potential to cause infertility and spontaneous abortion in farm animals, raising significant concerns about human health.

The letter described the appearance and prevalence of the unnamed organism may be related to the nation’s over reliance on the weed killer Roundup and/or to something about the genetically engineered Roundup Ready crops, and called on the federal government to immediately stop deregulation of Roundup Ready crops, particularly Roundup Ready alfalfa.

In an interview published in May 2011, Huber said:

<blockquote>
The letter to the Secretary wasn't for public dissemination. It was a request for help. It was meant to bring to his attention the things that many of us out in the field, both from the veterinarians and animal producers as well as agronomists, plant pathologists and our crop producers.

-- [https://www.organicconsumers.org/sites/default/files/artman2/uploads/1/May2011_Huber.pdf Interview with Dr. Huber] (pdf) @ Organic Consumers Association
</blockquote>

== External links ==

* [https://ag.purdue.edu/btny/Pages/Profile.aspx?strAlias=huberd& Profile] @ Purdue
* [https://www.organicconsumers.org/sites/default/files/artman2/uploads/1/May2011_Huber.pdf Interview with Dr. Huber] (pdf) @ Organic Consumers Association
* [http://action.fooddemocracynow.org/sign/dr_hubers_warning/ Dr. Huber's Warning] @ Food Democracy Now
* [http://farmandranchfreedom.org/letter-dr-huber-roundup-animal-miscarriage-infertility/ Letter to Secretary Vilsack from Dr. Huber – Roundup May Be Causing Animal Miscarriages and Infertility]
* [https://geneticliteracyproject.org/glp-facts/don-huber-science-still-looking-for-purdue-professors-gmo-pathogen-time-bomb-2/ Don Huber: Science still looking for Purdue professor’s GMO pathogen time bomb] - July 17, 2018 | Genetic Literacy Project

[[Category:People]]

Database index

2017-07-13T18:39:42Z

Karl Jones: Created page with "A '''database index''' is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maint..."

A '''database index''' is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maintain the index data structure.

Indexes are used to quickly locate data without having to search every row in a database table every time a database table is accessed.

Indexes can be created using one or more columns of a database table, providing the basis for both rapid random lookups and efficient access of ordered records.

An index is a copy of selected columns of data from a table that can be searched very efficiently that also includes a low-level disk block address or direct link to the complete row of data it was copied from. Some databases extend the power of indexing by letting developers create indexes on functions or expressions. For example, an index could be created on upper(last_name), which would only store the upper case versions of the last_name field in the index.

Another option sometimes supported is the use of partial indices, where index entries are created only for those records that satisfy some conditional expression.

A further aspect of flexibility is to permit indexing on user-defined functions, as well as expressions formed from an assortment of built-in functions.

== See also ==

* [[Database]]
* [[Database schema]]

== External links ==

* [https://en.wikipedia.org/wiki/Database_index Database index] @ Wikipedia
* [http://nosql.mypopescu.com/post/89040193652/dude-missing-indexes-seriously Dude, missing indexes? Seriously….]

[[Category:Computer science]]
[[Category:Databases]]

Transmission Control Protocol

2017-07-01T01:26:01Z

Karl Jones: Created page with "The '''Transmission Control Protocol''' ('''TCP''') is one of the main protocols of the Internet protocol suite. It originated in the initial network implementation in whi..."

The '''Transmission Control Protocol''' ('''TCP''') is one of the main protocols of the [[Internet protocol suite]]. It originated in the initial network implementation in which it complemented the [[Internet Protocol]] (IP). Therefore, the entire suite is commonly referred to as TCP/IP.

TCP provides reliable, ordered, and error-checked delivery of a stream of octets between applications running on hosts communicating by an IP network.

Major [[Internet]] applications such as the [[World Wide Web]], [[email]], remote administration, and [[file transfer]] rely on TCP.

Applications that do not require reliable data stream service may use the [[User Datagram Protocol]] (UDP), which provides a connectionless datagram service that emphasizes reduced latency over reliability.

== See also ==

* [[Internet]]
* [[Internet Protocol]]
* [[Internet protocol suite]]
* [[IP address]]
* [[User Datagram Protocol]]

== External Links ==

* [https://en.wikipedia.org/wiki/Transmission_Control_Protocol Transmission Control Protocol] @ Wikipedia

[[Category:Computer networks]]
[[Category:Computing]]
[[Category:Internet]]
[[Category:Telecommunications]]

User Datagram Protocol

2017-07-01T01:10:43Z

Karl Jones:

In electronic communication, the '''User Datagram Protocol''' ('''UDP''') is one of the core members of the Internet protocol suite.

With UDP, computer applications can send messages, in this case referred to as datagrams, to other hosts on an Internet Protocol (IP) network. Prior communications are not required in order to set up transmission channels or data paths.

UDP uses a simple connectionless transmission model with a minimum of protocol mechanism. UDP provides checksums for data integrity, and port numbers for addressing different functions at the source and destination of the datagram. It has no handshaking dialogues, and thus exposes the user's program to any unreliability of the underlying network: there is no guarantee of delivery, ordering, or duplicate protection.

If error-correction facilities are needed at the network interface level, an application may use the [[Transmission Control Protocol]] (TCP) or Stream Control Transmission Protocol (SCTP) which are designed for this purpose.

UDP is suitable for purposes where error checking and correction are either not necessary or are performed in the application; UDP avoids the overhead of such processing at the level of the network interface. Time-sensitive applications often use UDP because dropping packets is preferable to waiting for delayed packets, which may not be an option in a real-time system.

The UDP protocol was designed by David P. Reed in 1980 and formally defined in RFC 768.

== See also ==

* [[Client-server model]]
* [[Client (computing)]]
* [[Server (computing)]]

== External links ==

* [https://en.wikipedia.org/wiki/Client%E2%80%93server_model Client-server model]]

[[Category:Computer networks]]
[[Category:Computing]]
[[Category:Internet]]
[[Category:Telecommunications]]

ITIL

2017-06-14T14:25:57Z

Karl Jones:

'''ITIL''', formally an acronym for '''Information Technology Infrastructure Library''', is a set of detailed practices for IT service management (ITSM) that focuses on aligning IT services with the needs of business. In its current form (known as ITIL 2011), ITIL is published as a series of five core volumes, each of which covers a different ITSM lifecycle stage.

Although ITIL underpins ISO/IEC 20000 (previously BS 15000), the International Service Management Standard for IT service management, there are some differences between the ISO 20000 standard and the ITIL framework.

ITIL describes processes, procedures, tasks, and checklists which are not organization-specific, but can be applied by an organization for establishing integration with the organization's strategy, delivering value, and maintaining a minimum level of competency. It allows the organization to establish a baseline from which it can plan, implement, and measure. It is used to demonstrate compliance and to measure improvement.

Since July 2013, ITIL has been owned by AXELOS, a joint venture between Capita and the Cabinet Office. AXELOS licenses organisations to use the ITIL intellectual property, accredits licensed examination institutes, and manages updates to the framework. Organizations that wish to implement ITIL internally do not require this license.

== See also ==

== External links ==

* [https://en.wikipedia.org/wiki/ITIL ITIL] @ Wikipedia

Minilog

2017-06-07T14:54:47Z

Karl Jones:

'''Minilog''' is [[software]] which provides client-side and server-side [[Logfile|data logging]] with Stream-API backends.

== See also ==

* [[Logfile]]

== External links ==

* [http://mixu.net/minilog/ Official home page]
* [https://github.com/mixu/minilog minilog] @ github.com

[[Category:Computer programming]]
[[Category:Computing]]
[[Category:Software]]

JavaScript destructuring

2017-06-06T19:18:27Z

Karl Jones:

In the [[JavaScript]] programming language, the '''destructuring''' assignment syntax is an expression that makes it possible to unpack values from arrays, or properties from objects, into distinct variables.

== Destructured objects as parameters ==

Destructuring can help us easily extract and manipulate data from arrays or objects into distinct variables and make our parameters more meaningful. This helps us communicate our intentions to readers in the future and helps with maintenance.

* You no longer have to remember the specific ordering
* We can easily have optional parameters
* We can have defaults, which is also nice because it’s self-documenting
* We can have fallbacks for failure conditions, or decide not to if we want to show an error

== See also ==

* [[JavaScript]]

== External links ==

* [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Destructuring_assignment Destructuring assignment] @ developer.mozilla.org
* [http://wesbos.com/destructuring-objects/ A Dead Simple intro to Destructuring JavaScript Objects] @ wesbos.com
* [http://untangled.io/in-depth-es6-destructuring-with-assembled-avengers/ The Most In-Depth Yet Understandable ES6 Destructuring Tutorial] @ untangled.io
* [https://css-tricks.com/new-favorite-es6-toy-destructured-objects-parameters/ Destructured Objects as Parameters] @ css-tricks.com
* [http://jimrottinger.github.io/named-arguments-using-es6-destructuring/ Named and Optional Arguments in Javascript using ES6 Destructuring] by Jim Rottinger

[[Category:Computer programming]]
[[Category:JavaScript]]

Protractor (software testing framework)

2017-06-06T15:52:14Z

Karl Jones: Created page with "'''Protractor''' is an end-to-end test framework for Angular and AngularJS applications. Protractor runs tests against your application running in a real Web..."

'''Protractor''' is an end-to-end test framework for [[AngularJS|Angular and AngularJS]] applications.

Protractor runs tests against your application running in a real [[Web browser|browser]], interacting with it as a [[User (computing)|user]] would.

== See also ==

* [[AngularJS]]
* [[Software testing]]

== External links ==

* [http://www.protractortest.org/ Official website]
* [https://github.com/CarmenPopoviciu/protractor-styleguide Protractor styleguide]

[[Category:AngularJS]]
[[Category:Software]]
[[Category:Software testing]]

Git stash

2017-06-02T13:57:47Z

Karl Jones:

In the [[Git (software)|git revision control system]], the '''stash''' command saves the current state of the working directory, and reverts to a clean working directory.

Use git stash when you want to record the current state of the working directory and the index, but want to go back to a clean working directory. The command saves your local modifications away and reverts the working directory to match the HEAD commit.

== See also ==

* [[Git (software)]]

== External links ==

* [https://git-scm.com/docs/git-stash Git stash documentation ] @ git-scm.com

[[Category:Git (software)]]
[[Category:Revision control]]
[[Category:Software]]
[[Category:Web design and development]]

Shodan (website)

2017-05-11T19:15:28Z

Karl Jones: Created page with "'''Shodan''' is a search engine that lets the user find specific types of computers (web cams, routers, servers, etc.) connected to the internet using a..."

'''Shodan''' is a [[Web search engine|search engine]] that lets the user find specific types of computers (web cams, routers, servers, etc.) connected to the internet using a variety of filters. Some have also described it as a search engine of service banners, which are meta-data the server sends back to the client. This can be information about the server software, what options the service supports, a welcome message or anything else that the client can find out before interacting with the server.

Shodan collects data mostly on web servers (HTTP/HTTPS - port 80, 8080, 443, 8443), as well as FTP (port 21), SSH (port 22), Telnet (port 23), SNMP (port 161), SIP (port 5060),[2] and Real Time Streaming Protocol (RTSP, port 554). The latter can be used to access webcams and their video stream.

It was launched in 2009 by computer programmer John Matherly, who, in 2003,[4] conceived the idea of searching devices linked to the Internet.

The name ''Shodan'' is a reference to SHODAN, a character from the System Shock video game series.

== See also ==

* [[Web search engine]]

== External links ==

* [https://www.shodan.io/ Official website]]
* [https://en.wikipedia.org/wiki/Shodan_(website) Shodan (website)] @ Wikipedia

[[Category:Computing]]
[[Category:Internet]]

Advanced REST client

2017-04-19T14:59:57Z

Karl Jones: Created page with "'''Advanced REST client''' ('''ARC''') is an extension for Google Chrome which allows the user to create and test custom HTTP requests. == See also == * [[Google Chrome]..."

'''Advanced REST client''' ('''ARC''') is an extension for [[Google Chrome]] which allows the user to create and test custom HTTP requests.

== See also ==

* [[Google Chrome]]

== External links ==

* [https://chrome.google.com/webstore/detail/advanced-rest-client/hgmloofddffdnphfgcellkdfbfbjeloo?hl=en-US Advanced REST client] @ Google Chrome store

[[Category:Web design and development]]

Factorization

2017-04-05T13:58:23Z

Karl Jones: /* External links */

In mathematics, '''factorization''' (also '''factorisation''' in some forms of British English) or '''factoring''' is the decomposition of an object (for example, a number, a polynomial, or a matrix) into a product of other objects, or factors, which when multiplied together give the original.

For example, the number 15 factors into primes as 3 × 5, and the polynomial x2 − 4 factors as (x − 2)(x + 2).

In all cases, a product of simpler objects is obtained.

The aim of factoring is usually to reduce something to “basic building blocks”, such as numbers to prime numbers, or polynomials to irreducible polynomials. Factoring integers is covered by the fundamental theorem of arithmetic and factoring polynomials by the fundamental theorem of algebra. Viète's formulas relate the coefficients of a polynomial to its roots.

The opposite of polynomial factorization is expansion, the multiplying together of polynomial factors to an “expanded” polynomial, written as just a sum of terms.

Integer factorization for large integers appears to be a difficult problem. There is no known method to carry it out quickly. Its complexity is the basis of the assumed security of some public key cryptography algorithms, such as RSA.

A matrix can also be factorized into a product of matrices of special types, for an application in which that form is convenient. One major example of this uses an orthogonal or unitary matrix, and a triangular matrix. There are different types: QR decomposition, LQ, QL, RQ, RZ.

Another example is the factorization of a function as the composition of other functions having certain properties; for example, every function can be viewed as the composition of a surjective function with an injective function. This situation is generalized by factorization systems.

== See also ==

* [[Completing the square]] for polynomials
* [[Euler's factorization method]] for integers
* [[Fermat's factorization method]] for integers
* [[Integer factorization]]
* [[Monoid factorisation]]
* [[Multiplicative partition]]
* [[Partition (number theory)]] – a way of writing a number as a sum of positive integers
* [[Prime factor]]
* [[Program synthesis]]
* [[Table of Gaussian integer factorizations]]

== External links ==

* [https://en.wikipedia.org/wiki/Factorization Factorization] @ Wikipedia

[[Category:Mathematics]]

Partition (number theory)

2017-04-05T13:48:52Z

Karl Jones: Created page with "In number theory and combinatorics, a '''partition''' of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers. T..."

In [[number theory]] and [[combinatorics]], a '''partition''' of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.

For example, 4 can be partitioned in five distinct ways:

<nowiki>
4
3 + 1
2 + 2
2 + 1 + 1
1 + 1 + 1 + 1
</nowiki>

The order-dependent composition 1 + 3 is the same partition as 3 + 1, while the two distinct compositions 1 + 2 + 1 and 1 + 1 + 2 represent the same partition 2 + 1 + 1.

A summand in a partition is also called a part. The number of partitions of n is given by the partition function p(n). So p(4) = 5. The notation λ ⊢ n means that λ is a partition of n.

Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials, the symmetric group and in group representation theory in general.

== See also ==

* [[Rank of a partition]], a different notion of rank
* [[Crank of a partition]]
* [[Dominance order]]
* [[Factorization]]
* [[Integer factorization]]
* [[Partition of a set]]
* [[Stars and bars (combinatorics)]]
* [[Plane partition]]
* [[Polite number]], defined by partitions into consecutive integers
* [[Multiplicative partition]]
* [[Twelvefold way]]
* [[Ewens's sampling formula]]
* [[Faà di Bruno's formula]]
* [[Multipartition]]
* [[Newton's identities]]
* [[Leibniz's distribution table for integer partitions]]
* [[Smallest-parts function]]
* A Goldbach partition is the partition of an even number into primes (see [[Goldbach's conjecture]])
* [[Kostant's partition function]]

== External links ==

* [https://en.wikipedia.org/wiki/Partition_(number_theory) Partition (number theory)]

[[Category:Combinatorics]]
[[Category:Mathematics]]

Twelvefold way

2017-04-04T21:00:58Z

Karl Jones: Created page with "In combinatorics, the '''twelvefold way''' is a name given to a systematic classification of twelve related enumerative problems concerning two finite sets, which include..."

In [[combinatorics]], the '''twelvefold way''' is a name given to a systematic classification of twelve related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and partitions either of a set or of a number.

The idea of the classification is credited to Gian-Carlo Rota, and the name was suggested by Joel Spencer.

== See also ==

== External links ==

* [https://en.wikipedia.org/wiki/Twelvefold_way Twelvefold way] @ Wikipedia

[[Category:Combinatorics]]
[[Category:Mathematics]]

Combinatorial principles

2017-04-04T19:37:06Z

Karl Jones:

In proving results in [[combinatorics]] several useful combinatorial rules or combinatorial principles are commonly recognized and used.

The [[rule of sum]], [[rule of product]], and inclusion–exclusion principle are often used for [[Enumerative combinatorics|enumerative]] purposes.

Bijective proofs are utilized to demonstrate that two sets have the same number of elements.

The [[pigeonhole principle]] often ascertains the existence of something or is used to determine the minimum or maximum number of something in a discrete context.

Many combinatorial identities arise from double counting methods or the method of distinguished element.

Generating functions and recurrence relations are powerful tools that can be used to manipulate sequences, and can describe if not resolve many combinatorial situations.

== See also ==

* [[Combinatorics]]
* [[Enumerative combinatorics]]

== External links ==

* [https://en.wikipedia.org/wiki/Combinatorial_principles Combinatorial principles] @ Wikipedia

[[Category:Combinatorics]]
[[Category:Mathematics]]

Recurrence relation

2017-04-04T19:33:44Z

Karl Jones: Created page with "In mathematics, a '''recurrence relation''' is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: e..."

In mathematics, a '''recurrence relation''' is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms.

The term difference equation sometimes (and for the purposes of this article) refers to a specific type of recurrence relation. However, "difference equation" is frequently used to refer to any recurrence relation.

== See also ==

* [[Circle points segments proof]]
* [[Combinatorial principles]]
* [[Continued fraction]]
* [[Holonomic sequences]]
* [[Integrodifference equation]]
* [[Iterated function]]
* [[Lagged Fibonacci generator]]
* [[Master theorem]]
* [[Orthogonal polynomials]]
* [[Recursion]]
* [[Recursion (computer science)]]
* [[Time scale calculus]]

== External links ==

* [https://en.wikipedia.org/wiki/Recurrence_relation Recurrence relation] @ Wikipedia

[[Category:Mathematics]]

Mirek's Cellebration

2017-04-04T18:40:50Z

Karl Jones: Created page with "'''Mirek's Cellebration''' (abbreviated MCell) is a 32-bit Windows freeware program designed by Polish computer programmer Mirek Wójtowicz for running one-dimensional and two..."

'''Mirek's Cellebration''' (abbreviated MCell) is a 32-bit Windows freeware program designed by Polish computer programmer Mirek Wójtowicz for running one-dimensional and two-dimensional [[cellular automata]] (CA).

The program, currently in Version 4.20, supports more than 300 CA rules and over 1,000 pattern files in 14 different families including "Life," "Large than Life," "Vote for Life," "Weighted Life"," "1-D binary CA," "1-D totalistic CA" and “Generations."

A Java-based version, Mirek’s Java Cellebration, is an applet that plays more than 300 CA rules and more than 1,400 patterns.

== See also ==

* [[Cellular automaton]]

== External links ==

* [http://www.mirekw.com/ca/index.html Official website]
* [https://en.wikipedia.org/wiki/Mirek%27s_Cellebration Mirek's Cellebration] @ WIkipedia

[[Category:Mathematics]]
[[Category:Software]]

Movable cellular automaton

2017-04-04T15:58:33Z

Karl Jones: Created page with "The '''movable cellular automaton''' ('''MCA''') method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of classical ..."

The '''movable cellular automaton''' ('''MCA''') method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of classical [[cellular automaton]] and [[Discrete element method|discrete element]] methods.

Important advantage of the МСА method is a possibility of direct simulation of materials fracture including damage generation, crack propagation, fragmentation and mass mixing. It is difficult to simulate these processes by means of continuum mechanics methods (For example: finite element method, finite difference method, etc.), so some new concepts like peridynamics are required.

Discrete element method is very effective to simulate granular materials, but mutual forces among movable cellular automata provides simulating solids behavior.

If size of automaton will be close to zero then MCA behavior becomes like classical continuum mechanics methods.

== See also ==

* [[Cellular automaton]]
* [[Computer simulation]]
* [[Continuum mechanics]]
* [[Discrete element method]]
* [[Finite difference method]]
* [[Finite element method]]
* [[Fracture mechanics]]
* [[Peridynamics]]
* [[Solid mechanics]]

== External links ==

* [https://en.wikipedia.org/wiki/Movable_cellular_automaton Movable cellular automaton] @ Wikipedia

[[Category:Mathematics]]
[[Category:Physics]]

Finite element method

2017-04-04T15:39:59Z

Karl Jones: Created page with "The '''finite element method''' ('''FEM''') is a numerical method for solving problems of engineering and mathematical physics. It is also referred to as '''finite element ana..."

The '''finite element method''' ('''FEM''') is a numerical method for solving problems of engineering and mathematical physics. It is also referred to as '''finite element analysis''' ('''FEA''').

Typical problem areas of interest include structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential.

The analytical solution of these problems generally require the solution to boundary value problems for partial differential equations. The finite element method formulation of the problem results in a system of algebraic equations. The method yields approximate values of the unknowns at discrete number of points over the domain.

To solve the problem, it subdivides a large problem into smaller, simpler parts that are called finite elements. The simple equations that model these finite elements are then assembled into a larger system of equations that models the entire problem. FEM then uses variational methods from the calculus of variations to approximate a solution by minimizing an associated error function.

== See also ==

* [[Applied element method]]
* [[Boundary element method]]
* [[Computer experiment]]
* [[Direct stiffness method]]
* [[Discontinuity layout optimization]]
* [[Discrete element method]]
* [[Finite difference method]]
* [[Finite element machine]]
* [[Finite element method in structural mechanics]]
* [[Finite volume method]]
* [[Finite volume method for unsteady flow]]
* [[Interval finite element]]
* [[Isogeometric analysis]]
* [[Lattice Boltzmann methods]]
* [[List of finite element software packages]]
* [[Movable cellular automaton]]
* [[Multidisciplinary design optimization]]
* [[Multiphysics]]
* [[Patch test]]
* [[Rayleigh–Ritz method]]
* [[Space mapping]]
* [[Weakened weak form]]

== External links ==

* [https://en.wikipedia.org/wiki/Finite_element_method Finite element method] @ Wikipedia

[[Category:Mathematics]]
[[Category:Physics]]

Transport Layer Security

2017-04-02T19:07:24Z

Karl Jones:

'''Transport Layer Security''' ('''TLS''') and its predecessor, '''Secure Sockets Layer''' ('''SSL'''), both frequently referred to as "'''SSL'''", are cryptographic protocols that provide communications security over a computer network.

Several versions of the protocols find widespread use in applications such as web browsing, email, Internet faxing, instant messaging, and voice-over-IP (VoIP). Websites use TLS to secure all communications between their [[Web server|servers]] and [[web browsers]].

The Transport Layer Security protocol aims primarily to provide privacy and data integrity between two communicating computer applications. When secured by TLS, connections between a client (e.g., a web browser) and a server (e.g., wikipedia.org) have one or more of the following properties:

*The connection is private (or secure) because symmetric cryptography is used to encrypt the data transmitted. The keys for this symmetric encryption are generated uniquely for each connection and are based on a shared secret negotiated at the start of the session (see TLS handshake protocol). The server and client negotiate the details of which encryption algorithm and cryptographic keys to use before the first byte of data is transmitted (see Algorithm below). The negotiation of a shared secret is both secure (the negotiated secret is unavailable to eavesdroppers and cannot be obtained, even by an attacker who places themselves in the middle of the connection) and reliable (no attacker can modify the communications during the negotiation without being detected).
* The identity of the communicating parties can be authenticated using [[public-key cryptography]]. This authentication can be made optional, but is generally required for at least one of the parties (typically the server).
* The connection ensures integrity because each message transmitted includes a message integrity check using a message authentication code to prevent undetected loss or alteration of the data during transmission.

In addition to the properties above, careful configuration of TLS can provide additional privacy-related properties such as forward secrecy, ensuring that any future disclosure of encryption keys cannot be used to decrypt any TLS communications recorded in the past.

TLS supports many different methods for exchanging keys, encrypting data, and authenticating message integrity (see Algorithm below). As a result, secure configuration of TLS involves many configurable parameters, and not all choices provide all of the privacy-related properties described in the list above (see authentication and key exchange table, cipher security table, and data integrity table).

Attempts have been made to subvert aspects of the communications security that TLS seeks to provide and the protocol has been revised several times to address these security threats (see Security). Developers of [[web browsers]] have also revised their products to defend against potential security weaknesses after these were discovered (see TLS/SSL support history of web browsers.)

The TLS protocol comprises two layers: the TLS record protocol and the TLS handshake protocol.

TLS is a proposed Internet Engineering Task Force (IETF) standard, first defined in 1999 and updated in RFC 5246 (August 2008) and RFC 6176 (March 2011). It builds on the earlier SSL specifications (1994, 1995, 1996) developed by Netscape Communications for adding the HTTPS protocol to their Navigator web browser.

== See also ==

* [[Computer security]]
* [[Cryptography]]
* [[Internet security]]

== External links ==

* [https://en.wikipedia.org/wiki/Transport_Layer_Security Transport Layer Security] @ Wikipedia

[[Category:Computer security]]