Search

The article focuses on the history of paper bag cookery. In 1911, chefs in Great Britain and America used paper bags to bake fishes. The art of paper-bag cookery was started in 1896 by Nicolas Soyer, a chef. In July 1911, Soyer released his new cookbook, "Paper-Bag Cookery." According to Soyer, the key to success in paper bag cookery was not just the paper, it was the bag. Explosions could be prevented if the paper container was strong. Soyer used a paper bag with the opening folded over several times. The paper bag was secured with metal clips.

The article presents several sampling of websites for historical paper ephemera. These include The Art of American Advertising, 1865-1910 and Center for Popular Music for Library Collections, T209-Contentnea Cards, 1909-1910 and The John and Carolyn Grossman Collection for nonlibrary collections and Centre for Ephemera Studies and Ephemera Society of America for organizations.

The article reviews the Web site State Papers Online: Eighteenth Century, 1714-1782; Part IV: State Papers, Foreign, Scandinavia, Eastern Europe and Turkey, from publisher Gale Cengage, located at https://www.gale.com/c/state-papersonline-eighteenth-century-part-iv.

Presents an essay on the fading paper mill industry in Holyoke, Massachusetts. World-class supplier of fine writing papers in the mid-nineteenth century; Raymond Beaudry, president of the paper makers union; Mills supplying jobs for newly arrived immigrants; Skill of Holyoke machine tenders; Brief history of Holyoke's paper industry.

The article discusses the role that necessity played in the invention of paperweights from the late 19th century through the 1950s in the U.S., including the electrical engineer Charles P. Steinmetz's use of ad-hoc paperweights throughout his career. An overview of various items used to hold down paper, including rounded stones and horseshoes, is provided.

The article discusses a paper presented at the Chilembwe Revisited Symposium, held at the Edinburgh University in Scotland on February 7, 2015, that talks about the life and death of Baptist pastor John Chilembwe. Topics discussed include details of Chilembwe's birth and family including a putative daughter Sylvia, his travel to the U.S. in 1897 to obtain a western education, and his role in the Chilembwe Rebellion of 1915.

Michael Haneke’s complex and layered work centres in many aspects on the problematic European (but also human) history analysing it skilfully at the micro level of close-knit primary communities such as family. Loss of language, obsession with images, anxiety, fragmented and mediatized reality, decay of communication are all just the symptoms of a trauma that appear simultaneously in Haneke’s films, very often as the backbone of the entire work. This paper interprets the traumatic disorder and its accompanying characteristics within the framework of Haneke’s work, with the aim of providing a deep dive into the criticism of the colonialist, nationalist and generally problematic history of the developed West and the impossibility of narrativizing it, but also contemporary society that lies on those contentions foundations. [ABSTRACT FROM AUTHOR]

Presents information about the history of paper money, in light of the introduction of euro notes and coins on January 1, 2002. Prediction that the release of the money will cause problems such as long lines, confusion, exploitation of consumers, and forgery; Ways the European Central Bank will protect against forgery; Idea that forgery is become easier through technology.

The article explores the history of voting and election ballots in the U.S. Topics explored include paper ballots, universal suffrage, secret voting, and the role of political parties in supplying ballots. The author reflects on Australian election reform that was incorporated in the U.S. to enable private voting in booths. Other topics include election officials, voter turnout, and technology and voting.

The article discusses software engineering in which software is used to develop software. Compilers convert a text form of instructions into machine instructions executable by a machine, the author states. Topics include integrated development environments (IDEs) which are mostly word processors with specific look-up processes, what the act of putting knowledge onto pieces of paper does to the knowledge itself, and computer-aided software engineering (CASE) tools used to store knowledge in a variety of formats including tables.

We present our approach for overcoming the cost, operational complexity, and limited scale endemic to datacenter networks a decade ago. Three themes unify the five generations of datacenter networks detailed in this paper. First, multi-stage Clos topologies built from commodity switch silicon can support cost-effective deployment of buildingscale networks. Second, much of the general, but complex, decentralized network routing and management protocols supporting arbitrary deployment scenarios were overkill for single-operator, pre-planned datacenter networks. We built a centralized control mechanism based on a global configuration pushed to all datacenter switches. Third, modular hardware design coupled with simple, robust software allowed our design to also support inter-cluster and wide-area networks. Our datacenter networks run at dozens of sites across the planet, scaling in capacity by 100x over 10 years to more than 1 Pbps of bisection bandwidth. A more detailed version of this paper is available at Ref. [ABSTRACT FROM AUTHOR]

The article reviews the website database "The Making of Modern Law: American Civil Liberties Union Papers, 1912-1990" from the Gale firm Cengage Learning, located at http://www.gale.com/moml-aclu-papers.

