text:
'use strict';

import LawnchairDAO from '../../../src/js/service/lawnchair';

var dbName = 'lawnchair@test.com';

var key = 'type_1';
var data = {
    name: 'testName1',
    type: 'testType1'
};

var key2 = 'type_2';
var data2 = {
    name: 'testName2',
    type: 'testType2'
};

describe('Lawnchair DAO unit tests', function() {
    var lawnchairDao;

    beforeEach(function(done) {
        lawnchairDao = new LawnchairDAO();
        lawnchairDao.init(dbName).then(function() {
            expect(lawnchairDao._db).to.exist;
            done();
        });
    });

    afterEach(function(done) {
        lawnchairDao.clear().then(done);
    });

    describe('init', function() {
        it('should fail', function(done) {
            lawnchairDao.init(undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });
    });

    describe('list', function() {
        it('should fail', function(done) {
            lawnchairDao.list(undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });
    });

    describe('remove list', function() {
        it('should fail', function(done) {
            lawnchairDao.removeList(undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });
    });

    describe('persist/read/remove', function() {
        it('should fail when reading with no key', function(done) {
            lawnchairDao.read(undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });

        it('should fail when persisting with no key', function(done) {
            lawnchairDao.persist(undefined, data).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });

        it('should fail when persisting with no key', function(done) {
            lawnchairDao.persist(key, undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });

        it('should fail when persisting with no input', function(done) {
            lawnchairDao.persist(undefined, undefined).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });

        it('should work', function(done) {
            lawnchairDao.persist(key, data).then(function() {
                return lawnchairDao.read(key);
            }).then(function(fetched) {
                expect(fetched).to.deep.equal(data);
                return lawnchairDao.remove(key);
            }).then(function() {
                return lawnchairDao.read(key);
            }).then(function(fetched) {
                expect(fetched).to.not.exist;
                done();
            });
        });
    });

    describe('batch/list/removeList', function() {
        it('should fail', function(done) {
            lawnchairDao.batch({}).catch(function(err) {
                expect(err).to.exist;
                done();
            });
        });

        it('should filter only first type', function(done) {
            var list = [{
                key: key,
                object: data
            }, {
                key: key2,
                object: data2
            }];

            lawnchairDao.batch(list).then(function() {
                return lawnchairDao.list(key);
            }).then(function(fetched) {
                expect(fetched.length).to.equal(1);
                expect(fetched[0]).to.deep.equal(list[0].object);
                return lawnchairDao.removeList(key);
            }).then(function() {
                return lawnchairDao.list('type');
            }).then(function(fetched) {
                expect(fetched.length).to.equal(1);
                expect(fetched[0]).to.deep.equal(list[1].object);
                done();
            });
        });

        it('should filter only second type', function(done) {
            var list = [{
                key: key,
                object: data
            }, {
                key: key2,
                object: data2
            }];

            lawnchairDao.batch(list).then(function() {
                return lawnchairDao.list(key2);
            }).then(function(fetched) {
                expect(fetched.length).to.equal(1);
                expect(fetched[0]).to.deep.equal(list[1].object);
                return lawnchairDao.removeList(key2);
            }).then(function() {
                return lawnchairDao.list('type');
            }).then(function(fetched) {
                expect(fetched.length).to.equal(1);
                expect(fetched[0]).to.deep.equal(list[0].object);
                done();
            });
        });

        it('should filter all', function(done) {
            var list = [{
                key: key,
                object: data
            }, {
                key: key2,
                object: data2
            }];

            lawnchairDao.batch(list).then(function() {
                return lawnchairDao.list('type');
            }).then(function(fetched) {
                expect(fetched.length).to.equal(2);
                expect(fetched[0]).to.deep.equal(list[0].object);
                expect(fetched[1]).to.deep.equal(list[1].object);
                return lawnchairDao.removeList('type');
            }).then(function() {
                return lawnchairDao.list('type');
            }).then(function(fetched) {
                expect(fetched).to.exist;
                expect(fetched.length).to.equal(0);
                done();
            });
        });

        it('should filter none', function(done) {
            var list = [{
                key: key,
                object: data
            }, {
                key: key2,
                object: data2
            }];

            lawnchairDao.batch(list).then(function() {
                return lawnchairDao.list('type_3');
            }).then(function(fetched) {
                expect(fetched.length).to.equal(0);
                return lawnchairDao.removeList('type_3');
            }).then(function() {
                return lawnchairDao.list('type');
            }).then(function(fetched) {
                expect(fetched.length).to.equal(2);
                expect(fetched[0]).to.deep.equal(list[0].object);
                expect(fetched[1]).to.deep.equal(list[1].object);
                done();
            });
        });
    });

});

redpajama_set_name: RedPajamaGithub


text:
package com.ajah.swagger.out;

import java.util.Map;

import com.fasterxml.jackson.annotation.JsonInclude;
import com.fasterxml.jackson.annotation.JsonInclude.Include;

/**
 * Simplified version of a SwaggerApi for easier serialization/deserialization.
 *
 * @author Eric F. Savage, code@efsavage.com.
 */
@JsonInclude(Include.NON_NULL)
public class SwaggerOut {

	public String swagger = "2.0";
	public SwaggerInfoOut info;
	public String host;
	public String[] schemes;
	public String basePath;
	public String[] produces;
	public Map<String, SwaggerPathOut> paths;
	public Map<String, SwaggerDefinitionOut> definitions;

}


text:
angular.module("angular-location-picker", []).directive("googleMapLocator", function ($window) {
  return {
    restrict: "E",
    replace: true,
    template: "

",
    scope: {
      location: "@",
      radius: "@",
      options: "@",
      onLocationInitialize: "&",
      onLocationChange: "&",
      onMapLoaded: "&"
    },
    link: function (scope, element, attrs) {
      var callbackName = 'InitMapCb';
      // callback when google maps is loaded
      $window[callbackName] = function () {
        initPicker();
      };

      if (!$window.google || !$window.google.maps) {
        loadGMaps();
      } else {
        initPicker();
      }

      function loadGMaps() {
        var script = $window.document.createElement('script');
        script.type = 'text/javascript';
        script.src = 'http://maps.googleapis.com/maps/api/js?v=3.exp&callback=InitMapCb';
        $window.document.body.appendChild(script);
      }

      function onChanged(location) {
        scope.onLocationChange({
          location: location
        });
      }

      function onInitialized(location) {
        scope.onLocationInitialize({
          location: location
        });
      }

      function onMapLoaded(map) {
        scope.onMapLoaded({
          map: map
        });
      }

      function initPicker() {
        if (!scope.location) {
          initPicker
          getLocation();
        } else {
          scope.location = JSON.parse(scope.location);
          initLocationPicker();
        }
      }

      function getLocation() {
        if (navigator.geolocation) {
          navigator.geolocation.getCurrentPosition(showPosition);
        } else {
          console.log("====Geolocation is not supported by this browser====");
          // TODO: find a way to get lat, long of the user
          showPosition({
            coords: {
              latitude: 12.8139068,
              longitude: 77.65166829999998
            }
          });
        }
      }

      function showPosition(position) {
        scope.location = {
          latitude: position.coords.latitude,
          longitude: position.coords.longitude
        };
        initLocationPicker();
      }

      function initLocationPicker() {
        if (!scope.options) {
          scope.options = {
            autocomplete: true,
            inputName: false
          };
        } else {
          scope.options = JSON.parse(scope.options);
        }

        $(element).locationpicker({
          location: scope.location,
          radius: scope.radius,
          onchanged: function (currentLocation, radius, isMarkerDropped) {
            var location = $(this).locationpicker('map').location;
            onChanged(location);
          },
          inputBinding: {
            locationNameInput: $(scope.options['inputName'])
          },
          enableAutocomplete: scope.options['autocomplete'],
          oninitialized: function (component) {
            var location = $(component).locationpicker('map').location;
            onInitialized(location);
            var mapContext = $(element).locationpicker('map');
            onMapLoaded(mapContext.map);
          }
        });
      }

    }
  }
})


text:
Marugame Udon Franchise UK
Marugame Udon...the Japanese way to healthy profits
Sector: Quick Service Asian Restaurants
Established: 2001, Kobe, Japan
Number of units: 1,000+ worldwide
Sales: US$806 million (excluding franchising)
Average size: 500 – 2,500 sq ft
Parent company: Toridoll Holdings Corporation
Development type: Multi-unit or area development
With 1,000+ units worldwide, Marugame Udon is the market leader in the udon space. Through our quick-service casual restaurants we serve quality udon made on site from scratch alongside freshly made tempura for a great value meal.
Marugame is owned by Toridoll Holdings Corporation of Japan; one of the fastest growing restaurant companies worldwide. Toridoll is the global leader in Japanese food, operating 1,635 restaurants across Japan, South-East Asia, Australia, the U.S. and Europe. In Europe the company owns successful brands such as Wok To Walk and Shoryu Ramen. Total group turnover in 2018 exceeded $1.05 Billion.
The Marugame Udon concept
Our concept is unique, authentic and entertaining.
We are the only udon or ramen brand making noodles on site, achieving an unbeatable taste thanks to our specific proprietary ingredients and preparation methods.
We follow authentic recipes, offering a meal solution that is extremely popular in both Eastern and Western countries
We make all our food from an open kitchen, providing theatre and transparency
Our seamless process achieves speed: we can serve up to 256 guests per hour
We provide tremendous value for money within the quick-casual segment.
By fitting such a variety of consumer trends, Marugame Udon offers a restaurant experience that is very relevant to consumers in the UK and throughout Europe.
In addition, the multiple store formats we operate allow us to seize a wide variety of location opportunities, from food courts to stand alone units.
Ideal partners' profile/support
As part of its expansion strategy, Marugame Udon is looking for motivated partners who have the experience and resources to build the Marugame Udon business in their local territories in accordance with an agreed development schedule.
To become a franchisee, you would need to have proven experience in running multi-site restaurant or retail operations.
The investment in a Marugame Udon restaurant in the UK will range from £250,000 to £650,000 depending on format and size. Returns are estimated on a site by site basis but they are usually very healthy thanks to product appeal and operational efficiency.
With the objective to expand in the UK and then in Europe, Marugame Udon has set up a local team to support its franchisees in key areas such as operations, real estate and finance. This structure, staffed with operators having nearly 100 years of experience in the UK restaurant industry, has localized our supply chain and our interior design to create a perfect fit with the consumer.
Such experienced resources are there to support any Marugame Udon franchisees in the UK.
Franchisee testimonials
"Marugame Udon & Tempura has brought a great significance to the Philippines. With its authenticity, it has brought joy and a unique experience to the locals.
We are very honored to represent Marugame in the Philippines, happy to become part of Marugame's growth worldwide and very proud to spread the idea of serving everything fresh and at a very affordable price. Marugame Udon which is value for money and delicious at its own might."
Suyen Corporation, Master Franchisee, Philippines
"We are so happy and proud to participate in the expansion of Marugame Udon, which has established an overwhelming presence in Japan and now here in our market.
We believe Marugame Udon's concept of serving the freshest food cooked in an open kitchen is the most powerful format that can be successful anywhere in the world.
Thanks to this, we have been able to reach an unprecedented market share in this country. We are so grateful to be a member of the Marugame family and together making great progress!"
Sriboga Food Group, Master Franchisee, Indonesia
Do you have a passion for Asian food and do you see their business potential?
Do you have a commitment to develop Marugame Udon in your market(s)?
Does your organisation have the infrastructure and operational know-how to get the most out of this business?
Do you have the resources and systems in place to ensure that the Marugame Udon system is consistently operated in your business?
If yes, then please contact us with your interest by completing the form below.
Further information request to Marugame Udon Franchise
*Tel No:
*Territory interest:
*Liquid capital:
Relevant experience:

redpajama_set_name: RedPajamaCommonCrawl


Romeo: Eric Gramatges, William Davenport, Juliette: Jennifer Edwards, Chun-Ting Chao, Frere Laurent: Kwang Kyu Lee, Count Capulet: Jye-Sung Moon, Tybald: Ted Kerrick, Stephano: Abigail Fischer, Emily Righter, Mercutio: Andrew Sauvageau, Gertrude: Anamer Castrello, Paris: Jason Buckwalter, Benvolio: Darnell Roulhac, The Duke: Benjamin LaPrarie.
Lieschen: Ashley Alden; Schlendrian: Charlie Hyland; Narrator: Ben Lurye.
Sheppherds, dancers: Kasey Wilson, Ashley Alden, Corinne Baker, Rebecca Lynn, Sandy Gust, Brian Hill, Rameen Chaharbaghi, Zain Shariff.
Katerina Souvorova leaves her mark on D.C. music scene.
Bel Cantanti Opera and New Dominion Chorale, under the leadership of its founder and artistic director, Thomas Beveridge presented an outstanding concert of arias, scenes and opera choruses on Sunday, October 24 at Rachel M. Schlesinger Concert Hall and Arts Center of the Alexandria campus of Northern Virginia Community College.
The concert, Great Opera Moments, featured soloists who perform with the Metropolitan Opera Company, including Shannon Roberts, soprano; Kevin Courtemanche, tenor; and Mikhail Svetlov, bass. Katerina Souvorova, artistic director of Bel Cantanti, provided the piano accompaniment to the program.
Gianni Schicchi: Daniel Quintana; Rinuccio: Nathan Carlisle; Zita: Myeongsook Park; Simone: Jerett Gieseler; Betto: Andrew Adelsberger; Lauretta: Courtney Ross; Nella: Ashley Alden; Marco: Thomas Gunther; La Ciesca: Katelyn Jackman; Gherardo: Eric Gramatges; Maestro Spineloccio, Notary: Jim Krabbendam, Rameen Chaharbaghi; Pinellino: Chris Bowen; Guccio: Zain Shariff; Gherardino: Stephen Shaffran.
Canio: Kevin Courtemanche; Nedda: Maryann Mootos; Tonio: Jerett Gieseler; Silvio: Thomas Gunther; Peppe: Nathan Carlisle.


text:
Language Resource Group
Duo Lingo
LingQ
Live Mocha
Omniglot
culture, Government Education, history
China Online Interactive Resource from Reuters
August 15, 2014 resourcesforlife	Leave a comment
Learn more about China with this online interactive resource from Reuters http://china.fathom.info.
ChinaChineseCultureHistory
culture, literature
Carl Djerassi, chemist who developed the pill, to speak at UI symposium March 8
March 3, 2014 resourcesforlife	Leave a comment
(Article Source: Iowa Now)
Author and chemist Carl Djerassi will give a keynote address at the symposium "Pill and Pen: Contraception and Unwanted Pregnancy in Literature and Popular Culture." The symposium will be held Friday, March 7 through Sunday, March 9 in various locations across the University of Iowa campus.
There is no registration requirement. All presentations, lectures, and screenings are free and open to the public. Students and scholars are encouraged to attend.
Djerassi will speak on "The Rise and Demise of the Pill" Saturday, March 8 from 5 to 6:30 p.m. in the Old Capitol Senate Chamber. A full schedule of events and list of speakers can be found on the symposium website.
At the impressive age of 90, Djerassi, who has received more than 30 honorary doctorates from universities around the world, is a highly entertaining and provocative speaker. His combined expertise as a scientist and writer will introduce the symposium with what organizers say will be "an unusual and highly sophisticated keynote."
Djerassi is an Austrian-born scientist who fled his country after the invasion of Hitler-Germany and eventually found a new home in the United States. One of the most prolific scientists of the 20th century, he has authored more than 1,000 research papers, five novels, eight plays, a book of poetry, volume of short stories, and a docudrama.
The chemist and author is currently a professor emeritus at Stanford University where he has been teaching since 1960. Djerassi likes to refer to himself as the "mother" of the birth-control pill for his role in creating a man-made form of progesterone, a naturally occurring hormone in females.
The Pill and Pen symposium is sponsored by the Division of World Languages, Literatures, and Cultures, and the departments of Chemistry; Cinema and Comparative Literature; and Gender, Women and Sexuality Studies in the College of Liberal Arts and Sciences.
Other sponsors include the Global Health Studies Program and the Center for Asian and Pacific Studies in International Programs, and the department of Pharmacology in the Carver College of Medicine. The event is also made possible by the Obermann Center for Advanced Studies, the Honors Program and the Center for Human Rights in the UI College of Law.
Individuals with disabilities are encouraged to attend all UI-sponsored events. If you are a person with a disability who requires a reasonable accommodation in order to participate in this program, contact Waltraud Maierhofer in advance at waltraud-maierhofer@uiowa.edu or at 866-465-1607.
Cultureliterature
University of Iowa International Programs 2013 Annual Report
January 27, 2014 resourcesforlife	Leave a comment
The University of Iowa International Programs 2013 Annual Report is now available as a beautiful online magazine with beautiful photography, stunning visual data presentations, and inspiring stories of how IP is having a positive impact on people's lives and the world.
CultureInternational ProgramsTravelUIOWA
Real-Time Language Translation with Google Translate App and Smartphone Camera
MotionSavvy UNI Portable Sign Language Interpreter System
Rosetta Stone Language Learning Software
The Conditioned: Inspiring Video About Raimundo Arruda Sobrinho in São Paulo, Brazil
Accredited Language Services
American Language Services
CTS Language Link
H-I Translating & Interpreting
International Translation Services
Interpreters Unlimited
Iowa International Center
Iowa Interpreters and Translators Association
LanguageTech
Monterey Language Services
News in Slow
Learning Materials, Translators, Interpreters, Tutors, and Instructors of Foreign Languages
Real-Time Language Translation with Google Translate App and Smartphone Camera January 15, 2015
MotionSavvy UNI Portable Sign Language Interpreter System October 30, 2014
Rosetta Stone Language Learning Software August 22, 2014
China Online Interactive Resource from Reuters August 15, 2014


text:
package de.iritgo.aktera.base.tools.jvmmemory;

import de.iritgo.aktera.model.Command;
import de.iritgo.aktera.ui.AbstractUIController;
import de.iritgo.aktera.ui.UIControllerException;
import de.iritgo.aktera.ui.UIRequest;
import de.iritgo.aktera.ui.UIResponse;

/**
 * This controller displays the current memory consumption of the JVM.
 */
public class ShowJvmMemory extends AbstractUIController
{
	/**
	 * @see de.iritgo.aktera.ui.UIController#execute(de.iritgo.aktera.ui.UIRequest, de.iritgo.aktera.ui.UIResponse)
	 */
	public void execute(UIRequest request, UIResponse response) throws UIControllerException
	{
		if (request.getParameter("gc") != null)
		{
			System.gc();
		}

		Command cmd = response.addCommand("cmd5Minutes", "de.iritgo.aktera.base.ShowJvmMemoryHistory");

		cmd.setParameter("startTime", "5");

		cmd = response.addCommand("cmd30Minutes", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "30");

		cmd = response.addCommand("cmd60Minutes", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "60");

		cmd = response.addCommand("cmd120Minutes", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "120");

		cmd = response.addCommand("cmdDay", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "1440");

		cmd = response.addCommand("cmdWeek", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "10080");

		cmd = response.addCommand("cmdMonth", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("startTime", "302400");

		cmd = response.addCommand("cmdYear", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("cmdYear", "3628800");

		cmd = response.addCommand("cmdGC", "de.iritgo.aktera.base.ShowJvmMemoryHistory");
		cmd.setParameter("gc", "Y");
	}
}


The peninsula separating Upper and Lower Prior Lake, with a small channel connecting the lakes, is not naturally occurring. The peninsula was built to accommodate a railroad built by Charles Prior, who the city and lake is named after. After the railroad was removed, the channel permitted only one way traffic between pilings about 11 feet apart, although there was shallow water between the adjacent pines. In 1973, The Prior Lake Association members passed a motion to spend $6,000 to have the channel dredged. Two pontoon bridge barges were purchased from Denver, Colorado at a cost of $895 each and they were delivered in October 1973 at an additional charge of $350, for a total of $2,140.


text:
\section{Introduction}
\label{sec:intro}

Speech-controlled user interfaces such as Amazon's \emph{Alexa}, Apple's \emph{Siri} or \emph{Cortana} by Microsoft substantially facilitate the operation of devices and household functions to laymen. Instead of using keyboard and display as input-output interfaces, the operator pronounces requests or instructions to the device and listens to its responses.

State-of-the-art language technology scans the acoustically analyzed speech signal for relevant keywords that are subsequently inserted into semantic frames \cite{Minsky74} to interpret the user's intent. This \emph{slot filling} procedure \cite{Allen03, TurHakkaniEA11, MesnilDauphinEA15} is based on large language corpora that are evaluated by standard machine learning methods, such as conditional random fields \cite{TurHakkaniEA11} or by deep learning of neural networks \cite{MesnilDauphinEA15}, for instance. The necessity to overcome traditional slot filling techniques by proper cognitive information and communication technologies has already been emphasized by Allan \cite{Allen17}. His research group trains semantic parsers from large language data bases such as WordNet or VerbNet that are constrained by hand-crafted expert knowledge and semantic ontologies \cite{Allen03, Allen14, AllenBahkshandehEA18}.

One particular demand on cognitive user interfaces are the processing and understanding of numerals, e.g. in instructions like ``\texttt{increase the heating to 22.5 degrees}'', where the device may probably respond with a sensor registration: ``\texttt{the current room temperature is 18.3 degrees}'' \cite{TschopeDuckhornEA18}. Numerals are an important research domain in cognitive linguistics and language technology \cite{FlachHolzapfelEA00, WolffEichnerHoffmann01, Hurford01, IoninMatushansky06, Mendia18, GrabenMeyerEA19}. They exhibit typological differences among languages but share a simple arithmetic semantics. Decent examples are different morphologies in German ($\TT{zweiundvierzig} = 2 + 40$) or English ($\TT{fourtytwo} = 40;2$), and also different base systems in German ($\TT{achtzig} = 8 \times 10$) or French ($\TT{quatre\text{-}vingts} = 4 \times 20$) \cite{Hurford01}. Linguistically, numerals are regarded as modifiers \cite{IoninMatushansky06} with a particular syntactic morphology that should be described by a suitable grammar formalism. This grammar must store numeral morphemes together with their arithmetic semantics in a data base, called the \emph{mental lexicon}. It should be complex enough to account for the wealth of linguistic typology and constrained enough to exclude ungrammatical compositions such as $\TT{zweizig}$ in German or $\TT{twoty}$ in English \cite{Hurford01}.

Recent research in computational linguistics has demonstrated that quite different grammar formalisms, such as categorial grammar \cite{AmblardLecomteRetore10}, tree-adjoining grammar \cite{JoshiLevyTakahashi75}, multiple context free grammar (MCFG) \cite{SekiEA91}, range concatenation grammar \cite{Boullier05}, and minimalist grammar \cite{Stabler97, StablerKeenan03} converge toward universal description models \cite{Michaelis01a, Stabler11a}. Minimalist grammar has been developed by Stabler \cite{Stabler97} to mathematically codify Chomsky's \emph{Minimalist Program} \cite{Chomsky95} in the generative grammar framework. A minimalist grammar (MG) consists of a mental lexicon storing linguistic signs as arrays of syntactic, phonetic and semantic features, on the one hand, and of two structure-building functions, called ``merge'' and ``move'', on the other hand. Syntactic features in the lexicon are, e.g., the linguistic base categories noun ($\TT{n}$), verb  ($\TT{v}$), adjective ($\TT{a}$), or, in the present context, numeral ($\TT{num}$). These are syntactic heads selecting other categories either as complements or as adjuncts. The structure generation is controlled by selector categories that are ``merged'' together with their selected counterparts. Moreover, one distinguishes between licensors and licensees, triggering the movement of maximal projections. An MG does not comprise any phrase structure rules; all syntactic information is encoded in the feature array of the mental lexicon. Furthermore, syntax and compositional semantics can be combined via the lambda calculus \cite{Niyogi01, Kobele09}, while MG parsing can be implemented by compilation into an equivalent MCFG \cite{Stabler11b}.

One important property of MG is their effective learnability in the sense of Gold's formal learning theory \cite{Gold67}. Specifically, MG can be acquired by positive examples \cite{KobeleCollierEA02, StablerEA03} from linguistic dependence graphs \cite{BostonHaleKuhlmann10, KleinManning04}, which is consistent with psycholinguistic findings on early-child language acquisition \cite{Ellis06, Pinker95, Tomasello06}. However, learning through positive examples only, could easily lead to overgeneralization. According to Pinker \cite{Pinker95} this could effectively be avoided through reinforcement learning \cite{Skinner15, SuttonBarto18}. Although there is only little psycholinguistic evidence for reinforcement learning in human language acquisition \cite{Moerk83, SundbergEA96}, we outline a machine learning algorithm for the acquisition of an MG mental lexicon of numeral morphology and semantics through reinforcement learning in this contribution.

\section{Numeral Grammar}
\label{sec:ng}

Our language acquisition approach for numeral grammar combines methods from computational linguistics, formal logic, and abstract algebra. Starting point of our algorithm are \emph{utterance meaning pairs} (UMP)
\begin{equation}\label{eq:ump}
    u = \langle e, \sigma \rangle \:,
\end{equation}
where $e \in E$ is the spoken or written utterance, given as the \emph{exponent} of a linguistic sign \cite{Kracht03}. Technically, exponents are strings taken from the Kleene hull of some finite alphabet, $A$, i.e. $E = A^*$. The sign's \emph{semantics} $\sigma \in \Sigma$ is a logical term, usually expressed by means of lambda calculus.

\subsection{Numeral Semantics}
\label{sec:nsem}

The straightforward meaning of a numeral, say $\TT{fourtytwo}$, is  a number concept, such as $42$. However, from a computational point of view, the UMP $\langle \TT{fourtytwo}, 42 \rangle$ simply relates a symbolic string $\TT{fourtytwo}$ to another symbolic string $42$, without making the exponent and the semantics of the sign operationally accessible. This is achieved by interpreting digit strings in a $g$-adic number system. In the decimal system with $g = 10$, we have
\begin{equation}\label{eq:42}
  42 = 4 \times 10 + 2 \times 1 = \sum_{k = 1}^n a_k g^{k-1}
\end{equation}
with $n$ coefficients $0 \le a_k \le g - 1$ ($n$ the number of digits).

Equation \pref{eq:42} can directly be written as a tree-like arithmetic term structure
\begin{figure}[H]
\Tree [.$+$
        [.$\times$
                $10^1$ $4$
            ]
            [.$\times$
                   $10^0$ $2$
            ]
]
\caption{\label{fig:mwr42} Arithmetic term tree for $42$.}
\end{figure}

Using the binary operators $+(x, y) = x + y$ and $\times(x, y) = x \times y$, and writing them in the unary Sch\"onfinkel representation
\begin{eqnarray*}
  +(x, y) &=& +(y)(x) = x + y \\
  \times(x, y) &=& \times(y)(x) = x \times y
\end{eqnarray*}
where $+(y)$ is regarded as a function $f: x \mapsto (+(y))(x) = x + y =f(x)$, and $\times(y)$ as another function $g: x \mapsto (\times(y))(x) = x \times y = g(x)$, respectively, we obtain an expression of the arithmetic term algebra \cite{Kracht03} in Polish notation
\[
  \sigma = +( \times(10^1)(4) )( \times(10^0)(2) )
\]
that will be interpreted as the \emph{meaning} of the numeral $\TT{fourtytwo}$ in the sequel \cite{Mendia18, GrabenMeyerEA19}. Hence, the correct UMP for $42$ is
\begin{equation}\label{eq:term42}
    u = \langle \TT{fourtytwo}, +( \times(10^1)(4) )( \times(10^0)(2) ) \rangle \:.
\end{equation}

\subsection{Minimalist Grammar}
\label{sec:mg}

Following Kracht \cite{Kracht03}, we regard a linguistic sign as an ordered triple
\begin{equation}\label{eq:sign}
    z = \langle e , t , \sigma \rangle
\end{equation}
with the same exponent $e \in E$ and semantics $\sigma \in \Sigma$ as in the UMP \pref{eq:ump}. In addition, $t \in T$ is a syntactic \emph{type} that we encode by means of minimalist grammar (MG) in its chain representation \cite{StablerKeenan03}. The type controls the generation of syntactic structure and hence the order of lambda application, analogously to the typed lambda calculus in Montague semantics.

An MG consists of a data base, the mental lexicon, containing signs as arrays of syntactic, phonetic and semantic \emph{features}, and of two structure-generating functions, called ``merge'' and ``move''. Syntactic features are the \emph{basic types} $b \in B$ from a finite set $B$, with $b = \TT{n}, \TT{v}, \TT{a}, \TT{num}$, etc, together with a set of their respective \emph{selectors} $S = \{ \TT{=}b | b \in B \}$ that are unified by the ``merge'' operation. Moreover, one distinguishes between a set of licensers $L_+ = \{ \TT{+}l | l \in L \}$ and another set of their corresponding licensees $L_- = \{ \TT{-}l | l \in L \}$ triggering the ``move'' operation. $L$ is another finite set of movement identifiers. $F = B \cup S \cup L_+ \cup L_-$ is called the feature set. Finally, one has a two-element set $C = \{ \TT{:\!:}, \TT{:} \}$ of categories, where ``$\TT{:\!:}$'' indicates \emph{simple}, \emph{lexical} categories while ``$\TT{:}$'' denotes \emph{complex}, \emph{derived} categories. The ordering of syntactic features is prescribed as regular expressions, i.e. $T = C (S \cup L_+)^* B L_-^*$ is the set of syntactic types \cite{Stabler97, StablerKeenan03}. The set of linguistic signs is then given as $Z = E \times T \times \Sigma$ \cite{Kracht03}.

Let $e_1, e_2 \in E$ be exponents, $\sigma_1, \sigma_2 \in \Sigma$ semantic terms in the lambda calculus, $f \in B \cup L$ one feature identifier, $\seq{t}, \seq{t}_1, \seq{t}_2 \in F^*$ feature strings compatible with the regular types in $T$, $\cdot \in C$ and $\seq{z}, \seq{z}_1, \seq{z}_2 \in Z^*$ sequences of signs, then $\langle e_1 , \TT{:\!:} \TT{=}f \seq{t}_1, \sigma_1 \rangle$ and $\langle e_2 , \TT{:} f , \sigma_2 \rangle$ form signs in the sense of \pref{eq:sign}. A sequence of signs is called a \emph{minimalist expression}, and the first sign of an expression is called its \emph{head}, controlling the structure building through ``merge'' and ``move'' as follows.

The MG function ``merge'' is defined through inference schemata
\begin{eqnarray}
&&\dfrac{
    \langle e_1, \TT{:\!:=}f \seq{t}, \sigma_1 \rangle \quad
    \langle e_2, \cdot f, \sigma_2 \rangle \seq{z}
  }{
    \langle e_1e_2, \TT{:} \seq{t}, \sigma_1\sigma_2 \rangle \seq{z}
  }
  \,\text{merge-1} \:, \label{merge-1} \\
&&\dfrac{
    \langle e_1, \TT{:=}f \seq{t}, \sigma_1 \rangle \seq{z}_1 \quad
    \langle e_2, \cdot f, \sigma_2 \rangle \seq{z}_2
  }{
    \langle e_2e_1, \TT{:} \seq{t}, \sigma_1 \sigma_2 \rangle \seq{z}_1 \seq{z}_2
  }
  \,\text{merge-2} \:, \label{merge-2} \\
&&\dfrac{
    \langle e_1,\cdot \TT{=}f \seq{t}_1, \sigma_1 \rangle \seq{z}_1 \quad
    \langle e_2, \cdot f \seq{t}_2, \sigma_2 \rangle \seq{z}_2
  }{
    \langle e_1, \TT{:} \seq{t}_1, \sigma_1 \rangle \seq{z}_1
    \langle e_2, \TT{:} \seq{t}_2, \sigma_2 \rangle \seq{z}_2
  }
  \,\text{merge-3} \:, \label{merge-3}
\end{eqnarray}
Correspondingly, ``move'' is given through
\begin{eqnarray}
&&\dfrac{
    \langle e_1, \TT{:+}f \seq{t}, \sigma_1 \rangle \seq{z}_1
    \langle e_2, \TT{:-}f, \sigma_2 \rangle \seq{z}_2
  }{
    \langle e_2e_1, \TT{:} \seq{t}, \sigma_1\sigma_2 \rangle \seq{z}_1 \seq{z}_2
  }
  \,\text{move-1} \:, \label{move-1} \\
&&\dfrac{
    \langle e_1, \TT{:+}f \seq{t}_1, \sigma_1 \rangle \seq{z}_1
    \langle e_2, \TT{:-}f \seq{t}_2, \sigma_2 \rangle \seq{z}_2
  }{
    \langle e_1, \TT{:} \seq{t}_1, \sigma_1 \rangle \seq{z}_1
    \langle e_2, \TT{:} \seq{t}_2, \sigma_2 \rangle \seq{z}_2
  }
  \,\text{move-2} \:. \label{move-2}
\end{eqnarray}
where only one sign with licensee $\TT{-}f$ may appear in the expression licensed by $\TT{+}f$ in the head. This so-called \emph{shortest movement constraint} (SMC) guarantees syntactic locality demands \cite{Stabler97, StablerKeenan03}.

A minimalist derivation terminates when all syntactic features besides only one distinguished \emph{start symbol}, in our case $\TT{num}$, have been consumed. The meaning of rules (\ref{merge-1} -- \ref{move-2}) and their applicability becomes clear in the next section.

\section{Reinforcement Learning}
\label{sec:ml}

The language learner is a cognitive agent $L$ in a state $X_t$, to be identified with $L$'s mental lexicon at training time $t$. At time $t = 0$, $L$ is initialized as a \emph{tabula rasa} with empty lexicon
\begin{equation}\label{eq:lexini}
    X_0 \gets \emptyset
\end{equation}
and exposed to UMPs produced by a continuously counting teacher $T$. The first UMPs given by $T$ are $u_1 = \langle \TT{one}, 1 \rangle$, $u_2 = \langle \TT{two}, 2 \rangle$, $u_3 = \langle \TT{three}, 3 \rangle$, and so forth. Note that we assume $T$ presenting already complete UMPs and not singular utterances to $L$. Thus we avoid the \emph{symbol grounding problem} of firstly assigning meanings $\sigma$ to uttered exponents $e$ \cite{Harnad90}, which will be addressed in future research. Moreover, we assume that $L$ is instructed to reproduce $T$'s counting based on its own numeric understanding. This provides a feedback loop and therefore applicability of reinforcement learning \cite{Skinner15, SuttonBarto18}.

As long as $L$ is not able to detect patterns or common similarities in $T$'s UMPs, it simply adds new entries directly to its mental lexicon, assuming that all numerals have base type $\TT{num}$. Hence, $L$'s state $X_t$ evolves according to the update rule
\begin{equation}\label{eq:dyn1}
    X_t \gets X_{t - 1} \cup \{ \langle e_t, \TT{:\!: num}, \sigma_t \rangle \} \:,
\end{equation}
when $u_t = \langle e_t, \sigma_t \rangle$ is the UMP presented at time $t$ by $T$.

In this way, the mental lexicon $X_{12}$ of simplex numerals in \Tab{tab:mg1} has been acquired at time $t = 12$.

\begin{table}[H]
\caption{\label{tab:mg1} Content of the minimalist lexicon $X_{12}$ of language learner $L$ at time $t = 12$.}
\[
\begin{array}{lll}
    \langle \TT{one}, \TT{:\!: num}, 1 \rangle &
    \langle \TT{two}, \TT{:\!: num}, 2 \rangle &
    \langle \TT{three}, \TT{:\!: num}, 3 \rangle \\
    \langle \TT{four}, \TT{:\!: num}, 4 \rangle &
    \langle \TT{five}, \TT{:\!: num}, 5 \rangle &
    \langle \TT{six}, \TT{:\!: num}, 6 \rangle \\
    \langle \TT{seven}, \TT{:\!: num}, 7 \rangle &
    \langle \TT{eight}, \TT{:\!: num}, 8 \rangle &
    \langle \TT{nine}, \TT{:\!: num}, 9 \rangle \\
    \langle \TT{ten}, \TT{:\!: num}, 10^1 \rangle &
    \langle \TT{eleven}, \TT{:\!: num}, +(\times(10^1)(1))(1) \rangle &
    \langle \TT{twelve}, \TT{:\!: num}, +(\times(10^1)(1))(2) \rangle
\end{array}
\]
\end{table}

The learner is so able to perfectly reproduce the learned entries directly via data base query. As a consequence, the teacher $T$ rewards $L$ thus signalling that it has correctly learned the lexicon $X_{12}$.

When the teacher continues counting: $u_{13} = \langle \TT{thirteen}, +(\times(10^1)(1))(3) \rangle$, $u_{14} = \langle \TT{fourteen}, +(\times(10^1)(1))(4) \rangle$, $u_{15} = \langle \TT{fifteen}, +(\times(10^1)(1))(5) \rangle$ and so on, the learner's pattern matching faculty detects a common affix $\TT{teen}$ in the exponents, and a common function $x \mapsto +(\times(10^1)(1))(x)$ in the semantics of UMPs $u_{13}, u_{14}, \dots u_{19}$.

Thus, in a first step UMP $u_{13}$ is still added to the lexicon according to update rule \pref{eq:dyn1},
\begin{equation}\label{eq:dyn13}
    X_{13} \gets X_{12} \cup \{ \langle \TT{thirteen}, \TT{\!:: num} , +(\times(10^1)(1))(3) \rangle  \} \:.
\end{equation}
However, at time $t = 14$, pattern matching, segmentation and lambda abstraction are performed, leading to a revision \cite{KobeleCollierEA02, StablerEA03}
\begin{eqnarray}
    X_{14} &\gets& X_{13} \setminus \{ \langle \TT{thirteen}, \TT{\!:: num} , +(\times(10^1)(1))(3) \rangle \} \label{eq:dyn14_1}  \\
    X_{14} &\gets& X_{14} \cup \{ \langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle \} \label{eq:dyn14_2} \\
    X_{14} &\gets& X_{14} \cup \{ \langle \TT{thir}, \TT{:\!: num}, 3 \rangle \} \label{eq:dyn14_3} \:,
\end{eqnarray}
such that in \pref{eq:dyn14_1} the previously learned lexicon $X_{13}$ is revised by removing the entry for the composite $\TT{thirteen}$, followed by adding the complex morpheme $\langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle$ in \pref{eq:dyn14_2}, and completed in \pref{eq:dyn14_3}. For the morpheme $\langle \TT{four}, \TT{:\!: num}, 4 \rangle$ is already contained in the lexicon, further updating is not required at this time.

Next, $L$ has to correctly reproduce the UMPs $u_{13}$ and $u_{14}$ by invoking its \emph{utterance-meaning transducer} (UMT) \cite{GrabenMeyerEA19}. Consider $u_{13}$, which is now ambiguous with respect to the lexicon entries for $3$. First, $L$ may access data base entries $\langle \TT{thir}, \TT{:\!: num}, 3 \rangle $ and $\langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle $ and derive the following UMP according to the MG rules (\ref{merge-1} -- \ref{move-2})
\begin{eqnarray}\label{eq:deri13_1}
&&\dfrac{\langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \qquad
    \langle \TT{thir}, \TT{:\!: num}, 3 \rangle
    }
    {\langle \TT{thirteen}, \TT{: num}, (\lambda x.+(\times(10^1)(1))(x))(3) \rangle
    } \: \text{merge-2} \:. \nonumber \\
\end{eqnarray}
This yields the correct semantics with the lambda calculus
\[
    (\lambda x.+(\times(10^1)(1))(x))(3) = +(\times(10^1)(1))(3) = 13
\]
and the uttered exponent $\TT{thirteen}$, generated by the UMT \cite{GrabenMeyerEA19}, is well-formed and will be rewarded by the teacher.

However, $L$ may alternatively select data base entries $\langle \TT{three}, \TT{:\!: num}, 3 \rangle $ and $\langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle $ as well. Then
\begin{eqnarray}\label{eq:deri13_2}
&&\dfrac{\langle \TT{teen}, \TT{: =num} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \qquad
    \langle \TT{three}, \TT{:\!: num}, 3 \rangle
    }
    {\langle \TT{threeteen}, \TT{: num}, (\lambda x.+(\times(10^1)(1))(x))(3) \rangle
    } \: \text{merge-2} \nonumber \\
\end{eqnarray}
will be derived instead. Although it has the correct semantics $13$, uttering the exponent $\TT{threeteen}$ will be rejected by $T$. Upon the resulting punishment, $L$ has to reconfigure its mental lexicon by introducing additional licenser/licensee pairs, here denoted as $\TT{+k}/\TT{-k}$ \cite{KobeleCollierEA02, StablerEA03}. Table \ref{tab:mg2} displays the result of this reorganization process at some time $n$ later than $t = 19$ when all possible ungrammaticalities have been abandoned.

\begin{table}[H]
\caption{\label{tab:mg2} Content of the minimalist lexicon $X_n$ of language learner $L$ after punishment reorganization at time $n$.}
\[
\begin{array}{lll}
    \langle \TT{one}, \TT{:\!: num}, 1 \rangle &
    \langle \TT{two}, \TT{:\!: num}, 2 \rangle &
    \langle \TT{three}, \TT{:\!: num}, 3 \rangle \\
    \langle \TT{thir}, \TT{:\!: num} \ \TT{-k}, 3 \rangle &
    \langle \TT{four}, \TT{:\!: num} \ \TT{-k}, 4 \rangle &
    \langle \TT{five}, \TT{:\!: num}, 5 \rangle \\
    \langle \TT{fif}, \TT{:\!: num} \ \TT{-k}, 5 \rangle &
    \langle \TT{six}, \TT{:\!: num} \ \TT{-k}, 6 \rangle &
    \langle \TT{seven}, \TT{:\!: num} \ \TT{-k}, 7 \rangle \\
    \langle \TT{eight}, \TT{:\!: num} \ \TT{-k}, 8 \rangle &
    \langle \TT{nine}, \TT{:\!: num}\ \TT{-k}, 9 \rangle &
    \langle \TT{ten}, \TT{:\!: num}, 10^1 \rangle \\
    \langle \TT{eleven}, \TT{:\!: num}, +(\times(10^1)(1))(1) \rangle &
    \langle \TT{twelve}, \TT{:\!: num}, +(\times(10^1)(1))(2) \rangle &
    \langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
\end{array}
\]
\end{table}

Now only the data base selection $\langle \TT{thir}, \TT{:\!: num} \ \TT{-k}, 3 \rangle$ and $\langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle$ leads to a grammatical derivation of the UMT \cite{GrabenMeyerEA19},
\begin{eqnarray}\label{eq:deri13_3}
&&\dfrac{\langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \qquad
    \langle \TT{thir}, \TT{:\!: num} \ \TT{-k}, 3 \rangle
    }
    {\langle \TT{teen}, \TT{: +k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \langle \TT{thir}, \TT{: -k}, 3 \rangle
    } \: \text{merge-3} \nonumber \\
&&\dfrac{\langle \TT{teen}, \TT{: +k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \langle \TT{thir}, \TT{: -k}, 3 \rangle
    }
    {\langle \TT{thirteen}, \TT{: num}, (\lambda x.+(\times(10^1)(1))(x))(3) \rangle \:,
    } \: \text{move-1} \:, \nonumber \\
\end{eqnarray}
while its ambiguous counterpart
\begin{eqnarray}\label{eq:deri13_4}
&&\dfrac{\langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \qquad
    \langle \TT{three}, \TT{:\!: num}, 3 \rangle
    }
    {\langle \TT{threeteen},  \TT{: +k} \ \TT{num}, (\lambda x.+(\times(10^1)(1))(x))(3) \rangle
    } \: \text{merge-2} \nonumber \\
\end{eqnarray}
cannot be further processed due to a lacking licensee $\TT{-k}$.

The same argument applies to the ambiguous entries $\langle \TT{five}, \TT{:\!: num}, 5 \rangle $ and $\langle \TT{fif}, \TT{:\!: num} \ \TT{-k}, 5 \rangle$ where only the latter successfully derives $\langle \TT{fifteen}, \TT{: num}, +(\times(10^1)(1))(5)  \rangle$. Note that the currently learned grammar also derives the exponent $\TT{eightteen}$ instead of $\TT{eighteen}$; this could be corrected by either learning an additional entry $\langle \TT{eigh}, \TT{:\!: num} \ \TT{-k}, 8 \rangle$ and revising $\langle \TT{eight}, \TT{:\!: num}, 8 \rangle$, or, perhaps more appropriately, by introduction of additional phonotactical rules operating on abstract graphon representations \cite{WolffEichnerHoffmann01}. Moreover, since simplex numerals such as $\TT{four}$, $\TT{six}$, $\TT{seven}$, and $\TT{nine}$ must not possess any other features than $\TT{num}$, they would be doubled in a more rigorous treatment, resulting in four additional lexicon entries.

From a semantic point of view, the lexicon state in \Tab{tab:mg2} is not yet satisfactory, because another step of lambda abstraction can be applied to entry $\langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle$, entailing the semantics of plain addition
\begin{equation}\label{eq:addsem}
    \lambda x.+(\times(10^1)(1))(x) = (\lambda y.\lambda x.+(y)(x))(\times(10^1)(1)) \:.
\end{equation}

Incorporating this into the training process gives another updating dynamics
\begin{eqnarray}
    X_m &\gets& X_{m - 1} \setminus \{ \langle \TT{teen}, \TT{: =num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle \} \label{eq:dynm_1}  \\
    X_m &\gets& X_m \cup \{ \langle \varepsilon, \TT{:\!: =num} \ \TT{=num} \ \TT{+k} \ \TT{num}, \lambda y.\lambda x.+(y)(x) \rangle \} \label{eq:dynm_2} \\
    X_m &\gets& X_m \cup \{ \langle \TT{teen}, \TT{:\!: num}, \times(10^1)(1)) \rangle \} \label{eq:dynm_3} \:,
\end{eqnarray}
such that \pref{eq:dynm_1} removes the original $\TT{teen}$ from the lexicon which is subsequently replaced by the phonetically void addition operator $\langle \varepsilon, \TT{:\!: =num} \ \TT{=num} \ \TT{+k} \ \TT{num}, \lambda y.\lambda x.+(y)(x) \rangle$  and a new representative $\langle \TT{teen}, \TT{:\!: num}, \times(10^1)(1)) \rangle $.

Table \ref{tab:mg3} shows the updated lexicon at some even later time $t = m$.

\begin{table}[H]
\caption{\label{tab:mg3} Content of the minimalist lexicon $X_m$ of language learner $L$ after semantic reorganization at time $m$.}
\[
\begin{array}{lll}
    \langle \TT{one}, \TT{:\!: num}, 1 \rangle &
    \langle \TT{two}, \TT{:\!: num}, 2 \rangle &
    \langle \TT{three}, \TT{:\!: num}, 3 \rangle \\
    \langle \TT{thir}, \TT{:\!: num} \ \TT{-k}, 3 \rangle &
    \langle \TT{four}, \TT{:\!: num} \ \TT{-k}, 4 \rangle &
    \langle \TT{five}, \TT{:\!: num}, 5 \rangle \\
    \langle \TT{fif}, \TT{:\!: num} \ \TT{-k}, 5 \rangle &
    \langle \TT{six}, \TT{:\!: num} \ \TT{-k}, 6 \rangle &
    \langle \TT{seven}, \TT{:\!: num} \ \TT{-k}, 7 \rangle \\
    \langle \TT{eight}, \TT{:\!: num} \ \TT{-k}, 8 \rangle &
    \langle \TT{nine}, \TT{:\!: num}\ \TT{-k}, 9 \rangle &
    \langle \TT{ten}, \TT{:\!: num}, 10^1 \rangle \\
    \langle \TT{teen}, \TT{:\!: num}, \times(10^1)(1) \rangle &
    \langle \TT{eleven}, \TT{:\!: num}, +(\times(10^1)(1))(1) \rangle &
    \langle \TT{twelve}, \TT{:\!: num}, +(\times(10^1)(1))(2) \rangle \\
    \langle \varepsilon, \TT{:\!: =num} \ \TT{=num} \ \TT{+k} \ \TT{num}, \lambda y.\lambda x.+(y)(x) \rangle
\end{array}
\]
\end{table}

Now, the correct derivation of $\TT{thirteen}$ reads
\begin{eqnarray}\label{eq:deri13_5}
&&\dfrac{\langle \varepsilon, \TT{:\!: =num} \ \TT{=num} \ \TT{+k} \ \TT{num}, \lambda y.\lambda x.+(y)(x) \rangle
    \qquad
    \langle \TT{teen}, \TT{:\!: num}, \times(10^1)(1) \rangle
    }
    {\langle \TT{teen}, \TT{:} \TT{=num} \ \TT{+k} \ \TT{num}, (\lambda y.\lambda x.+(y)(x))(\times(10^1)(1)) \rangle
    } \: \text{merge-1} \nonumber \\
&&\dfrac{\langle \TT{teen}, \TT{:} \TT{=num} \ \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \qquad
    \langle \TT{thir}, \TT{:\!: num} \ \TT{-k}, 3 \rangle
    }
    {\langle \TT{teen}, \TT{:} \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \langle \TT{thir}, \TT{: -k}, 3 \rangle
    } \: \text{merge-3} \nonumber \\
&&\dfrac{\langle \TT{teen}, \TT{:} \TT{+k} \ \TT{num}, \lambda x.+(\times(10^1)(1))(x) \rangle
    \langle \TT{thir}, \TT{: -k}, 3 \rangle
    }
    {\langle \TT{thirteen}, \TT{:} \TT{num}, +(\times(10^1)(1))(3) \rangle \:.
    } \: \text{move-1} \:. \nonumber \\
\end{eqnarray}

By virtue of lexicon $X_m$ the learner is able to correctly reproduce numerals $\TT{one}, \dots, \TT{nineteen}$, employing its UMT \cite{GrabenMeyerEA19}. This will be rewarded by the teacher. Later, the teacher utters the UMPs $u_{20} = \langle \TT{twenty}, \times(10^1)(2) \rangle$, $u_{21} = \langle \TT{twentyone}, +(\times(10^1)(2))(1) \rangle$, $u_{22} = \langle \TT{twentytwo}, +(\times(10^1)(2))(2) \rangle$ etc. Again, the learner will first incorporate $\langle \TT{twenty}, \times(10^1)(2) \rangle$ according to rule \pref{eq:dyn1} into the lexicon. But upon perceiving $u_{21}$ its pattern matching device produces a common morpheme
\begin{equation}\label{eq:ty}
      \langle \TT{ty}, \TT{:\!:} \: \TT{=num} \: \TT{num}, \lambda x. \times(10^1)(x) \rangle
\end{equation}
through lambda abstraction. Then the essentially same processes of reinforcement learning are repeated as above until the complete numeral system of the language taught by the teacher has been acquired by the learner.

\section{Discussion}
\label{sec:disc}

In this contribution we have outlined an algorithm for effectively learning the syntactic morphology and semantics of English numerals \cite{Hurford01}. Number words are presented to a cognitive agent by a teacher in form of utterance meaning pairs (UMP) where the meanings are encoded as arithmetic terms from a suitable term algebra. This representation allows for the application of compositional semantics via lambda calculus. For the description of syntactic categories we use Stabler's minimalist grammar (MG) \cite{Stabler97, StablerKeenan03}, a powerful computational implementation of Chomsky's recent Minimalist Program for generative linguistics \cite{Chomsky95}. Despite the controversy between Chomsky and Skinner \cite{Chomsky59}, we exploit reinforcement learning \cite{Skinner15, SuttonBarto18} as training paradigm. Since MG encodes universal linguistic competence through the five inference rules (\ref{merge-1} -- \ref{move-2}), thereby separating innate linguistic knowledge from the contingently acquired lexicon, our approach could potentially unify generative grammar and reinforcement learning, hence resolving the abovementioned dispute.

Minimalist grammar can be learned from linguistic dependency structures \cite{KobeleCollierEA02, StablerEA03, BostonHaleKuhlmann10, KleinManning04} by positive examples, which is supported by psycholinguistic findings on early human language acquisition \cite{Ellis06, Pinker95, Tomasello06}. However, as Pinker \cite{Pinker95} has emphasized, learning through positive examples alone, could lead to undesired overgeneralization. Therefore, reinforcement learning that might play a role in children language acquisition as well \cite{Moerk83, SundbergEA96}, could effectively avoid such problems. The required dependency structures are directly provided by the semantics in the training UMPs. Thus, our approach is explicitly semantic-driven, in contrast to the algorithm in \cite{KleinManning04} that regards dependencies as latent variables for EM training.

As a proof-of-concept we suggested an algorithm for English numerals. However, we also have evidence that it works for German and French number systems as well and hopefully for other languages also. Using attribute-value logics \cite{Johnson88} and its associated term algebra, it should be possible to encode the semantics of arbitrary utterances in a compositional fashion. This will open up an entirely new avenue for the further development of speech-controlled cognitive user interfaces \cite{TschopeDuckhornEA18}.

redpajama_set_name: RedPajamaArXiv


The 2013 Freedom Fest event schedule for Pine City, MN has been finalized for a number of weeks and the anticipation of this community festival has been building throughout the week. Pine City residents and visitors have a number of great events to look forward to in the coming days.
Here is a flyer with the event list for the weekend.
Can't view the graphic? Visit the Chamber website at www.pinecitychamber.com and find a text version of the schedule of activities.
Pine City has added another incentive to bring new business to town. Over 40 acres in the city's industrial park are now 'Shovel Ready', making it one of the few communities statewide to have certified, Shovel Ready lands.
Since 2009, only 18 Minnesota communities have applied for the state's Shovel Ready Site Certification Program to facilitate the attraction of new business and industry. Pine City became certified in May and joins Cambridge and Isanti as the only Shovel Ready communities in all of East Central Minnesota. Pine City is the only community along I-35 between the Twin Cities and the Twin Ports with the incentive.
The term "shovel ready" refers to commercial and industrial sites that have had all of the planning, zoning, surveys, title work, environmental studies, soils analysis and public infrastructure engineering completed prior to offering the site for sale. In addition, the sites are under the legal control of a community or in partnership with a third party.
"Sites that are certified 'shovel ready' are more attractive to companies and site-selection consultants looking for locations for business expansions or relocations," said John Rhodes, a leading national site-location consultant with Moran, Stahl & Boyer of Lakewood Ranch, Fla.
Certified shovel-ready status is fast becoming a standard for sites that are marketed around the country. Minnesota's Certified Shovel Ready sites continue to be marketed at national conferences, trade shows and on the MnProspector.com Web site, the state's site-selection database.
The application fee for shovel-ready certification was $2,950, paid by the Pine City Economic Development Authority. The fee covered the cost of initial review, onsite inspection, final certification and marketing. The Minnesota Shovel Ready Certified Development Sites Initiative was created by the Positively Minnesota Marketing Partnership together with DEED.
For more information on Minnesota's Shovel Ready Site Certification Program, contact Gene Goddard, senior business development specialist, DEED, 651-259-7436, toll free 1-800-657-3858, e-mail gene.goddard@state.mn.us, or John Rhodes, senior principal, Moran, Stahl & Boyer, 941-755-0074, e-mail john.rhodes@msbconsulting.com. The Minnesota Shovel Ready Certification Web site is located at www.PositivelyMinnesota.com.


* Change libpng12-dev to libpng-dev, to ease libpng transition.
* Remove Sylvain Le Gall from Uploaders.
* Depend on libtiff4-dev. That transition is not ready.
* Reorder inclusions in debian/rules to workaround a CDBS bug.
* Fix missing comma in control file, Closes: #535675.
* Move library packages to ocaml section.
* Get rid of usage of old OCaml's stdlib location, fixes FTBFS.
* Move documentation from the -dev package to the -doc one.
this is a trivial change.
* Rebuilt with lablgtk2 and libpng12-0.
NMU with the maintainers authorization.
* Versioned conflict on camlimages.
* Split runtime and development parts of the library.
* Some aesthetical changes in debian/rules.


text:
SHIMON GAMBOURG
Shimon Gambourg is an internationally acclaimed, New York based bassist and
composer, committed to bringing out the individuality in every musical setting he
encounters. The diversity of his work has granted him a steady stream of activity, with
the past year alone seeing him collaborate with Miguel Zenón and the Nordpool
Orkest in Europe, as well as the Manhattan School of Music Jazz Orchestra featuring
Ingrid Jensen, which he composed for and conducted at Jazz at Lincoln Center.
Shimon is a two-time ASCAP Young Jazz Composer Award winner, a four-time
America-Israel Cultural Foundation "Creative Excellence Grant" recipient, and was
recently interviewed by the Jerusalem Post and Haaretz. Gaining traction on the New
York scene, he is currently working on a book of arrangements for a new all-star
band, featuring Randy Brecker, James Carter, Russell Malone and Vincent Herring.
Originally from Israel, Shimon has first arrived in the U.S. in 2016 to study at the
Berklee College of Music on a full-tuition scholarship, before moving on to the
Manhattan School of Music to complete his Masters in Jazz Composition, graduating
in 2022. His teachers include Mike Holober, John Patitucci, and James Genus.


text:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">

<meta http-equiv="Content-Type" content="text/html" charset="UTF-8">
<title>Overview List (Apache Hadoop HttpFS 2.6.0-cdh5.4.2 API)</title>
<meta name="date" content="2015-05-19">
<link rel="stylesheet" type="text/css" href="stylesheet.css" title="Style">

All Classes

Packages

org.apache.hadoop.fs.http.client

org.apache.hadoop.fs.http.server

org.apache.hadoop.lib.lang

org.apache.hadoop.lib.server

org.apache.hadoop.lib.service

org.apache.hadoop.lib.service.hadoop

org.apache.hadoop.lib.service.instrumentation

org.apache.hadoop.lib.service.scheduler

org.apache.hadoop.lib.service.security

org.apache.hadoop.lib.servlet

org.apache.hadoop.lib.util

org.apache.hadoop.lib.wsrs


text:
TCL announces new 10 Series phones and other Smart Connected Devices
Posted by Ryan Moore on April 06, 2020
The company that was making some of the devices for BlackBerry, still made some quality devices. Today they're announcing the newest "10 Series", check out the presser below:
TCL 10-Series - the 10 Pro, 10L and 10 5G
TCL's latest Smart Connected Devices - 5G Router, Headphones, and Kids Watch
TCL Expands Smartphone Portfolio with 10-Series Lineup, Offering
Affordable Options for 5G and Premium Display Technology
HONG KONG – 6 April 2020 – Today, TCL Communication is officially debuting its first series of TCL-branded smartphones, the TCL 10 Series. This lineup of premium, yet affordable Android devices will leverage TCL-made high-resolution displays and the company's NXTVISION visual technology, and each device will come with a high-quality quad rear-camera setup, Qualcomm® Snapdragon™ processors, and more flagship-style features, all available for under $500. The 10 Series includes TCL's first 5G smartphone and the company's first device that uses a TCL-made curved AMOLED display.
"As one of the world's leading consumer electronics brands, expanding the TCL brand into the mobile space ensures that we are one of the only global manufacturers that offers a fully integrated ecosystem of smart products in virtually every aspect of your life," said Kevin Wang, CEO of TCL Industrial Holdings. "This makes it possible for us to provide our customers with a wide range of products capable of working seamlessly together, and do so more affordably than everyone else."
Embodying the company's mission to "Display Greatness," each of the TCL 10-Series smartphones takes advantage of TCL's tightly integrated ecosystem by using TCL-built screens and TCL NXTVISION, a proprietary advanced display and camera visual technology to bring images to life with truer color, clarity and contrast enhancements in real-time. TCL's display technology generates cutting-edge color accuracy so users cannot see a perceivable difference between real life and the images on the screen. The 10 Series also has an SDR to HDR real-time conversion feature, providing HDR-like video enhancement with brighter highlights, darker shadows, increased contrast and amplified color.
TCL 10 5G: Bringing 5G Technology to More People
The company's first 5G-enabled smartphone, the TCL 10 5G is designed to bring the benefits of 5G connectivity to consumers looking for something modern and affordable. Powered by SnapdragonTM 7-series 5G SoC, the TCL 10 5G delivers increased data bandwidth for faster uploads, downloads and upgraded Wi-Fi connection stability. The TCL 10 5G comes with a large, modern 6.53-inch FHD+ DotchTM display, providing an impressive 91 percent screen-to-body ratio.
"The 5G era is now here around the world, and it is opening up a new round of technological revolution which will fundamentally enrich how we live our lives," said Alex Katouzian, SVP and GM, Mobile, Qualcomm Technologies, Inc. "Qualcomm Technologies and TCL have maintained a close and strong collaboration for a long time, and we are excited to see TCL select the Snapdragon 765 5G Mobile Platform for their very first 5G smartphone. The Snapdragon 765 integrates 5G connectivity and Artificial Intelligence, which will help TCL 10 5G bring remarkable 5G capabilities and life-changing experiences to more consumers worldwide."
On the back, the TCL 10 5G sports a quad camera setup that includes a 64MP high resolution main camera, a 118-degree ultra wide-angle camera, a macro camera that lets users take super close-up shots at only 2cm away, and a depth camera for professional quality photos with Bokeh. The TCL 10 5G's front facing 16MP camera ups the selfie game with its 4-in-1 big pixel technology that automatically combines four pixels into one to produce brighter selfie photos and improve low-light capabilities.
Additionally, the TCL 10 5G comes with a large battery boasting a full day of phone use and Quick ChargeTM 3.0 fast charging technology. It also features OTG Reverse Charging, turning the phone into a portable power bank to charge small items or help a friend in need if their device is low on battery. The TCL 10 5G will be available in select regions around the world later this year for €399/£399.
TCL 10 Pro: Taking NXTVISION to the Edge with TCL's First Curved AMOLED Display
Featuring a sleek, TCL-made 6.47-inch FHD+ curved AMOLED display, the 2020 iF Design Award- and 2020 Red Dot Award-winning TCL 10 Pro delivers a wide range of color clarity and sharp picture resolution. Its curved design allows the screen to "fall" off the edge with minimal bezels to achieve a high screen-to-body ratio and includes Edge Bar shortcuts to quickly access apps one-handed. The TCL 10 Pro also includes fingerprint on display that sits under the screen for users to quickly unlock their phone. By leveraging NXTVISION technology to produce nearly accurate colors and enhanced image and video quality, the TCL 10 Pro joins a select group of smartphones that are Netflix-certified to stream HDR10 videos, unlocking a wide range of HDR content with increased contrast and enhanced colors at an affordable price point.
AI-powered imaging technology in the TCL 10 Pro produces photos and selfies rich in clarity and color in low light. The 10 Pro comes with four rear cameras, including a 64MP high-res camera, 2.9μm big pixel low-light video cam, 123-degree super wide-angle camera and macro camera, as well as a 24MP front-facing camera. Additionally, it features a hybrid auto focus solution for a fast and crisp shot day or night. For more creative videographers, the TCL 10 Pro includes super low light video and super wide-angle video capabilities for high-quality creative video content.
The TCL 10 Pro's sophisticated curved design also boasts perfectly symmetrical details, a matte finish on the back for a smooth in-hand feel and an anti-glare screen with a unified, sleek profile. The TCL 10 Pro comes in Ember Gray and Forest Mist Green color options, and will be available in Europe, North America, Australia, and the United Kingdom starting in Q2 2020 for €449/$449/£399.
TCL 10L: NXTVISION Made Accessible for Everyone
The TCL 10L offers quality features and design that can fit even the smallest budget. It pairs 6GB RAM with a Qualcomm® Snapdragon™665 processor that comes with an AI platform for fast performance and low power consumption. The TCL 10L features an immersive experience with its 6.53-inch FHD+ DotchTM display with a 91 percent screen-to-body ratio. Powered by NXTVISION with a dedicated display engine, users can take visuals to the next level with truer color accuracy and real-time visual enhancements for crisper details, greater contrast. The TCL 10L also comes with four rear cameras, along with a 16MP selfie camera that are all powered by AI technology to recognize and enhance scenes and objects for the best creations. TCL 10L also features Stop Motion video, enabling fun and creative stop motion video directly with the phone without post editing needed.
With the TCL 10L, affordability does not mean it has to compromise on design and comfort with its eye-catching holographic finishes and glossy, iridescent shine on the back and sleek 3D backing for premium in-hand feel. The TCL 10L comes in nature-inspired Arctic White and Mariana Blue color options, and will be available in Europe, North America, Australia, and the United Kingdom starting in Q2 2020 for €249/$249/£199.
TCL Smart Experiences: The New Standard for Smartphones
Leveraging TCL's display expertise and fully integrated ecosystem, all three TCL 10-Series smartphones are packed with easy-to-use features and shortcuts so users can share content seamlessly and customize their smartphones to match their unique lifestyles:
Dynamic TCL UI: TCL knows everyone uses their phones differently. The TCL UI offers lively interfaces, intuitive interaction and customizable features for additional ease of use.
Eye Comfort Display: With the user's vision health in mind, TCL makes it easy on the eyes with eye care modes such as Adaptive Tone, Reading Mode and Eye Comfort Mode to help provide the best viewing experience regardless of lighting conditions.
Smart Key: Access commonly used apps and features with a dedicated, customizable button. The button can be customizable in three ways - single, double, and long press - to activate apps such as the camera or Google Assistant, as well as functions such as cleaning up background apps.
Super Bluetooth: Push the limits of audio-streaming by connecting up to four Bluetooth speakers or headphones to share music with friends for the ultimate dance party (or silent disco party).
To learn about TCL Mobile devices, including the TCL 10 Series, please visit http://www.tcl.com/global/en.html.
TCL Adds New Smart Home Devices to Integrated Ecosystem, Including 5G Router and Heart Rate Monitoring Earphones
HONG KONG – 6 April, 2020 - TCL Communication announces four new smart devices to its fully integrated ecosystem, including the brand's first ultrafast 5G CPE, true wireless earphones, wireless heart rate monitoring sport headphones, and a 4G connected smartwatch for kids. With the growing demand for smart devices and next-gen 5G products for the connected lifestyle, TCL Communication's latest lineup delivers affordable, high quality devices that are easily accessible to everyone.
"We are proud to be one of the few companies in the world with a fully integrated ecosystem, and we want to continue expanding our lineup to become even more inclusive of our customers' needs," said Aaron Zhang, Vice President and General Manager of Global Sales & Marketing for TCL Communication. "In adding more 5G and connected devices to the TCL brand, we are ensuring that our ecosystem will grow into additional aspects of home and family life for years to come."
TCL LINKHUB 5G CPE: The ultrafast 5G router for your smart home
TCL LINKHUB 5G CPE is designed to be a lightweight, portable router to access next-gen network speeds at home and at work. The device supports smart dual-band Wi-Fi with 4X4 MU-MIMO technology which greatly extends coverage, maintains stable high-speed connections, and supports up to 1,000 simultaneous connections, making it perfect for homes, small businesses, live events, and more.
The LINKHUB 5G CPE is equipped with the Qualcomm Snapdragon X55 chipset and supports 5G connectivity up to 2.8Gbps and the latest Wi-Fi 6 technology for speeds up to 3.6Gbps, enough bandwidth for users to download a 1Gbps HD movie in just 3 seconds — nearly 10 times the speed of 4G LTE. The LINKHUB 5G CPE comes with Easy Mesh, which allows users to easily connect with their mesh router system, to extend Wi-Fi coverage throughout multi-story homes and large spaces to deliver ultrafast Wi-Fi without dead zones. It also supports both Bluetooth and ZigBee for easy set up.
The TCL LINKHUB 5G CPE will be available in Europe, U.S., China, Asia and Pacific, Middle East and Africa beginning in Q3 2020 from €499.
SOCL500TWS & ACTV500TWS: Wireless earphones with zero compromise on sound quality
Completely cable-free and versatile, the SOCL500TWS & ACTV500TWS wireless headphones give users a new degree of audio freedom. The SOCL500TWS come with 5.8mm speaker drivers while ACTV500TWS comes with 6mm drivers, delivering premium, clear sound quality with rich bass. The headphones are designed with comfort in mind as they leverage the inner ear for support - unlike other devices on the market that rely solely on the ear canal, resulting in discomfort when worn for extended periods. Additionally, the ACTV500TWS comes with Comply Foam Tips™ to ensure a snug, custom in-ear fit. The
SOCL500TWS is IPX4-rated with its water-repellent casing and microphone mesh, while the ACTV500TWS is IPX5 certified, meaning it is completely water and splash proof.
The SOCL500TWS has a total playtime up to 26 hours, with 6.5-hour continuous playback and 19.5 hours of additional charge from the case. The ACTV500TWS has a total playtime up to 33 hours, with 6.5-hour continuous playback and 26.5 hours of additional charge from the case. The ACTV500TWS has wireless charging capabilities, including a quick charge feature that can generate one hour of play time with just 15 minutes of charge.
The SOCL500TWS is available in four colors, including Blue Ocean, Sunset Violet, Sunrise Orange, and Phantom Black, while the ACTV500TWS is available in two colors, Copper Dust and Copper Ash. The SOCL500TWS & ACTV500TWS will be available in Europe and the U.S. starting in Q1 2020 for €79.99/$79.99 and €99.99/$99.99 respectively.
ACTV200BT: TCL's first heart rate monitoring sports earphones delivers hands-free readings in real-time
The first wireless earphones of its kind, the ACTV200BT was created with the belief that providing consumers with an easy-to-use heart rate monitor will encourage healthier lifestyles. The ACTV200BT uses ActivHearts™, a multi-sensor system built into the acoustic tube of the right earpiece, to provide an accurate heart rate reading in real-time. When paired with common third-party smartphone apps, the earphones can provide an audio reading on the spot so users can focus on exercising without being distracted by having to look at their devices. The earphones are also IPX4 certified, meaning they are sweat- and water-resistant, making it a perfect workout companion for those looking for an easy way to monitor their heart rates.
Designed with an 8.6mm speaker driver and passive noise isolation, the ACTV200BT delivers acoustically accurate and balanced sound that boasts a long playtime of up to 14 hours. The ACTV200BT also supports Bluetooth 5.0 and fast charging for up to 2 hours of playback time after only 15 minutes of charge time. The ACTV200BT comes in two colors, Copper Dust and Copper Ash, and will be available in Europe and the U.S. starting in Q1 2020 at €79.99/$79.99.
MOVETIME Kids Watch MT43K: A companion for children that lets families stay connected
The new MOVETIME Kids Watch MT43K is perfect for parents looking for a device that will keep them connected with their children. Not only is the watch fun and easy to use for kids, parents can also monitor their children's location, receive instant notifications when their children exit a preset safe zone or push the SOS button, and establish immediate contact with its hands-free 4G two-way calling and voice messaging.
The watch also acts as a daily activity tracker that counts steps, calories burned and distance walked, allowing parents to encourage their child to live an active lifestyle. Moreover, parents can also track their children's location history and easily navigate to their child with third party maps. Parents will also have peace of mind as the watch is Children's Online Privacy Protection Act (COPPA), California Consumer Privacy Act (CCPA) and General Data Protection Regulation (GDPR) compliant, giving its users full data and privacy protection.
Children will also have the added benefit of engaging with their friends through Bluetooth, where they can add their friends and interact with them. Parents will still have control with School Mode, a feature that allows parents to dictate when kids can use their watches during class time.
The MOVETIME watch comes with a 1.4-inch AMOLED touch display that is water and dust resistant, as well as a voice-activated assistant to call contacts or open applications. The watch comes with a long-lasting battery that has a standby time of up to four days or usage time of up to two days.
The watch will come with multiple colorful hypoallergenic replaceable bands, and will be available in North America and Europe later this year with prices set at $179.
announcement Connected Phones TCL


shop stool with backrest racing shop stool with backrest shop stool with backrest home depot.
shop stool with backrest shop stool with backrest related post shop stool with backrest shop stool backrest kit.
shop stool with backrest adjustable shop stool with backrest large size of enchanting hand pneumatic adjustable lab shop stools beautiful adjustable shop stool with backrest shop stool backrest kit.
shop stool with backrest fiber bar stool with backrest wood base h cm ultra cushioned swivel shop stool with deluxe backrest.
shop stool with backrest craftsman shop stool creative shop stool with backrest garage stool with wheels medium size of bar craftsman shop stool shop stool with backrest home depot.
shop stool with backrest adjustable shop stool with backrest shop stool with back full size of high back stool cool adjustable shop stool with backrest best shop stool with backrest.
shop stool with backrest shop stool with backrest original early vintage industrial garage stool with backrest swivel shop stool with backrest.
shop stool with backrest inch adjustable height stool with backrest shop stool with backrest home depot.
shop stool with backrest set of 2 black bar stool with high backrest polyurethane shop stool with backrest.
shop stool with backrest craftsman shop stool shop stool on wheels large size of shop stools image inspirations with backrest shop stool backrest kit.
shop stool with backrest adjustable shop stool with backrest bar stool with backrest oil can bar stool backrest shop stools shop stool backrest.
shop stool with backrest craftsman shop stool with backrest.
shop stool with backrest swivel shop stool shop stool with wheels adjustable swivel shop stool shop stool wheels swivel shop best shop stool with backrest.
shop stool with backrest adjustable height swivel shop stool w backrest black craftsman shop stool with backrest.
shop stool with backrest fashion bar chair lift bar stool modern minimalist shop stool chair high chair backrest best shop stool with backrest.
shop stool with backrest shop stool home depot workbench shop stool home depot rolling for double duty with back shop shop stool swivel shop stool with backrest.
shop stool with backrest craftsman stool shop stool with backrest shop stool with backrest craftsman shop stool with backrest hydraulic swivel shop stool with backrest.
shop stool with backrest garage stool with back garage bar stools medium size of bar garage stool shop pneumatic bar garage stool shop stool with backrest home depot.
shop stool with backrest shop stool with backrest bar stool with backrest garage stool with backrest and wheels craftsman shop stool with backrest.
shop stool with backrest craftsman shop stool sears craftsman shop stool craftsman shop stool with backrest shop stool backrest.
shop stool with backrest shop best shop stool with backrest.
shop stool with backrest shop stool with backrest craftsman shop stool craftsman workshop counter stool adjustable hydraulic bench seat garage craftsman shop stool with backrest.
shop stool with backrest shop stool with backrest garage stool with backrest garage stools garage stool with backrest bar stools craftsman shop stool with backrest.
shop stool with backrest hydraulic shop stool adjustable vinyl padded backrest and seat chrome ultra cushioned swivel shop stool with deluxe backrest.
shop stool with backrest my cool car stuff john garage shop stool futures john bar polyurethane shop stool with backrest.
shop stool with backrest secured powered by shop stool backrest.
shop stool with backrest shop stools with back large size of bar stools with backrest oak without backs back pain shop stool backrest kit.
shop stool with backrest garage stool with backrest red padded shop stool with backrest car guy garage ford garage stool ultra cushioned swivel shop stool with deluxe backrest 2 pack.
shop stool with backrest craftsman shop stool shop stool with backrest medium size of interesting shop stools with backrest pictures swivel shop stool with backrest.
shop stool with backrest shop stool with backrest shop stool shop stool shop stool bar stool man cave bar accessories ultra cushioned swivel shop stool with deluxe backrest 2 pack.


text:
Culture - Civilization
By Continents
FOR NEW BLOG ENTRIES
for "Women make history"
is responsible Angelika Klatte
Wie einloggen?
So funktioniert Jimdo
Design-Tipps
The content on the domain www.Women-make-history.jimdo.com is operated by and responsible in terms of § 55 I RStV - Angelika Klatte: info@humanista.de
The information accessible on the Web Page Posts are for general information and do not constitute advice in specific cases. We endeavor to ensure the accuracy and timeliness of all information and data contained on the website according to § 7 paragraph 1 of TMG. No liability is accepted pursuant to § § 8 to 10 TMG for the accuracy, completeness, timeliness or quality of the information and data provided. The liability for the content of the available information is excluded if it is not intentional or grossly negligent false information. Obligations to remove or block the use of information under the general laws remain unaffected. However, liability is only possible from the date of knowledge of a specific infringement. Upon notification of such violations, we will remove the content immediately.
We are for the content of websites that can be accessed through a hyperlink not responsible. Are solely responsible for the content of linked pages. We make the contents of this website expressly disclaims responsibility for, and can therefore provide no guarantee for the correctness, completeness and availability. We have in the first link was checked the external content to establish whether a possible civil or criminal responsibility by him. But we are not obliged to constantly check the content to which we refer our offer on changes that could give rise to liability. Only when we discover or are informed by others that a concrete offer to which we have provided a link to civil or criminal liability, we will remove the link to this site, where this is technically possible and reasonable.
The content and works provided on these Web pages created by the owner of this site is subject to German copyright law. All third-party contributions are marked as such. Duplication, processing, distribution and any kind of exploitation outside the limits of copyright require the written consent of the respective author or creator. Copies of these pages are only permitted for private use but not for commercial purposes.
Use of our website is usually possible without providing personal information. As far as on our sides personal data (eg name, address or email address), this is as far as possible on a voluntary basis. These data are not without your express consent.In connection with your access data are stored in our servers for data security purposes temporarily, which may allow identification (eg IP address, date, time and name of the file requested). An evaluation, except for statistical purposes in anonymized form, is not.If you order information material from us, we need your name, email address and information on delivery and invoicing. So we can process and fulfill your order. This data is stored for the duration of the order processing in electronic form. A further use of personal data or passed on to third parties without your express consent.By ordering, you consent to the above processing of your personal data to the extent necessary for the purpose of the contract. You may cancel by e-mail to us at any time with effect for the future of this consent in writing or.
Privacy Policy for Usage of Facebook-Plugins (Like-Button)
On our pages, plugins of the social network Facebook, 1601 South California Avenue, Palo Alto, CA 94304, USA are integrated. The Facebook plugin, you agree to the Facebook logo or the "Like-Button" ("Like") on our side. You will find an overview of Facebook-plugins here: http://developers.facebook.com/docs/plugins/. When visiting our pages, the plugin establishes a connection between your browser and the Facebook server is established. Facebook receives the information that you have with your IP address visited our site.If you click on the Facebook "Like" button while you are logged into your Facebook account, you can link the content of our pages on your Facebook profile. Thereby Facebook can correlate your visit of our site with your user account. We point out that we as providers of the sites no knowledge of the content of the transmitted data and use them through Facebook. For more information, please see the privacy statement of facebook under http://de-de.facebook.com/policy.php If you do not wish that Facebook can assign to visit our pages to your Facebook user account, please log out of your Facebook user account.
Privacy Statement for the Use of Twitter
Functions of the Twitter service are integrated on our website. These functions are offered by Twitter Inc., 795 Folsom St., Suite 600, San Francisco, CA 94107, USA. Through the use of Twitter and function of "re-tweet" the web pages you visit will be linked to your Twitter account and made known to other users. This data is also transmitted to Twitter.We point out that we as providers of the sites no knowledge of the content of the transmitted data and use them through Twitter. For more information, please see the privacy statement of Twitter at http://twitter.com/privacy.Your privacy preferences at Twitter, you can change the account settings under http://twitter.com/account/settings.
Privacy Statement for using Google +1
Collection and dissemination of information:The Google +1 button allows you to publish information worldwide. About the Google +1 button to receive personalized content and other users of Google and our partners. Google will store both the information that you have given for a content +1, as well as information about the page that you viewed when you click on +1. Your +1' s can be shown as evidence along with your name and profile photo in Google services, such as in search results or in your Google profile, or elsewhere on websites and ads on the Internet. Google records information about your +1- activities to improve Google's services for you and others.In order to use the Google +1 button, you need a visible world, Google's public profile that must contain at least the chosen name for the profile. This name is used in all Google services. In some cases, this name can also substitute any other name that you used when sharing content under your Google Account. The identity of your Google profile may be shown to users who know your e-mail address, or have any other identifying information from you.Using the information collected:In addition to the above uses, the information you provide in accordance with the applicable Google privacy policy will be used. Google may release aggregate statistics on the activities of the user or +1- these findings to users and partners, such as publishers, advertisers or linked sites.
Privacy Statement for using Google Adsense
This website uses Google AdSense, a service for including advertisements from Google Inc. ("Google"). Google AdSense uses "cookies", text files that are stored on your computer, to analyze the use of the site allows. Google AdSense uses so called web beacons (invisible images). Through these web beacons may be evaluated as the visitor traffic on these sites. The information generated by cookies and web beacons on this website (including your IP address) and delivery of advertising formats are transmitted to a Google server in the USA and stored there.This information can be passed from Google to contractors of Google. Google will not associate your IP address with any other data held by you. You may refuse the use of cookies by selecting the appropriate settings on your browser, but we point out that you may not be able to use all features of this website in this case. By using this site, you agree to the processing of data about you by Google in the manner described above and for the aforementioned purpose.
Privacy Statement for using Google Analytics
This website uses Google Analytics, a web analytics service provided by Google Inc. ("Google"). Google Analytics uses "cookies", text files that are stored on your computer, to help the website analyze how users use the website. The information generated by the cookie about your use of this website is usually transmitted to a Google server in the USA and stored there.In the case of activation of the IP anonymization on this website, your IP address will be truncated within Member States of the European Union or other parties to the Agreement on the European Economic Area. Only in exceptional cases is the complete IP address transmitted to a Google server in the USA and shortened there. On behalf of the operator of this website, Google will use this information to evaluate your use of the website, compiling reports on website activity and providing them other with website and internet related services to the site operator to erbringenDie under Google Analytics from your browser IP address is not associated with any other data held by Google.You may refuse the use of cookies by selecting the appropriate settings on your browser, we would point out, however, that you can optionally use to their full extent in this case not all features of this website. You can also prevent the data generated by the cookie about your use of the website (including your IP address) to Google and the processing of these data by Google, by downloading available at the following link browser plugin and install http://tools.google.com/dlpage/gaoptout?hl=de.
This site was created with Jimdo!
Anyone can make their own website with Jimdo -- easily and for free! Choose templates, click to customize, add content in just seconds. It's that simple!
Sign up for your own free website at www.jimdo.com and get started right away.


Today, there are hundreds of thousands of Value Added Resellers (VARs) and even more Managed Service Providers (MSPs) competing for marketing share. Chances are, you know what a VAR is. These companies resell computer software, hardware and/or networking products. They fill gaps that direct sales teams typically can't to provide as much added value to the customer as possible (hence, the name).
Your local computer or iPhone repair shop is in many ways a VAR; this business provides computing components that consumers want, or break-fix services when upgrades or repairs are needed. That time you cracked your laptop screen? Dropped your phone in a puddle of water? If you didn't take your device to a dedicated carrier or an Apple store, chances are you took it to some variation of a VAR.
Today's most successful VARs, however, tend to fly under the radar. Do a quick Google search for top ranked VARs and you'll find that you haven't heard of most—if any—of them. These companies do their jobs well though, with research estimating that only about 20,000-30,000 VARs are able to thrive amidst today's continually evolving market. The rest usually try their hand at becoming a Managed Service Provider (MSP).
In short, an MSP is a company that remotely manages a customer's IT infrastructure, typically under a subscription model. Instead of simply working to fulfill a customer's product or service, MSPs assume direct responsibility for and ownership of a customer's IT environment. These companies specialize in remotely managing everything from web hosting to email to phone services, acquired through trusted wholesale providers. With research showing that overall spending on managed services is expected to reach $242 billion by 2021—a CAGR of 10.8 percent from 2016—many VARs today are working to strategically transition into the MSP space to increase profits and more dynamically compete.
For more information on how to add VoIP to your MSP, download our new Whitepaper!


This is the first in a series of posts I'm doing this holiday season for Wii U - our first ever "family" gaming system, something we've been slowly drifting toward since Hal procured an iPad last Christmas and Archer started begging to go to "friends houses" for undisclosed reasons, ahem. As you may know, I am the worst kind of planner so for our first annual family-in-town-for-the-holidays-game-night I let the kids take control of the thing.
I don't remember the last time they were this excited about something which makes it a lot easier to hand them the reins. They've been begging for a gaming system since The Cold War and I've been putting it off pretty much every day since.
Full disclosure, I have not played a video game of any kind since I was thirteen playing Street Fighter at the local pizza joint. We had Nintendo when I was a pup, but that was a generation ago. Anyway, the deal was this: no violent games (and yes, I am being a hypocrite because I used to rule at Mortal Combat) and we will be choosing games to play TOGETHER in the living room and these games will not include violence because that is just how I roll and don't even try to change my mind, it's my thing.
SO. Nintendoland non-violent family game night, it is!
What started as game night with the family and just my parents has taken on a kind of life of its own. My sister will be in town and Hal's friends will be joining us and we're pretty much inviting everyone we know at this point which means I've had no idea what to make or what to buy or how to organize AKA I totally gave up and let the kids (who are literally jumping up and down excited over this action) take over. Twist my arm, why don't you.
I also thought it would be fun to let the kids do the decorating. So? We rocked some dollar store action.
ED: the dollar store is an incredible place to take kids to teach them about money and math. It's the only place I can think of where you can give a four year old a budget she can grasp. Ish.
The kids picked out tickets and confetti, silly straws and centerpieces, wigs, hats, glow sticks, party favors, more confetti, paper plates, napkins and more confetti.
1. You HAVE to wear a wig or a a hat when you're playing a game.
2. If you win a game you get sixteen tickets and if you lose you get three tickets and at the end of the night whoever has the most tickets gets ALL of the hats and also some pinball thingy party favors.
3. Glow sticks are for everybody except the babies because they will try to eat them.
4. Plates are for snacks and food.
5. Have fun and share.
I couldn't have planned this thing better myself. Not in a thousand years.
My ad network, Federated Media is sponsoring a pretty amazing sweepstakes to go along with this campaign. To participate? Pin your Family Game Night photos with a comment that links to this promotion. Prizes include a wiiU deluxe set and $5,000.00 to take your fam on vacation. For more information and/or to enter, go here. Good luck!
I used to rock at Mortal Combat too! I even beat my husband who has worked making video games for 15 years!


KORG Collection for Mac/Win does not support 32bit environments. Please use the KORG Legacy Collection series. Although these products are no longer fully supported, we will continue to support registration and licensing at KORG USER NET.


text:
1949: Traycho Kostov, Bulgarian purgee
On this date in 1949, leading Bulgarian communist Traycho (Traitcho, Traicho) Kostov was hanged in Sofia.
A journalist and agitator from way back, Kostov was a casualty of the postwar political chasm between east and west.
He'd been the number three man in Bulgaria's communist hierarchy at the time of his fall in January of 1949, but had also been considered close to Yugoslavia's independent socialist leader Josip Broz Tito. Like Tito, Kostov was a little too into his own country's national economic sovereignty as against the purported greater good of a Soviet-dominated eastern bloc.
Stalin had overtly split with Tito in 1948. Over the next few years, Soviet satellites in eastern Europe would systematically eliminate perceived Titoist elements — and submit to economic integration on Moscow's terms.
So a propagandist could write, comparing Kostov to the Hungarian minister who had swung for Titoism just weeks before, that
[i]f Laszlo Rajk could be regarded as the right arm of Tito's plans for Eastern Europe, Traicho Kostov, member of the Bulgarian Politburo and Deputy Premier, was certainly his left arm. I sat in a crowded court in Sofia in December, 1949, heard and watched Traicho Kostov and ten other accused and dozens of witnesses testify to a Yugoslav plan for Bulgaria every whit as diabolical and bloodthirsty as that for Hungary. In reality there was only one overall strategic plan with "Operation Rajk" and "Operation Kostov" as tactical moves.
Specifically, "Operation Kostov" entailed spying for western (plus Yugoslavian) powers and plotting to overthrow the People's Republic.
Although his enemies had browbeaten Kostov into political self-denunciation at party summits, the man stoutly repudiated guilt at trial — which was not necessarily the norm in the show trial genre.
Kostov's ten fellow defendants received prison terms rather than the rope, and some of them were alive to enjoy the official rehabilitation that followed Stalin's death.
1709: Thomas Smith, Aaron Jones, Joseph Wells, and John Long - 2019
2010: John David Duty, the first pentobarbital execution in the U.S. - 2018
1859: Four of John Brown's Raiders - 2017
1946: Sulaiman Murshid, Alawite prophet - 2016
1897: John Morgan, the last public hanging in West Virginia - 2015
1937: Titsian Tabidze, poet - 2014
1794: Jean-Baptiste Carrier, of the Noyades de Nantes - 2013
1678: Stephen Arrowsmith - 2012
Themed Set: Tyburn on the cusp of the Bloody Code - 2012
1952: Lennie Jackson and Steve Suchan, of the Boyd Gang - 2010
1520: Hemming Gadh - 2009
1943: Elfriede Scholz, Erich Maria Remarque's sister - 2008
1594: Alison Balfour - 2007
1950: The Leningrad Affair "culprits"
1940: Robert Indrikovich Eikhe, "believing in the truth of Party policy as I have believed in it during my whole life"
Entry Filed under: 20th Century,Bulgaria,Capital Punishment,Death Penalty,Espionage,Execution,Hanged,History,Politicians,Posthumous Exonerations,Power,Russia,Torture,Treason,USSR,Wrongful Executions
Tags: 1940s, 1949, cold war, comecon, communism, communists, december 16, geopolitics, josip tito, purge, show trial, sofia, traicho kostov, traycho kostov, wrongful confessions


text:
/* tslint:disable:member-ordering */
// #docplaster
import { Component, Input, OnInit } from '@angular/core';
import { ActivatedRoute, Router }   from '@angular/router';
import 'rxjs/add/operator/map';

import { Hero }              from '../model';
import { HeroDetailService } from './hero-detail.service';

// #docregion prototype
@Component({
  moduleId: module.id,
  selector:    'app-hero-detail',
  templateUrl: './hero-detail.component.html',
  styleUrls:  ['./hero-detail.component.css' ],
  providers:  [ HeroDetailService ]
})
export class HeroDetailComponent implements OnInit {
  // #docregion ctor
  constructor(
    private heroDetailService: HeroDetailService,
    private route:  ActivatedRoute,
    private router: Router) {
  }
  // #enddocregion ctor
// #enddocregion prototype

  @Input() hero: Hero;

  // #docregion ng-on-init
  ngOnInit(): void {
    // get hero when `id` param changes
    this.route.params.subscribe(p => this.getHero(p && p['id']));
  }
  // #enddocregion ng-on-init

  private getHero(id: string): void {
    // when no id or id===0, create new hero
    if (!id) {
      this.hero = new Hero();
      return;
    }

    this.heroDetailService.getHero(id).then(hero => {
      if (hero) {
        this.hero = hero;
      } else {
        this.gotoList(); // id not found; navigate to list
      }
    });
  }

  save(): void {
    this.heroDetailService.saveHero(this.hero).then(() => this.gotoList());
  }

  cancel() { this.gotoList(); }

  gotoList() {
    this.router.navigate(['../'], {relativeTo: this.route});
  }
// #docregion prototype
}
// #enddocregion prototype