We consider an environmentwhere players need to decide whether to buy a certain product (or adopt a technology) or not. The product is either good or bad, but its true value is unknown to the players. Instead, each player has her own private information on its quality. Each player can observe the previous actions of other players and estimate the quality of the product. A classic result in the literature shows that in similar settings, informational cascades occur, where learning stops for the whole network and players repeat the actions of their predecessors. In contrast to this literature, in this paper, players get more than one opportunity to act. In each turn, a player is chosen uniformly at random from all the players and can decide to buy the product and leave the market or wait. Her utility is the total expected discounted reward, and thus, myopic strategies may not constitute equilibria. We provide a characterization of perfect Bayesian equilibria (PBEs) with forward-looking strategies through a fixed-point equation of dimensionality that grows only quadratically with the number of players. Using this tractable fixed-point equation, we show the existence of a PBE and characterize PBEs with threshold strategies. Based on this characterization, we study informational cascades in two regimes. First, we show that for a discount factor $\delta$ strictly smaller than 1, informational cascades happen with high probability as the number of players $N$ increases. Furthermore, only a small portion of the total information in the system is revealed before a cascade occurs. Second, and more surprisingly, we show that for a fixed $N$ , and for a sufficiently large $\delta < 1$ , when the product is bad, there exists an equilibrium where an informational cascade can happen only after at least half of the players revealed their private information, and consequently, the probability for a “bad cascade” where all the players buy the product vanishes exponentially with $N$. Finally, when $\delta =1$ and the product is bad, there exists an equilibrium where informational cascades do not happen at all. [ABSTRACT FROM AUTHOR]

Relatively little literature specific to the discipline of History aims to translate theory into practice in regard to designing effective online and flipped learning experiences. This article synthesises current literature into practical advice and reflects on previous experience as an aid to historians (a) tasked with developing online or flipped units or (b) who have transitioned online and are seeking ways to improve. Feedback from students and learning analytics from a flipped unit at a large Australian university underpin the paper's advice. Student feedback and behaviour, coupled with the reflections of the unit's designers, encourage (1) prioritising effective educational media and recording practices over the production of digital material with the longest shelf life, (2) explicit consideration of unit structure and support offered to students, (3) readings which consider the student perspective, (4) enthusiasm about the delivery format, and (5) the overarching importance of constructive alignment. [ABSTRACT FROM AUTHOR]

The article discusses the history of the Bank of Montreal and the bank's influence on Canada's financial and economic history. It looks at how the Bank of Montreal was the first to introduce paper banknotes in Canada in 1817 and how it changed the country's financial system. Particular attention is also given to Edwin Henry King, who became president of the bank in 1869 and was known for his contributions to the business aspects of banking.

The article offers information on history of invention of paper and its uses.

The article discusses Powerview-Pine Falls, Manitoba, particularly examining the impact of the 2009 closure of the town's Tembec Inc. newspaper mill. It comments on companies previously based in the town, including Manitoba Pulp and Paper Company and Abitibi Power and Paper Company. The author reflects on unemployment and depopulation as results of deindustrialization.

The article discusses the profile of two Baseball legends Jackie Robinson and Branch Rickey who created history in their own ways.

The article discusses British novelist Martin Amis as of July 2012, focusing on his book "Lionel Asbo: State of England," as well as Amis' fascination with U.S. politics and cultural excesses. Amis' first novel "The Rachel Papers" is also mentioned, along with his relationship with fellow author Christopher Hitchens.

This paper studies the optimal decentralized state-feedback control of large-scale systems. The large-scale system is composed of subsystems and defined over a connected digraph. One step time is required for information to travel across an edge in the graph. Under the above-mentioned setup, when subsystem process noises are uncorrelated, the explicit optimal state-feedback controller can be designed by independence decomposition based on information hierarchy graph. However, this decomposition method fails when the subsystem process noises are correlated. In this paper, we propose a new decomposition method for system state and control input, and split the optimal state-feedback control problem with correlated process noises into two subproblems that can be solved separately. The solution to the first subproblem can be obtained by solving a linear matrix equation. The second subproblem is solved by algebraic Ricatti equation. [ABSTRACT FROM AUTHOR]

This paper studies two-player zero-sum repeated Bayesian games in which every player has a private type that is unknown to the other player, and the initial probability of the type of every player is publicly known. The types of players are independently chosen according to the initial probabilities, and are kept the same all through the game. At every stage, players simultaneously choose actions, and announce their actions publicly. For finite horizon cases, an explicit linear program is provided to compute players’ security strategies. Moreover, this paper shows that a player's sufficient statistics, which is independent of the strategy of the other player, consists of the belief over the player's own type, the regret over the other player's type, and the stage. Explicit linear programs, whose size is linear in the size of the game tree, are provided to compute the initial regrets, and the security strategies that only depends on the sufficient statistics. For discounted cases, following the same idea in the finite horizon, this paper shows that a player's sufficient statistics consists of the belief of the player's own type and the antidiscounted regret with respect to the other player's type. Besides, an approximated security strategy depending on the sufficient statistics is provided, and an explicit linear program to compute the approximated security strategy is given. This paper also obtains a bound on the performance difference between the approximated security strategy and the security strategy, and shows that the bound converges to 0 exponentially fast. [ABSTRACT FROM AUTHOR]

In this paper, the robustness to model mismatch of a preexisting collocated boundary adaptive feedback law is investigated. This control law was originally designed for an antidamped pure wave partial differential equation (PDE). Actuation and measurements are located at the same boundary. Adaptive terms account for uncertain parameters located at the antidamped boundary, opposite to the collocated actuation and measurement. By extending and transforming the system state using, in particular, backstepping, this paper establishes that this controller is robust to sufficiently small in-domain damping. In particular, both stability and attractivity (convergence) are established similarly as in the nominal case. Note moreover that, assuming that some parameters are known, the exponential stability to an attractor holds. Simulations are performed to illustrate the interest of this study to attenuate mechanical vibrations in an oil-drilling context. [ABSTRACT FROM AUTHOR]

This paper introduces an explicit reference governor to supervise closed-loop linear time-delay systems. The proposed scheme enforces state and input constraints by modifying the reference of the supervised system so that the state vector always belongs to admissible sublevel sets of a suitably defined Lyapunov–Krasovskii functional. To accomplish this, this paper extends the existing definition of “dynamic safety margin” to a time-delay setting and illustrates how to employ classic Lyapunov–Krasovskii functionals even though the reference is time varying. Constraint enforcement for arbitrary reference signals and asymptotic convergence to any strictly steady-state admissible set point is rigorously proven. Experimental results are reported to demonstrate the simplicity, practicality, and robustness of the proposed method. [ABSTRACT FROM AUTHOR]

Takes a look at the history of the invention of paper currency. John Palmstruch and the founding of the Stockholm Banco that issued bank notes in Sweden; Methods used to verify validity of the currency; Failure of the bank notes that become overvalued and the fate of Palmstruch; John Law and his patronage from the Banque Royale in France; The issue of credibility of paper currency; History of the growing use of paper to avoid metal as currency; Inflation.

The article looks at issues in the history of computing and computer science. The author assesses computer scientist Donald Knuth's criticisms of historiographic trends in the history of computer science, particularly as described by computer scientist Martin Campbell-Kelly in a 2007 paper entitled "The History of the History of Software." Topics include computer scientists versus historians as researchers on the history of computing.

An interview with former U.S. military analyst Daniel Ellsberg is presented. When asked about his view of World War II as a justified war, Ellsberg refers to the defeat of Hitler as an important part of the war but dislikes certain tactics used by the Allied Forces during the war. He focuses on the justification of violent tactics against enemy attacks, his book 'The Doomsday Machine: Confessions of a Nuclear War Planner', and the Pentagon Paper Leak in 1971.

In this paper, we apply Thompson sampling to a class of average reward stochastic control problems with parameter uncertainty. Specifically, we study an average reward stochastic control problem over an infinite horizon in which both the reward and state transition distributions are parameterized by an unknown parameter taking values in a finite space. The main result of this paper is a proof showing that Thompson sampling achieves a worst case average per period regret of O(T^-1), which is asymptotically optimal. [ABSTRACT FROM PUBLISHER]

Zero-sum asymmetric information games model decision-making scenarios involving two competing players who have different information about the game being played. A particular case is that of nested information, where one (informed) player has superior information over the other (uninformed) player. This paper considers the case of nested information in repeated zero-sum games and studies the computation of strategies for both the informed and uninformed players for finite-horizon and discounted infinite-horizon nested information games. For finite-horizon settings, we exploit that for both players, the security strategy, and also the opponent's corresponding best response, depend only on the informed player's history of actions. Using this property, we formulate an linear program (LP) computation of player strategies that is linear in the size of the uninformed player's action set. For the infinite-horizon discounted game, we construct LP formulations to compute the approximated security strategies for both players, and show that the worst-case performance difference between the approximated security strategies and the security strategies converges to zero exponentially. Finally, we illustrate the results on a network interdiction game between an informed system administrator and an uniformed intruder. [ABSTRACT FROM AUTHOR]