text:
Many Americans have recently gotten raises. But the bigger paychecks are an illusion
By Stacey Vanek Smith
Published September 23, 2022 at 6:57 AM EDT
Donna Dunn
Donna Dunn, 49, works as the office manager at a healthcare clinic in Booker, Texas. Despite getting a raise, she has struggled to pay her family's bills as prices have risen faster than her paycheck.
In the last year, 61% of U,S, workers have gotten a raise in the last year according to a new NPR/PBS Newshour/Marist poll. But that doesn't necessarily mean all people's financial situations have gotten better.
Take Donna Dunn, 49, of Booker, Texas.
"We're really in the middle of nowhere," she said of her town, where she is the office manager of a healthcare clinic.
Dunn gets a 3% cost of living raise every year, but the actual cost of living has been rising a lot faster than that. Recent data shows inflation is running nearly three times that rate, at 8.3%.
When people see their wages go up, but prices are rising faster, economists call it 'the money illusion.' Paychecks might look bigger, but it's an illusion. Simple math shows you are getting paid less.
In fact, if you adjust for inflation, U.S. workers have gotten one of the biggest pay cuts on record over the last year.
This was not surprising to Dunn, who has has five kids, a tight budget and has developed an encyclopedic knowledge of food prices.
"I used to be able to get a dozen eggs for $2.69. That exact same dozen eggs just today was $4.89," she said. "The large boxes of Hot pockets, the 36 count box, used to be $8.99. Now that same exact box–and it only has 24 in it–is $13.90."
To try and deal with the rising prices, Dunn made swaps: pork instead of beef, PB&J instead of deli sandwiches and no more eating out. Even then, her family food bill went from around $700 a month to more than $1,600 and Donna was drowning. She's reluctantly choosing which bills to pay, and not pay.
Her employer offered raises to help with inflation, but the money wasn't enough. More than a third of those polled said their finances had gotten worse in the last year and an increasing number report falling behind on bills.
Dunn has found some workarounds. Actually, she's grown them in her vegetable garden and on her mom's farm.
"I'm on a trade system with one of the other farmers," she said. "She has chickens and brings me the eggs and I give her tomatoes and zucchini and cucumbers."
One way around the money illusion? Don't use money.
Stacey Vanek Smith
Stacey Vanek Smith is the co-host of NPR's The Indicator from Planet Money. She's also a correspondent for Planet Money, where she covers business and economics. In this role, Smith has followed economic stories down the muddy back roads of Oklahoma to buy 100 barrels of oil; she's traveled to Pune, India, to track down the man who pitched the country's dramatic currency devaluation to the prime minister; and she's spoken with a North Korean woman who made a small fortune smuggling artificial sweetener in from China.


text:
D-Wave Publications
D-Wave White Papers
Third Party Publications
Selected Papers
Observation of topological phenomena in a programmable lattice of 1,800 qubits
Andrew King et. al
The work of Berezinskii, Kosterlitz and Thouless in the 1970s revealed exotic phases of matter governed by the topological properties of low-dimensional materials such as thin films of superfluids and superconductors. A hallmark of this phenomenon is the appearance and interaction of vortices and antivortices in an angular degree of freedom—typified by the classical XY model—owing to thermal fluctuations. In the two-dimensional Ising model this angular degree of freedom is absent in the classical case, but with the addition of a transverse field it can emerge from the interplay between frustration and quantum fluctuations. Consequently, a Kosterlitz–Thouless phase transition has been predicted in the quantum system—the two-dimensional transverse-field Ising model—by theory and simulation. Here we demonstrate a large- scale quantum simulation of this phenomenon in a network of 1,800 in situ programmable superconducting niobium flux qubits whose pairwise couplings are arranged in a fully frustrated square-octagonal lattice. Essential to the critical behaviour, we observe the emergence of a complex order parameter with continuous rotational symmetry, and the onset of quasi-long-range order as the system approaches a critical temperature. We describe and use a simple approach to statistical estimation with an annealing-based quantum processor that performs Monte Carlo sampling in a chain of reverse quantum annealing protocols. Observations are consistent with classical simulations across a range of Hamiltonian parameters. We anticipate that our approach of using a quantum processor as a programmable magnetic lattice will find widespread use in the simulation and development of exotic materials.
(22 Aug 2018) Nature (Vol. 560, Issue 7719, August 22, 2018)
Read the Synopsis See arXiv: https://arxiv.org/abs/1803.02047
Phase transitions in a programmable quantum spin glass simulator
R. Harris et. al
Understanding magnetic phases in quantum mechanical systems is one of the essential goals in condensed matter physics, and the advent of prototype quantum simulation hardware has provided new tools for experimentally probing such systems. We report on the experimental realization of a quantum simulation of interacting Ising spins on three-dimensional cubic lattices up to dimensions 8 × 8 × 8 on a D-Wave processor (D-Wave Systems, Burnaby, Canada). The ability to control and read out the state of individual spins provides direct access to several order parameters, which we used to determine the lattice's magnetic phases as well as critical disorder and one of its universal exponents. By tuning the degree of disorder and effective transverse magnetic field, we observed phase transitions between a paramagnetic, an antiferromagnetic, and a spin-glass phase.
(13 Jul 2018) Science Vol. 361, Issue 6398, pp. 162-165
DOI: 10.1126/science.aat2025
Quantum Variational Autoencoder
Amir Khoshaman, Walter Vinci, Brandon Denis, Evgeny Andriyash,and Mohammad H. Amin
Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximizing a well-defined loss-function: a "quantum" lower- bound to a variational approximation of the log-likelihood. We use quantum Monte Carlo (QMC) simulations to train and evaluate the performance of QVAEs. To achieve the best performance, we first create a VAE platform with discrete latent space generated by a restricted Boltzmann machine (RBM). Our model achieves state-of-the-art performance on the MNIST dataset when compared against similar approaches that only involve discrete variables in the generative process. We consider QVAEs with a smaller number of latent units to be able to perform QMC simulations, which are computationally expensive. We show that QVAEs can be trained effectively in regimes where quantum effects are relevant despite training via the quantum bound. Our findings open the way to the use of quantum computers to train QVAEs to achieve competitive performance for generative models. Placing a QBM in the latent space of a VAE leverages the full potential of current and next-generation quantum computers as sampling devices.
(22 Feb 2018) https://arxiv.org/pdf/1802.05779.pdf
Can quantum Monte Carlo simulate quantum annealing?
Evgeny Andriyash and Mohammad H. Amin
"Recent theoretical and experimental studies have suggested that quantum Monte Carlo (QMC) simulation can behave similarly to quantum annealing (QA)...Here, we compare incoherent tunneling and QMC escape using perturbation theory, which has much wider validity than WKB approximation. We show that the two do not scale the same way when there are multiple homotopy-inequivalent paths for tunneling. We demonstrate through examples that frustration can generate an exponential number of tunneling paths, which under certain conditions can lead to an exponential advantage for incoherent tunneling over classical QMC escape. We provide analytical and numerical evidence for such an advantage and show that it holds beyond perturbation theory."
(27 Mar 2017) Link to PDF.
Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines
Dmytro Korenkevych, Yanbo Xue, Zhengbing Bian, Fabian Chudak, William G. Macready, Jason Rolfe, Evgeny Andriyash
"Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. For many classes of problems, QA is known to offer computational advantages over simulated annealing. Here we report on the ability of recent QA hardware to accelerate training of fully visible Boltzmann machines."
(14 Nov 2016) https://arxiv.org/abs/1611.04528
Discrete Variational Autoencoders
Jason Tyler Rolfe
"Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since back propagation through discrete variables is generally not possible. We introduce a novel class of probabilistic models, comprising an undirected discrete component and a directed hierarchical continuous component, that can be trained efficiently using the variational autoencoder framework. The discrete component captures the distribution over the disconnected smooth manifolds induced by the continuous component. As a result, this class of models efficiently learns both the class of objects in an image, and their specific realization in pixels, from unsupervised data; and outperforms state-of-the-art methods on the permutation-invariant MNIST, OMNIGLOT, and Caltech-101 Silhouettes datasets."
(7 Sep 2016) http://arxiv.org/abs/1609.02200
Degeneracy, degree, and heavy tails in quantum annealing
Andrew D. King, Emile Hoskinson, Trevor Lanting, Evgeny Andriyash, Mohammad H. Amin
"Both simulated quantum annealing and physical quantum annealing have shown the emergence of "heavy tails" in their performance as optimizers: The total time needed to solve a set of random input instances is dominated by a small number of very hard instances…On similar inputs designed to suppress local degeneracy, performance of a quantum annealing processor on hard instances improves by orders of magnitude at the 512-qubit scale, while classical performance remains relatively unchanged."
(23 Dec 2015) Link to PDF.
Constructing SAT Filters with a Quantum Annealer
Adam Douglass, Andrew D. King, Jack Raymond
"Presented here is a case study of SAT filter construction with a focus on constraint satisfaction problems based on MAX-CUT clauses (Not-all-equal 3-SAT, 2-in-4-SAT, etc.) and frustrated cycles in the Ising model... Solutions are sampled using a D-Wave quantum annealer, and results are measured against classical approaches."
( 27 Oct 2015) http://link.springer.com/chapter/10.1007%2F978-3-319-24318-4_9
Benchmarking a quantum annealing processor with the time-to-target metric
James King, Sheir Yarkoni, Mayssam M. Nevisi, Jeremy P. Hilton, and Catherine C. McGeoch
In this paper we introduce the Time to Target (TTT) metric and compare the performance of the D-Wave 2X on a host of native hardware problems against highly optimized and tuned solvers.
(20 Aug, 2015) Link to PDF
Entanglement in a quantum annealing processor
T. Lanting et. al
In this paper we present experimental evidence that, during a critical portion of QA, qubits in the D-Wave processor become entangled and entanglement persists even as these systems reach equilibrium with a thermal environment. Our results provide an encouraging sign that quantum annealing is a viable technology for large-scale quantum computing.
Physical Review X (29 May 2014) https://journals.aps.org/prx/abstract/10.1103/PhysRevX.4.021041
Quantum-Assisted Genetic Algorithm
James King et al.
Genetic algorithms, which mimic evolutionary processes to solve optimization problems, can be enhanced by using powerful semi-local search algorithms as mutation operators. Here, we introduce reverse quantum annealing, a class of quantum evolutions that can be used for performing families of quasi-local or quasi-nonlocal search starting from a classical state, as novel sources of mutations. Reverse annealing enables the development of genetic algorithms that use quantum fluctuation for mutations and classical mechanisms for the crossovers—we refer to these as Quantum-Assisted Genetic Algorithms (QAGAs). We describe a QAGA and present experimental results using a D-Wave 2000Q quantum annealing processor. On a set of spin-glass inputs, standard (forward) quantum annealing finds good solutions very quickly but struggles to find global optima. In contrast, our QAGA proves effective at finding global optima for these inputs. This successful interplay of nonlocal classical and quantum fluctuations could provide a promising step toward practical applications of Noisy Intermediate-Scale Quantum (NISQ) devices for heuristic discrete optimization,
(2 July 2019) arXiv: https://arxiv.org/pdf/1907.00707.pdf
The Mathematics of Quantum-Enabled Applications on the D-Wave Quantum Computer
Jesse J. Berwald
This article covers quantum computing from the angle of adiabatic quantum computing [7,13], which has proven to have the shortest horizon to real-world applications, partly due to a slightly easier path to development2 than alternative approaches such as gate-model quantum computers. In this article we cover background on quantum annealing computing generally, the canonical problem formulation necessary to program the D-Wave quantum processing unit (QPU), and discuss how such a problem is compiled onto the QPU. We also cover recent joint work solving a problem from topological data analysis on the DWave quantum computer. The goal of the article is to cover the above from a mathematical viewpoint, accessible to a wide range of levels, and introduce as many people as possible to a small portion of the mathematics encountered in this industry.
(June/July 2019) Notices of the American Mathematical Society Vol. 66, No. 6, pp. 832-841
Link to PDF
Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
I. Ozfidan et. al
Quantum annealing (QA) is a heuristic algorithm for finding low-energy configurations of a system, with applications in optimization, machine learning, and quantum simulation. Up to now, all implementations of QA have been limited to qubits coupled via a single degree of freedom. This gives rise to a stoquastic Hamiltonian that has no sign problem in quantum Monte Carlo (QMC) simulations. In this paper, we report implementation and measurements of two superconducting flux qubits coupled via two canonically conjugate degrees of freedom (charge and flux) to achieve a nonstoquastic Hamiltonian. Such coupling can enhance performance of QA processors, extend the range of quantum simulations. We perform microwave spectroscopy to extract circuit parameters and show that the charge coupling manifests itself as a YY interaction in the computational basis. We observe destructive interference in quantum coherent oscillations between the computational basis states of the two-qubit system. Finally, we show that the extracted Hamiltonian is nonstoquastic over a wide range of parameters.
(14 Mar 2019) https://arxiv.org/abs/1903.06139
Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results
Zhengbing Bian, Fabian Chudak, William Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti
Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined over binary variables (qubits), also known as Ising problems. In the last decade, QA systems as implemented by D-Wave have scaled with Moore-like growth. Current architectures provide 2048 sparsely-connected qubits, and continued exponential growth is anticipated, together with increased connectivity.
We explore the feasibility of such architectures for solving SAT and MaxSAT problems as QA systems scale. We develop techniques for effectively encoding SAT –and, with some limitations, MaxSAT– into Ising problems compatible with sparse QA architectures. We provide the theoretical foundations for this mapping, and present encoding techniques that combine offline Satisfiability and Optimization Modulo Theories with on-the-fly placement and routing. Preliminary empirical tests on a current generation 2048-qubit D-Wave system support the feasibility of the approach for certain SAT and MaxSAT problems
(6 Nov 2018) https://arxiv.org/pdf/1811.02524.pdf
Theory of open quantum dynamics with hybrid noise
Anatoly Yu Smirnov and Mohammad H Amin
We develop a theory to describe dynamics of a non-stationary open quantum system interacting with a hybrid environment, which includes high-frequency and low-frequency noise components. One part of the system–bath interaction is treated in a perturbative manner, whereas the other part is considered exactly. This approach allows us to derive a set of master equations where the relaxation rates are expressed as convolutions of the Bloch–Redfield and Marcus formulas. Our theory enables analysis of systems that have extremely small energy gaps in the presence of a realistic environment. As an illustration, we apply the theory to the 16 qubit quantum annealing problem with dangling qubits (Dickson et al 2013 Nat. Commun. 4 1903) and show qualitative agreement with experimental results.
(26 Oct 2018) New Journal of Physics, Volume 20, October 2018
Computing Wasserstein Distance for Persistence Diagrams on a Quantum Computer
Jesse J. Berwald, Joel M. Gottlieb, Elizabeth Munch
Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a metric, the Wasserstein distance (closely related to but not the same as the homonymous metric from probability theory). Further, this metric provides a notion of stability; that is, small noise in the input causes at worst small differences in the output. In this paper, we show that the Wasserstein distance for persistence diagrams can be computed through quantum annealing. We provide a formulation of the problem as a Quadratic Unconstrained Binary Optimization problem, or QUBO, and prove correctness. Finally, we test our algorithm, exploring parameter choices and problem size capabilities, using a D-Wave 2000Q quantum annealing computer.
(2 Nov 2018) https://arxiv.org/abs/1809.06433
GumBolt: Extending Gumbel trick to Boltzmann priors
Amir H. Khoshaman, Mohammad H. Amin
Boltzmann machines (BMs) are appealing candidates for powerful priors in variational autoencoders (VAEs), as they are capable of capturing nontrivial and multi-modal distributions over discrete variables. However, indifferentiability of the discrete units prohibits using the reparameterization trick, essential for low-noise back propagation. The Gumbel trick resolves this problem in a consistent way by relaxing the variables and distributions, but it is incompatible with BM priors. Here, we propose the GumBolt, a model that extends the Gumbel trick to BM priors in VAEs. GumBolt is significantly simpler than the recently proposed methods with BM prior and outperforms them by a considerable margin. It achieves state-of-the-art performance on permutation invariant MNIST and OMNIGLOT datasets in the scope of models with only discrete latent variables. Moreover, the performance can be further improved by allowing multi-sampled (importance-weighted) estimation of log-likelihood in training, which was not possible with previous models.
(18 May 2018) https://arxiv.org/abs/1805.07349
DVAE#: Discrete Variational Autoencoders with Relaxed Boltzmann Priors
Arash Vahdat, Evgeny Andriyash, William G. Macready
Boltzmann machines are powerful distributions that have been shown to be an effective prior over binary latent variables in variational autoencoders (VAEs). However, previous methods for training discrete VAEs have used the evidence lower bound and not the tighter importance-weighted bound. We propose two approaches for relaxing Boltzmann machines to continuous distributions that permit training with importance-weighted bounds. These relaxations are based on generalized overlapping transformations and the Gaussian integral trick. Experiments on the MNIST and OMNIGLOT datasets show that these relaxations outperform previous discrete VAEs with Boltzmann priors.
Anatoly Yu. Smirnov, Mohammad H. Amin
We develop a theory to describe dynamics of a nonstationary open quantum system interacting with a hybrid environment, which includes high-frequency and low-frequency noise components. One part of the system-bath interaction is treated in a perturbative manner, whereas the other part is considered exactly. This approach allows us to derive a set of master equations where the relaxation rates are expressed as convolutions of the Bloch-Redfield and Marcus formulas. Our theory enables analysis of systems that have extremely small energy gaps in the presence of a realistic environment. We apply the theory to an example of the 16-qubit quantum annealing problem with dangling qubits and show qualitative agreement with experimental results.
(21 Feb 2018) https://arxiv.org/abs/1802.07715
Toward Robustness against Label Noise in Training Deep Discriminative Neural Networks
Arash Vahdat
Collecting large training datasets, annotated with high-quality labels, is costly and time-consuming. This paper proposes a novel framework for training deep convolutional neural networks from noisy labeled datasets that can be obtained cheaply. The problem is formulated using an undirected graphical model that represents the relationship between noisy and clean labels, trained in a semi-supervised setting. In our formulation, the inference over latent clean labels is tractable and is regularized during training using auxiliary sources of information. The proposed model is applied to the image labeling problem and is shown to be effective in labeling unseen images as well as reducing label noise in training on CIFAR-10 and MS COCO datasets.
(23 Feb 2018) Link to paper
DVAE++: Discrete Variational Autoencoders with Overlapping Transformations
Arash Vahdat, William G. Macready, Zhengbing Bian, Amir Khoshaman
Training of discrete latent variable models remains challenging because passing gradient information through discrete units is difficult. We propose a new class of smoothing transformations based on a mixture of two overlapping distributions, and show that the proposed transformation can be used for training binary latent models with either directed or undirected priors. We derive a new variational bound to efficiently train with Boltzmann machine priors. Using this bound, we develop DVAE++, a generative model with a global discrete prior and a hierarchy of convolutional continuous variables. Experiments on several benchmarks show that overlapping transformations outperform other recent continuous relaxations of discrete latent variables including Gumbel-Softmax (Maddison et al., 2016; Jang et al., 2016), and discrete variational autoencoders (Rolfe, 2016).
From Near to Eternity: Spin-glass planting, tiling puzzles, and constraint satisfaction problems
Firas Hamze (D-Wave); Darryl C. Jacob, Andrew J. Ochoa (Texas A&M University); Wenlong Wang (KTH Royal Institute of Technology,Texas A&M University); and Helmut G. Katzgraber (Texas A&M University, 1QBit Technologies)
We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model defined on a cubic lattice, where subproblems, whose couplers are restricted to the two values {-1,+1}, are specified on unit cubes and are parametrized by their local degeneracy. The construction is shown to be equivalent to a type of three-dimensional constraint satisfaction problem known as the tiling puzzle. By varying the proportions of subproblem types, the Hamiltonian can span a dramatic range of typical computational complexity, from fairly easy to many orders of magnitude more difficult than prototypical bimodal and Gaussian spin glasses in three space dimensions. We corroborate this behavior via experiments with different algorithms and discuss generalizations and extensions to different types of graphs.
(Nov 15, 2017) https://arxiv.org/abs/1711.04083
Collecting large training datasets, annotated with high-quality labels, is costly and time-consuming. This paper proposes a novel framework for training deep convolutional neural networks from noisy labeled datasets that can be obtained cheaply. The problem is formulated using an undirected graphical model that represents the relationship between noisy and clean labels, trained in a semi- supervised setting. In our formulation, the inference over latent clean labels is tractable and is regularized during training using auxiliary sources of information. The proposed model is applied to the image labeling problem and is shown to be effective in labeling unseen images as well as reducing label noise in training on CIFAR-10 and MS COCO datasets.
(03 Nov 2017) https://arxiv.org/pdf/1706.00038.pdf
Experimental demonstration of perturbative anticrossing mitigation using nonuniform driver Hamiltonians
Trevor Lanting, Andrew D. King, Bram Evert, and Emile Hoskinson
"Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transverse driver Hamiltonian is applied to each qubit. Previous theoretical research sought to alleviate such anticrossings by adjusting the transverse driver Hamiltonians on individual qubits according to a perturbative approximation. Here we apply this principle to a physical implementation of quantum annealing in a D-Wave 2000Q system. We use samples from the quantum annealing hardware and per-qubit anneal offsets to produce nonuniform driver Hamiltonians. On small instances with severe perturbative anticrossings, our algorithm yields an increase in minimum eigengaps, ground-state success probabilities, and escape rates from metastable valleys. We also demonstrate that the same approach can mitigate biased sampling of degenerate ground states."
Physical Review A (16 Oct 2017) https://journals.aps.org/pra/abstract/10.1103/PhysRevA.96.042322
Experimental demonstration of perturbative anticrossing mitigation using non-uniform driver Hamiltonians
Trevor Lanting, Andrew D. King, Bram Evert, Emile Hoskinson
"Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transverse driver Hamiltonian is applied to each qubit. Previous theoretical research sought to alleviate such anticrossings by adjusting the transverse driver Hamiltonians on individual qubits according to a perturbative approximation. Here we apply this principle to a physical implementation of quantum annealing in a D-Wave 2000Q system. We use samples from the quantum annealing hardware and per-qubit anneal offsets to produce nonuniform driver Hamiltonians. On small instances with severe perturbative anticrossings, our algorithm yields an increase in minimum eigengaps, ground state success probabilities, and escape rates from metastable valleys. We also demonstrate that the same approach can mitigate biased sampling of degenerate ground states."
(10 Aug 2017) https://arxiv.org/abs/1708.03049
Quantum eigenstate tomography with qubit tunneling spectroscopy
Anatoly Yu. Smirnov and Mohammad H. Amin
"Measurement of the energy eigenvalues (spectrum) of a multi-qubit system has recently become possible by qubit tunneling spectroscopy (QTS). In the standard QTS experiments, an incoherent probe qubit is strongly coupled to one of the qubits of the system in such a way that its incoherent tunneling rate provides information about the energy eigenvalues of the original (source) system. In this paper, we generalize QTS by coupling the probe qubit to many source qubits. We show that by properly choosing the couplings, one can perform projective measurements of the source system energy eigenstates in an arbitrary basis, thus performing quantum eigenstate tomography. As a practical example of a limited tomography, we apply our scheme to probe the eigenstates of a kink in a frustrated transverse Ising chain."
(25 Feb 2017) Link to PDF.
Global warming: Temperature estimation in annealers
Jack Raymond, Sheir Yarkoni, Evgeny Andriyash
"Sampling from a Boltzmann distribution is NP-hard and so requires heuristic approaches. Quantum annealing is one promising candidate. The failure of annealing dynamics to equilibrate on practical time scales is a well understood limitation, but does not always prevent a heuristically useful distribution from being generated. In this paper we evaluate several methods for determining a useful operational temperature range for annealers.
(2 Jun 2016) Download PDF. Link to Supplementary Material.
Mapping constrained optimization problems to quantum annealing with application to fault diagnosis
Zhengbing Bian, Fabian Chudak, Robert Israel, Brad Lackey, William G. Macready, Aidan Roy
Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware.
(10 Mar 2016) http://arxiv.org/abs/1603.03111
Quantum Boltzmann Machine
Mohammad H. Amin, Evgeny Andriyash, Jason Rolfe, Bohdan Kulchytskyy, Roger Melko
Inspired by the success of Boltzmann Machines based on classical Boltzmann distribution, we propose a new machine learning approach based on quantum Boltzmann distribution of a transverse-field Ising Hamiltonian. Due to the non-commutative nature of quantum mechanics, the training process of the Quantum Boltzmann Machine (QBM) can become nontrivial. We circumvent the problem by introducing bounds on the quantum probabilities. This allows us to train the QBM efficiently by sampling. We show examples of QBM training with and without the bound, using exact diagonalization, and compare the results with classical Boltzmann training. We also discuss the possibility of using quantum annealing processors like D-Wave for QBM training and application.
(8 Jan 2016) http://arxiv.org/abs/1601.02036
A frequency and sensitivity tunable microresonator array for high-speed quantum processor readout
J. D. Whittaker, L. J. Swenson, M. H. Volkmann, P. Spear, F. Altomare, A. J. Berkley, B. Bumble, P. Bunyk, P. K. Day, B. H. Eom, R. Harris, J. P. Hilton, E. Hoskinson, M. W. Johnson, A. Kleinsasser, E. Ladizinsky, T. Lanting, T. Oh, I. Perminov, E. Tolkacheva, and J. Yao
"Superconducting microresonators have been successfully utilized as detection elements for a wide variety of applications. With multiplexing factors exceeding 1000 detectors per transmission line, they are the most scalable low-temperature detector technology demonstrated to date. For high-throughput applications, fewer detectors can be coupled to a single wire but utilize a larger per-detector bandwidth. For all existing designs, fluctuations in fabrication tolerances result in a non-uniform shift in resonance frequency and sensitivity, which ultimately limits the efficiency of bandwidth utilization. Here, we present the design, implementation, and initial characterization of a superconducting microresonator readout integrating two tunable inductances per detector. We demonstrate that these tuning elements provide independent control of both the detector frequency and sensitivity, allowing us to maximize the transmission line bandwidth utilization. Finally, we discuss the integration of these detectors in a multilayer fabrication stack for high-speed readout of the D-Wave quantum processor, highlighting the use of control and routing circuitry composed of single-flux-quantum loops to minimize the number of control wires at the lowest temperature stage."
(Jan 2016) Journal of Applied Physics 119, 014506 (2016); https://doi.org/10.1063/1.4939161
Fast clique minor generation in Chimera qubit connectivity graphs
Tomas Boothby, Andrew D. King, Aidan Roy
(27 Oct 2015) http://link.springer.com/article/10.1007/s11128-015-1150-6?wt_mc=internal.event.1.SEM.ArticleAuthorOnlineFirst
Performance of a quantum annealer on range-limited constraint satisfaction problems
A.D.King, T.Lanting, and R.Harris
(3 Sep 2015) http://arxiv.org/pdf/1502.02098.pdf
Searching for quantum speedup in quasistatic quantum annealers
Mohammad H. Amin
(13 Mar 2015) http://arxiv.org/pdf/1503.04216.pdf
Computational Role of Collective Tunneling in a Quantum Annealer
Sergio Boixo et al.
(19 Feb 2015) http://arxiv.org/pdf/1411.4036.pdf
Discrete optimization using quantum annealing on sparse Ising models
Zhengbing Bian, Fabian Chudak, Robert Israel, Brad Lackey, William G. Macready and Aidan Roy
Frontiers in Physics, (18 Sep 2014) http://journal.frontiersin.org/Journal/10.3389/fphy.2014.00056/abstract
A practical heuristic for finding graph minors
Jun Cai, Bill Macready, Aidan Roy
(12 Jun 2014) http://arxiv.org/pdf/1406.2741.pdf
Architectural considerations in the design of a superconducting quantum annealing processor
P. Bunyk et al.
Pre-print (21 Jan 2014) http://arxiv.org/pdf/1401.5504v1
Evidence for temperature dependent spin-diffusion as a mechanism of intrinsic flux noise in SQUIDs
T. Lanting et al.
(23 Dec 2013) http://arxiv.org/pdf/1306.1512.pdf
Adiabatic quantum optimization with qudits
M.H. Amin et al.
Quant. Inf. Proc. 12, 1819-1829 (April 2013) doi:10.1007/s11128-012-0480-x/QuantInfProc12/
Tunneling spectroscopy using a probe qubit
A. J. Berkley et al.
Phys. Rev. B 87, 020502(R) (2013) doi:10.1103/PhysRevB.87.020502
Algorithmic approach to adiabatic quantum optimization
N. G. Dickson et al.
Phys. Rev. A 85, 032303 (2012) doi:10.1103/PhysRevA.85.032303arXiv:1108.33031
Approximate diagonalization method for large-scale Hamiltonians
M. H. Amin et al.
Phys. Rev. A 86, 052314 (2012) doi:10.1103/PhysRevA.86.052314
Probing high-frequency noise with macroscopic resonant tunneling
Physical Review B PhysRevB.83.180502 arXiv:1103.1931
Importance of Explicit Vectorization for CPU and GPU Software Performance
N. Dickson et al.
Journal of Computational Physics arXiv:1004.0024
The Ising model: teaching an old problem new tricks
Z. Bian et al.
Investigating the Performance of an Adiabatic Quantum Optimization Processor
K. Karimi et al.
Quantum Information Processing arXiv:1006.4147
Does adiabatic quantum optimization fail for NP-complete problems?
Phys. Rev. Lett. 106, Issue 5, 050502 arXiv:1010.0669
A scalable control system for a superconducting adiabatic quantum optimization processor
M. W. Johnson et al.
Supercond. Sci. Technol. 23, 065004 arXiv:0907.3757
Experimental Demonstration of a Robust and Scalable Flux Qubit
R. Harris et al.
Physical Review B 81, 134510 (2010) arXiv:0909.4321
High-Performance Physics Simulations Using Multi-Core CPUs and GPGPUs in a Volunteer Computing Context
International Journal of High Performance Computing Applications, doi: 10.1177/1094342010372928arXiv:1004.0023
Robust Parameter Selection for Parallel Tempering
F. Hamze et al
International Journal of Modern Physics C, Volume 21, issue 5 (2010) arXiv:1004.2840
Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
Phys. Rev. B 82, 024511 (2010) arXiv:1004.1628
Cotunneling in pairs of coupled flux qubits
Phys. Rev. B 82, 060512(R) (2010) arXiv:1006.0028
A scalable readout system for a superconducting adiabatic quantum optimization system
Supercond. Sci. Technol. 23, 105014 (2010) arXiv:0905.0891
Non-Markovian incoherent quantum dynamics of a two-state system
M. H. S. Amin et al.
Decoherence in adiabatic quantum computation
Phys. Rev. A 79, 022107 (2009) arXiv:0708.0384
A Compound Josephson Junction Coupler for Flux Qubits With Minimal Crosstalk
Landau-Zener transitions in a superconducting flux qubit
J. Johansson et al.
Geometrical dependence of the low-frequency noise in superconducting flux qubits
Consistency of the Adiabatic Theorem
Phys. Rev. Lett. 102, 220401 (2009) arXiv:0810.4335
Landau-Zener transitions in the presence of spin environment
A. T. S. Wan et al.
Int. J. Quant. Inf. 7, 725 (2009) arXiv:cond-mat/0703085
First Order Quantum Phase Transition in Adiabatic Quantum Computation
The Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem
V. Choi et al.
Quantum Information Processing 7, pp193-209 (2008) arXiv:0804.4884
Macroscopic Resonant Tunneling in the Presence of Low Frequency Noise
On the construction of model Hamiltonians for adiabatic quantum computing and its application to finding low energy conformations of lattice protein models
A. Perdomo et al.
Physical Review A 78, 012320 (2008) arXiv:0801.3625
Effect of Local Minima on Adiabatic Quantum Optimization
Thermally Assisted Adiabatic Quantum Computation
Phys. Rev. Lett. 100, 060503 (2008) arXiv:cond-mat/0609332
Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
Realizable Hamiltonians for Universal Adiabatic Quantum Computers
J. D. Biamonte et al.
Phys. Rev. A 78, 012352 (2008) aXiv:0704.1287
Sign- and Magnitude-Tunable Coupler for Superconducting Flux Qubits
Phys. Rev. Lett. 98, 177001 (2007) arXiv:cond-mat/0608253
A Characterization of global entanglement
P. J. Love et al.
Quant. Info. Proc. 6, 187 (2007) arXiv:quant-ph/0602143
Rabi oscillations in systems with small anharmonicity
Low Temp. Phys. 32, 198 (2006) arXiv:cond-mat/0407080
Four-Qubit Device with Mixed Couplings
M. Grajcar et al.
Adiabatic quantum computation with flux qubits, first experimental results
S. H. W. van der Ploeg et al.
IEEE Trans. App. Supercond. 17, 113 (2006) arXiv:cond-mat/0702580
Simulated Quantum Computation of Molecular Energies
A. Aspuru-Guzik et al.
Science 309 p. 1704, (2005) arXiv:quant-ph/0604193
Hamiltonian for coupled flux qubits
A. M. van den Brink et al.
Phys. Rev. B, 71, 064503 (2005) arXiv:cond-mat/0310425
Quantum nondemolition charge measurement of a Josephson qubit
Phys. Rev. B 71, 140505 (2005) arXiv:cond-mat/0412286
Silent phase qubit based on d -wave Josephson junctions
Flux qubit in charge-phase regime
M.H.S. Amin et al.
Mediated tunable coupling of flux qubits
New J. Phys. 7 230 (2005) arXiv:cond-mat/0501148
Direct Josephson coupling between superconducting flux qubits
Phys. Rev. B 72, (2005) 020503(R) arXiv:cond-mat/0501085
Evidence for Entangled States of Two Coupled Flux Qubits
A. Izmalkov et al.
Low-frequency measurement of the tunneling amplitude in a flux qubit
Quasiparticle Decoherence in d-Wave Superconducting Qubits
Observation of macroscopic Landau-Zener tunneling in a superconducting device
Euro. Phys. Lett. 65, 844, (2004) arXiv:cond-mat/0307506
Wigner distribution function formalism for superconductors and collisionless dynamics of the superconducting order parameter
Superconducting quantum storage and processing
IEEE International Solid State Circuit Conference (ISSCC), Tech. Dig., p296(2004)
Anomalous current-phase relation as basis for HTS qubit
S. A. Charlebois et al.
Proceedings of the European Conference on Applied Superconductivity (EUCAS 2003)
Nonequilibrium quasiclassical theory for Josephson structures
M. H. S. Amin, et al.
Josephson-phase qubit without tunneling
Dynamical Effects of an Unconventional Current-Phase Relation in YBCO dc SQUIDs
T. Lindstrom et al.
Quasiclassical Calculations of spontaneous current in restricted geometries
"Towards the Controllable Quantum States" edited by H. Takayanagi and J. Nitta, World Scientific Publishing Co. (2003), arXiv:cond-mat/0207617
Continuous Monitoring of Rabi Oscillations in a Josephson Flux Qubit
E. Il'ichev et al.
Theory of weak continuous measurements in a strongly driven quantum bit
A. Y. Smirnov, et al.
Tunable coupling of superconducting qubits
A. Blais et al.
Multi-Terminal Superconducting Phase Qubit
Physica C 368, 310 (2002) arXiv:cond-mat/0109382
High Temperature PI/2-SQUID
IEEE Tran. Appl. Supercond. 12, 1877 (2002) arXiv:cond-mat/0107370
Time reversal breaking states and spontaneous current pattern in Josephson junctions of d-wave superconductors
"New Trends in Superconductivity", edited by J.F. Annett and S. Kruchinin, Kluwer, Academic Publishers (2002).
Quasiclassical theory of spontaneous currents at surfaces and interfaces of d-Wave superconductors
Physica B 318, 162 (2002) arXiv:cond-mat/0105486
Low-frequency characterization of quantum tunneling in flux qubits
Y. S. Greenberg et al.
d+is versus d+id time reversal symmetry breaking states in finite size systems
DC-SQUID based on the mesoscopic multi-terminal Josephson junction
Physica C 372-376P1, 184 (2002); Special issue: Proceeding of the 5th European Conference on Applied Superconductivity, Copenhagen, Denmark, (Sep. 2001) arXiv:cond-mat/0109384
Mesoscopic multi-terminal Josephson structures. I. effects of nonlocal weak coupling
Low Temp Phys. 27, 616 (2001) arXiv:cond-mat/0109333
Degenerate Ground State in a Mesoscopic YBa2Cu3O7-x Grain Boundary Josephson Junction
Phys. Rev. Lett. 86, 5369 (2001) arXiv:cond-mat/0102404
Mechanisms of spontaneous current generation in an inhomogeneous d-wave superconductor

redpajama_set_name: RedPajamaCommonCrawl


For Daniel Roth, timekeeping need not be a chore or an uninspired task. The Swiss manufacture was founded in Vallee de Joux in 1989 and has since been a mecca for enthusiasts looking for watches that are a little less ordinary. The Daniel Roth Ladies more than fits the bill with its distinct double ellipse case fashioned from steel or 18k gold. An automatic watch that gives a feel of the most precious jewelry, diamonds adorn many of the Daniel Roth Ladies from its bezel, lugs, or throughout the entire bracelet. Measuring between 21mm to 28mm, the attractive dial features a minute chapter ring and black hour markers accompanied by two blued steel, black, or gold hands. Protected by a sapphire crystal and a waterproofness of up to 30m, the Daniel Roth Ladies gives insight into a woman''s style and sensibility.


text:
Strona główna / Forum Towarzystwa Genalogiczno Heraldycznego w Poznaniu / Pozostałe / Off topic
1 2 3 4 5 ... 2492 Dalej »
/ The game is quite tough as well means there are many
The game is quite tough as well means there are many
zhangzk
It's often said that quarterback is the hardest position to play in football http://www.steelersfootballauthentics.co...-authentic , and with the slim chance players get to win and keep the spot in today's NFL, that sentiment has been proven true again and again. We often see first-round quarterbacks fail miserably once given the starting job, as well as players drafted quite low, or even undrafted, making a big impact right off the bat. You've also got guys like Robert Griffin III who start hot but fizzle out due to injuries, attitude, or other reasons (both in RG3's case), and guys like Alex Smith that take a while to develop, but make the wait worth it as late-bloomers.meaning a backup QB is also just as important. Remember how Tom Brady quickly became the best quarterback in the NFL after initially replacing an injured Drew Bledsoe? Still, there are some of those players should just stay backups.That all said, this list will look at failed starters and those backups who have no place under center on opening day of the 2017 NFL season. DENVER (AP) — General managers John Elway and John Lynch share a bond going back three decades Justin Layne Jersey , one built on respect, rivalry and reverence."He was the poster I had on my wall," said Lynch, who's 11 years younger than Elway, 58. "He was the idol I had growing up."The Broncos (6-6) play the 49ers (2-10) Sunday in the latest chapter of the friendly feud between the two superstars-turned-GMs whose paths have crisscrossed throughout their careers, both on the football field and the front office.Both were tutored by celebrated California high school football coach Jack Neumeier and both were Stanford quarterbacks before starring in Denver, albeit a decade apart and at different positions.Lynch prepared for his move into the front office by serving a sort of apprenticeship under Elway, attending the 2013 NFL combine with him and sitting in with the Broncos' GM during the draft.Yet, it was 20 years earlier when Elway first lent Lynch a helping hand, as both men recalled during one of Lynch's scholarship lunches a couple of years ago."I knew that Johnny was nervous, this being his first preseason game," Elway remembered. "So, we're in the first quarter and Johnny's out there and our cadence back in that time was Set-Hut. I was always famous for saying http://www.steelersfootballauthentics.co...-authentic , 'Red 98 Red 98. Set-Hut!' Well I saw Johnny Lynch out there, I said, 'Set-Het, Red 98. Hey, Johnny Lynch!'"The shout-out impressed the rookie's Tampa Bay teammates."I came back to the huddle and it was so funny because all the guys said, 'You know Elway?' I said, yeah, we're tight," Lynch recounted.Years later, after they really had bonded, Lynch said Elway told him, "I was trying to loosen you up. I knew you were tight."Elway waited until after the game, however Zach Gentry Jersey , to deliver the tip that really helped Lynch, who went on to earn nine trips to the Pro Bowl, including in all four of his seasons in Denver.Elway told Lynch he knew exactly when he was going to blitz and when he wasn't just by reading his eyes."I look at Johnny Lynch and if he kept looking at me, I knew I was OK, I knew he wasn't coming," Elway explained.If Lynch darted his eyes away, the Broncos QB knew Lynch was coming at him off the edge."I guess he figured if he didn't see me, I didn't see him," Elway said. "I knew when he was coming. I told him that after the game and obviously he took that to heart."Lynch said Elway told him to "just look at me like you normally do. So, I used that throughout my career" to disguise his intentions.When he was offered the 49ers job last year, Lynch, who felt he might be too green, again sought Elway's advice."Yeah L.J. Collier Jersey , he's been awesome. He's a great friend and he exposed me to the business," Lynch said. "I think the biggest thing, when I had this opportunity presented to me really quickly and had a short, finite time to give them an answer, he kind of gave me the confidence: 'You know what, you can do this, just like anything else. You can be great at it.' And hearing that from him kind of emboldened me to feel that way."Their respective teams are heading in different directions. The 49ers have struggled since losing quarterback Jimmy Garoppolo to a knee injury and are jockeying for the top overall pick in the 2019 draft. The Broncos have won three straight and are pushing for their first playoff appearance since 2015."He helped me out in the beginning but now it's like anything else, we're competing," Lynch said. "Fortunately, we're not in the same division and all, but he's been great. He's one of my best friends in life and we understand that we both have to serve our organizations well, but we can also continue to be great friends and that's what we are."
08-07-2019 7:54


Click the button below to add the 2014-2018 Fiesta ST RACE Suspension Package to your wish list.
We've handpicked some of our best selling products and packaged them together to make the ultimate RACE suspenion handling package! Like autocrossing/tracking your ST or even for those aggressive weekend canyon drives then this is the package for you! The package contains our 4130 cromoly rear torsion bar which settles down the nervous rear/helps control rear bump steer, the cromoly strut brace locks the upper strut towers together improving steering feel. Our 4130 lower 6 point brace minimizes toe change strenghtening the entire crossmember and ties back into the unibody giving confidence to the driver during spirited outings!!! This kit is the ULTIMATE handling package for the Fiesta ST using the finest materials/processes and design to redefine performance driving! The package is custom built to order-Bars come coated in anthracite finish. We offer free shipping on this package and the kit installs with simple handtools and a floorjack-transform your Fiesta race experience today!!!
I thought the Fiesta handled great from the factory, but these race braces dramatically improved it. It turns in sharper and sticks like glue. It seems to put more power to the ground without upsetting the steering, very little torque steer is felt now. It even seems to shift smoother while rowing thru the gears. Other than this suspension package my Fiesta is bone stock. I have to say though, it's taken some of the fun and excitement away while driving on busy public roads, it's too well behaved. I would suggest to anyone looking to modify their suspension to first get this kit, and work from there if you feel its necessary. This kit may be all you need or want.


Welcome to Cayambis Music Press!
We publish and distribute Latin American solo and ensemble music, as well as works for chamber orchestra, symphony orchestra and concert band.
We are your best source for the finest in contemporary Latin American classical music! Our navigation menu is organized by ensemble size and type but you can also look for music from a specific country by going to our "Regions" page (the tab in the upper right hand corner). Or, download our free catalog. Questions? Write to us! Our experts are standing by to help you.
We've built our business around a core aspect of Latin American culture: the family. This means our composers are not just a name on a list; rather, we maintain a close relationship with each one, and they with us. There truly is a "Cayambis family." But, it's not easy to become a member of this family: our editorial board helps in the selection of each composer so as to ensure that we are publishing only the highest quality Latin American music.
We promote Latin American classical music many different ways, by providing postings of upcoming events, interviewing composers for our series of podcasts and even organizing concerts. We're always adding new resources to our website. Want to know more about these as well as our many activities? Then subscribe to our newsletter, the Cayambis Connection. In addition to insider news and special features, you, too, will be part of our Cayambis community of enthusiasts!
CAYAMBIS SINFONIETTAInterested in bringing our distinctive blend of winds, strings, percussion, piano and voice to your concert stage? Click on the link below for the latest news and information aboutOur own performing group!


The Neighbourhood Spaces Symposium is a three day event examining social and community practice through a variety of panels, presentations, discussions and activities.
3:30-5:30pm – Curator led tour of AGW exhibition Possible Futures: What is to be done?
Mammalian Diving Reflex has been working with a cohort of children in their neighbourhood since the kids were 9 years old in 2005. Now, almost ten years later, the children – all turning 18 this year – are beginning to assume artistic and production leadership within the company. Artistic and Research Director, Darren O'Donnell and Young Mammals Director, Annie Wong will describe the models, its evolution and the nuts and bolts of the training process, while Sanjay Ratnan and Kathy Vuu will discuss their involvement in the company over the years.
10:00am-12:30pm – Mammalian Diving Reflex – Home Tours: Mammalian Diving Reflex invites you to join them on a walk through the nearby neighborhood, where we will knock on random doors and ask for tours of stranger's homes.
1:15-2:45pm – Social Works: Varied Approaches to Participatory Activity: Sarah Fruchtman (Victoria, BC), Dr. Shauna Janssen (Montreal, QC), and Natalie Blaustone-Dye (Ashland, OR). Presenters will describe past projects and discuss how approaches differ based on a number of factors. This panel is moderated by Loree Lawrence.
3:00pm-3:30pm – SPAN, Listening Station: Over the course of the symposium, (SPAN) member Jacqueline Bell (Banff, AB) will be available to interview symposium participants. Each 20-minute session is designed as a peer-to-peer investigation built around a common set of questions, meant to get a sense of the range of ways that conference participants approach their practices.
9:15am-10:45am – The City: A Subject, A Place, A Partnership: Clint Sleeper (Reno, NV), Dan McCafferty (Windsor, ON), Cathy Masterson (City of Windsor Cultural Affairs Manager, Windsor, ON), and Greg Atkinson (Windsor, ON) will discuss using urban spaces in social practice.
1:15-2:00pm – Screening – Paradise City: Lisa Lipton (Halifax, NS) Paradise City was filmed over the course of Lisa Lipton's Neighbourhood Spaces residency in the summer of 2013.
2:00pm-3:30pm – Curatorial Practice for Public Spaces: Andrew Lochhead (Toronto, ON), Stephanie Vegh (Hamilton, ON) will discuss their recent curatorial project Market Value, an interactive, performative series of works in Hamilton's downtown Hamilton Farmer's Market as well as other recent artistic labour and advocacy performance works. Rita Camacho Lomeli (Toronto, ON) will present on her involvement as a curator for Art of the Danforth, and Hiba Abdallah of Broken City Lab (Windsor, ON) will discuss past and future BCL projects.
3:45pm-4:15pm – Heidelbergology: Jenenne Whitfield (Detroit, MI) is the Executive Director of the Heidelberg Project. he Heidelberg Project began 28 years ago as an artistic protest and has now grown to become a pillar of Detroit's creative community. It is from this perspective that the HP uphold the notion that a new philosophy is being born, Heidelbergology.
4:15-4:45pm – Social Practice for Recluses and Wallflowers: Rebecca Noone (Toronto, ON) will share her project Cues for Living. Her presentation examines the role of quiet gestures in social practice and shares some insights from world renowned physicists.
It is our mandate to remove barriers to access and participation, we have several options available for anyone with limited funds.
Neighbourhood Spaces invited socially engaged and community artists for 4-6 week residencies in various community sites throughout Windsor and Essex County, Ontario, Canada. Supported by the Ontario Trillium Foundation, this two-year program allowed artists to pursue research and/or create works that engaged, explored and connected with local communities. Neighbourhood Spaces encouraged artists to work in non-traditional spaces in non-traditional ways, embedding artists in community sites.
Neighbourhood Spaces is the product of a partnership between The Collaborative: Arts Council–Windsor & Region, Broken City Lab and The City of Windsor. This program is made possible through the generous financial support of the Ontario Trillium Foundation.


A portrait of the sub-tropical city of Brisbane, Queensland.
Queensland's capital is famous for its warm summers and mild winters, contributing to a way of life with a more leisurely tempo. This portrait of Brisbane includes footage of the University of Queensland under construction, its sub-tropical parks and gardens and the exotic night life enjoyed by its citizens.


As an alternative to the dampers to be installed on the Millennium bridge, I should like to suggest a solution which may not have been considered before.
If the swaying is solely due to the act of walking, why not ensure that pedestrians stand still while crossing the bridge.
This could be achieved by removing the walkway and replacing it with two flat rubber belt travelators and moving handrails running in opposite directions.
The bridge would probably be the only mechanical pedestrian river crossing in the world, making it a tourist attraction in its own right, and the elderly and children would love it!
Ten privately-financed rail proposals are still in the running for government backing as part of the Department for Transport's (DfT) call for ideas.


text:
De hervormde kerk van het Betuwse dorp Lienden is een gotisch kerkgebouw.

De kerk had een romaanse voorganger en behoorde oorspronkelijk toe aan de Utrechtse Paulusabdij. De kerk was gewijd aan Maria. Het oudste gedeelte van de huidige kerk is het koor met de sacristie, die rond 1400 werden gebouwd. In de eerste helft van de 15de eeuw kwamen vervolgens achtereenvolgens het pseudobasilicale schip en de toren tot stand. Schip en koor zijn witgepleisterd, terwijl de onderste van de drie torengeledingen is bekleed met tufsteen. De toren wordt bekroond door een ingesnoerde naaldspits.

De ruime kerk is voorzien van gewelven, die uit ca. 1500 dateren. In het koor, dat een stergewelf heeft, bevinden zich 15de-eeuwse muurschilderingen, die in 1861 en 1932 aan het licht kwamen.

Het orgel is gebouwd door C.F.A. Naber en dateert oorspronkelijk uit 1842, waarna het tweemaal een uitbreiding onderging. In de kerk staan een 17de-eeuwse preekstoel met een koperen lessenaar en twee 17de-eeuwse herenbanken. Tussen 1871 en 1874 onderging de kerk vanbinnen ingrijpende veranderingen, die later gedeeltelijk weer ongedaan zijn gemaakt.

De toren is voorzien van een door Peter en Johan van Trier in 1643 gegoten luidklok.

In 1582 kwam de kerk in protestantse handen. In 1599 verkregen de graven van Culemborg, de halfheren van Lienden, het collatierecht. De kerk wordt gebruikt door de Hervormde Gemeente Lienden. Tussen 1978 en 1982 werd het gebouw gerestaureerd.

Externe link
* Hervormde Gemeente Lienden: Kerkgebouw en orgel

Kerkgebouw in Buren
Rijksmonument in Buren

redpajama_set_name: RedPajamaWikipedia


text:
San Francisco Boy Severely Injured In Tubing Accident
by Bay City News | June 27, 2011 6:12 am	| in News | 0
A tubing accident on a lake in Sonoma County severely injured a 7-year-old boy on Saturday, the sheriff's office reported.
A 7-year-old San Francisco boy, his father and other people were tubing on Lake Sonoma when the boat's towline that was pulling the child on a tube was caught on a different boat's propeller. The moving propeller pulled the towline and the child toward the boat.
The propellers hit the boy's legs, severely cutting them, which led to significant bleeding, according to Sgt. Ed Hoener.
Due to the boy's severe injuries and the remote location in a restricted area of the lake, a sheriff's helicopter was brought in. The boy was treated where the helicopter landed on the lake and then transported to Santa Rosa Memorial Hospital, Hoener said.
At the hospital the boy was sent to the trauma unit to undergo surgery.
Further details concerning the accident are under investigation, according to the sheriff's office.
Sasha Lekach, Bay City News
Want more news, sent to your inbox every day? Then how about subscribing to our email newsletter? Here's why we think you should. Come on, give it a try.


text:
Healthcare Triage: Clickbait Headlines and Medical Research! Watch This Video to Keep Your Family Safe!
I'm part of a weekly gaming group. Most of the time it's role playing games, although board games come into play as well. Most of the participants are doctors. We have a group text that we officially use to schedule, but unofficially it's the way that we share news stories about medicine that drive us insane.
It's unfortunate that these gaming-group group-text (which is seriously one of the most qualified, educated, and thought-provoking feeds that only eight people get to access) can't be more widely shared. But today, we're going to go over some of those crazy news stories, and why you shouldn't believe every headline you read.
That's the topic of this week's Healthcare Triage:
For those of you who want to read more:
Sleeping in on weekends may help reduce diabetes risk
Artificial sweeteners induce glucose intolerance by altering the gut microbiota
Scientists Finally Prove Why Cold Weather Makes You Sick
Temperature-dependent innate defense against the common cold virus limits viral replication at warm temperature in mouse airway cells
Popular sleep remedies and hayfever pills 'increase risk of Alzheimer's by more than 50%'
Cumulative Use of Strong Anticholinergics and Incident Dementia: A Prospective Cohort Study
@aaronecarroll
Healthcare Triage, media
Aaron E. Carroll, MD, MS is co-Editor-in-Chief of The Incidental Economist and tweets at @aaronecarroll. He is the Chief Health Officer at Indiana University. He is also a Distinguished Professor of Pediatrics and Associate Dean for Research Mentoring at the Indiana University School of Medicine. In addition to contributing regularly to The New York Times and the Atlantic, he is the author of four books, most recently The Bad Food Bible.


For those who watch the movie Marvel, must know the scene in the movie Iron Man where Tony Stark who can chat with his system called Jarvis to perform various activities for him. Jarvis can help Tony Stark for simple things like getting a glass to extinguish the fire.
We can turn off the lights and turn on the lights just by clapping using a tool called The Clapper. This tool responds to input in the form of sound and transform information into a trigger to be able to turn on or turn off the lights. So if we wake up, just clap hands lights already flame. Continue if you want to ninggalin room or want to sleep, live applause again to turn off the lights.
If we had to applause to light a lamp, if now could be much more intuitive again. We just need to point our fingers to the electronic devices that want to be controlled, then automatically the electronic device will immediately turn on / off. We do not have to move from the position we sit to light the lights, turn on the television, close the window curtain, to open the door for our friends who come to the house.
This seems to me the most useful technology for me, which is changing the Lock with Smartphone. Why? There are two major problems I often encounter related to keys. First, I like to miss keys whether the home offices keys are behind in the office or vice versa. The second, I like to forget already lock the door or not yet fit in the way. Well bother it if something like that happens. Not only that, when we are already on the road we can still access the key.
He is an innovation that combines LED lights with technology. All the lights in our homes we can connect with a bridge that will be a liaison with the application on our device. Through the application, we can control the intensity of light, turn off and turn on the lights, and control it in accordance with our desires. In fact we can set the timer and make light settings like what we want.
Additionally, I am actually preparing to post about IFTTT (If This Than That), but since again discussing this sophisticated light, with the application we can set our lights if suppose there are important email or other notification. Suppose I set each email associated with the incoming bill to my inbox, my work light becomes red.
I think if you have all four robots at home, you can spend more time with your family and do more productive activities (when you say lazy clean up). Maybe in the future could it be added robot to wash the car, make cooking, to make the cockroach out at home.


The OH 25 XY adjusting mounting plates are cost-effective and space-saving components. They are used in cases where for cost or space reasons XY stages and XY combinations of translation stages cannot be used.
Mounted optics, inserts and adjustable inserts are located in the optical path via these adjusting mounting plates. By means of two fine-thread screws and a compression spring, these special mounts can be sensitively adjusted orthogonally to the optical axis in X and Y direction. The special design enables a XY translation nearly on a plane surface.
To mount them on slides RT 25, the XY adjusting mounting plates OH 25 have M2.5 threaded holes. Additionally, all holders have a M4 thread to put them on pins STF 15.


text:
package com.bazaarvoice.sswf.service

import java.util.{Collections, Date}

import com.amazonaws.services.simpleworkflow.model._
import com.amazonaws.services.simpleworkflow.{AmazonSimpleWorkflow, model}
import com.bazaarvoice.sswf.model.history.{HistoryFactory, StepsHistory}
import com.bazaarvoice.sswf.service.except.WorkflowManagementException
import com.bazaarvoice.sswf.{InputParser, Logger, WorkflowStep}

import scala.collection.JavaConverters._
import scala.reflect._
import scala.util.Random

/**
  * This is where you register and start workflows.
  *

  * In SWF, there are domains, workflow types, activities that need to be registered. You provide all the config we need for activities in the StepEnum. You give the parameters for domain and
  * workflow type here.
  *

  * This class is implemented so that you can call registerWorkflow() every time your app starts, and we will register anything that needs to be registered, so you should be able to manage your
  * whole workflow from this library.
  *
  * @param domain                               The domain of the workflow: AWS docs
  *                                             as well as  the README
  * @param taskList                             If you execute the same workflow in different environments, use different task lists. Think of them as independent sets of actors working on the same
  *                                             logical workflow, but in
  *                                             different contexts (like production/qa/development/your machine).
  *                                             AWS docs
  *                                             as well as  the README
  * @param workflow                             The id of your particular workflow. See "WorkflowType" in the AWS docs
  *                                             as well as the README.
  * @param workflowVersion                      You can version workflows, although it's not clear what purpose that serves. Advice: just think of this as an administrative notation. See
  *                                             the README.
  * @param swf                                  The AWS SWF client
  * @param workflowExecutionTimeoutSeconds      How long to let the entire workflow run. This only comes in to play if 1) The decision threads die or 2) A step gets into an "infinite loop" in which it
  *                                             always returns InProgress without making any actual progress. The default is set to one month on the assumption that you'll monitor the workflow and
  *                                             fix either of those problems if they occur, letting the workflow resume and complete. If you prefer to let the workflow fail, you'll want to set it
  *                                             lower.
  * @param workflowExecutionRetentionPeriodDays How long to keep _completed_ workflow information. Default: one month.
  * @param stepScheduleToStartTimeoutSeconds    The duration you expect to pass _after_ a task is scheduled, and _before_ an actionWorker picks it up. If there is always a free actionWorker, this is
  *                                             just the polling interval for actions to execute. If all the actionWorkers are busy, though, the action may time out waiting to start. This isn't
  *                                             harmful, though, since the decisionWorker will simply re-schedule it. Advice: make your actionWorker pool large enough that all scheduled work can
  *                                             execute immediately, and set this timeout to the polling interval for action work. Default: 5 minutes
  * @param inputParser                          See InputParser
  * @tparam StepEnum The enum containing workflow step definitions
  */
class WorkflowManagement[SSWFInput, StepEnum <: (Enum[StepEnum] with WorkflowStep) : ClassTag](domain: String,
                                                                                workflow: String,
                                                                                workflowVersion: String,
                                                                                taskList: String,
                                                                                swf: AmazonSimpleWorkflow,
                                                                                workflowExecutionTimeoutSeconds: Int = 60 * 60 * 24 * 30, // default: one month
                                                                                workflowExecutionRetentionPeriodDays: Int = 30,
                                                                                stepScheduleToStartTimeoutSeconds: Int = 60 * 5,
                                                                                inputParser: InputParser[SSWFInput],
                                                                                log: Logger) {

  /**
    * Register the domain,workflow,and activities if they are not already registered.
    * If you have marked any of these as DEPRECATED through the SWF api, this method will throw an exception telling you to delete the relevant config first.
    */
  def registerWorkflow(): Unit = {
    registerDomain()
    registerWorkflowType()
    registerActivities()
  }

  /**
    * Submit/start a workflow execution.
    *
    * @param workflowId A unique identifier for this particular workflow execution
    * @param input      Whatever input you need to provide to the workflow
    * @return tracking information for the workflow
    */
  def startWorkflow(workflowId: String, input: SSWFInput): WorkflowExecution = {
    val inputString = inputParser.serialize(input)
    val run =
      try {
        swf.startWorkflowExecution(new StartWorkflowExecutionRequest()
           .withDomain(domain)
           .withTaskList(new TaskList().withName(taskList))
           .withWorkflowId(workflowId)
           .withWorkflowType(new WorkflowType().withName(workflow).withVersion(workflowVersion))
           .withInput(inputString)
        )
      } catch {
        case t: Throwable =>
          throw new WorkflowManagementException(s"Exception starting workflow[$workflowId]", t)
      }

    new WorkflowExecution().withRunId(run.getRunId).withWorkflowId(workflowId)
  }

  def terminateWorkflowExecution(workflowId: String, runId: String): Unit = {
    try {
      swf.terminateWorkflowExecution(new TerminateWorkflowExecutionRequest()
         .withDomain(domain)
         .withWorkflowId(workflowId)
         .withRunId(runId)
      )
    } catch {
      case t: Throwable =>
        throw new WorkflowManagementException(s"Exception terminating workflow[$workflowId] run[$runId]", t)
    }
  }

  def cancelWorkflowExecution(workflowId: String, runId: String): Unit = {
    try {
      swf.requestCancelWorkflowExecution(new RequestCancelWorkflowExecutionRequest()
         .withDomain(domain)
         .withWorkflowId(workflowId)
         .withRunId(runId)
      )
    } catch {
      case t: Throwable =>
        throw new WorkflowManagementException(s"Exception cancelling workflow[$workflowId] run[$runId]", t)
    }
  }

  /**
    * Use this method to generate signals for use with the Wait result
    *
    * The format of the signal is publicly documented as 3 pipe-delimited fields with workflowId,runId, and a unique signal name.
    *
    * WARNING: this format is public, so if you change it, you need to update the docs.
    *
    * @return a signal token for passing to Wait and for calling signalWorkflow with.
    */
  def generateSignal(workflowId: String, runId: String) = workflowId + "|" + runId + "|" + new Random().nextLong().toHexString

  /**
    * Use this method to send a previously generated signal to the workflow that generated it.
    */
  def signalWorkflow(signal: String) = {
    signal.split('|').toList match {
      case workflowId :: runId :: _ :: Nil =>
        try {
          swf.signalWorkflowExecution(new SignalWorkflowExecutionRequest()
             .withDomain(domain)
             .withWorkflowId(workflowId)
             .withRunId(runId)
             .withSignalName(signal)
          )
        } catch {
          case t: Throwable =>
            throw new WorkflowManagementException(s"Exception signalling domain[$domain] workflow[$workflowId] run[$runId] signal[$signal]", t)
        }
      case _                               =>
        throw new IllegalArgumentException(s"Incorrectly formatted signal [$signal]")
    }
  }

  /**
    * List open executions for this domain and workflow within the time window. (regardless of version)
    *
    * @param from Start time to search
    * @param to   End time to search
    * @return an unmodifiable list of matching executions
    */
  def listOpenExecutions(from: Date, to: Date): java.util.List[WorkflowExecutionInfo] = {
    val openRequest: ListOpenWorkflowExecutionsRequest = new ListOpenWorkflowExecutionsRequest()
       .withDomain(domain)
       .withTypeFilter(new WorkflowTypeFilter().withName(workflow))
       .withStartTimeFilter(new ExecutionTimeFilter().withLatestDate(to).withOldestDate(from))

    innerListOpenExecutions(openRequest)
  }

  /**
    * List open executions for this domain, workflow, and workflowId within the time window. (regardless of version)
    *
    * @param from       Start time to search
    * @param to         End time to search
    * @param workflowId The particular workflow id to list executions for
    * @return an unmodifiable list of matching executions
    */
  def listOpenExecutions(from: Date, to: Date, workflowId: String): java.util.List[WorkflowExecutionInfo] = {
    val openRequest: ListOpenWorkflowExecutionsRequest = new ListOpenWorkflowExecutionsRequest()
       .withDomain(domain)
       .withExecutionFilter(new WorkflowExecutionFilter().withWorkflowId(workflowId))
       .withStartTimeFilter(new ExecutionTimeFilter().withLatestDate(to).withOldestDate(from))

    innerListOpenExecutions(openRequest)
  }

  /**
    * List closed executions for this domain and workflow within the time window. (regardless of version)
    *
    * @param from Start time to search
    * @param to   End time to search
    * @return an unmodifiable list of matching executions
    */
  def listClosedExecutions(from: Date, to: Date): java.util.List[WorkflowExecutionInfo] = {

    val closedRequest: ListClosedWorkflowExecutionsRequest = new ListClosedWorkflowExecutionsRequest()
       .withDomain(domain)
       .withTypeFilter(new WorkflowTypeFilter().withName(workflow))
       .withStartTimeFilter(new ExecutionTimeFilter().withLatestDate(to).withOldestDate(from))

    innerListClosedExecutions(closedRequest)
  }

  /**
    * List closed executions for this domain, workflow, and workflowId within the time window. (regardless of version)
    *
    * @param from       Start time to search
    * @param to         End time to search
    * @param workflowId The particular workflow id to list executions for
    * @return an unmodifiable list of matching executions
    */
  def listClosedExecutions(from: Date, to: Date, workflowId: String): java.util.List[WorkflowExecutionInfo] = {

    val closedRequest: ListClosedWorkflowExecutionsRequest = new ListClosedWorkflowExecutionsRequest()
       .withDomain(domain)
       .withExecutionFilter(new WorkflowExecutionFilter().withWorkflowId(workflowId))
       .withStartTimeFilter(new ExecutionTimeFilter().withLatestDate(to).withOldestDate(from))

    innerListClosedExecutions(closedRequest)
  }

  /**
    * List all the events from an execution of a workflow.
    *
    * @param workflowId The particular workflow id to list events for
    * @param runId      The particular run of the workflow id to list events for
    * @return
    */
  def describeExecution(workflowId: String, runId: String): StepsHistory[SSWFInput, StepEnum] = {
    val request: GetWorkflowExecutionHistoryRequest = new GetWorkflowExecutionHistoryRequest()
       .withDomain(domain)
       .withExecution(new model.WorkflowExecution().withWorkflowId(workflowId).withRunId(runId))

    val iterateFn = (prev: History) => {
      if (prev == null || prev.getNextPageToken == null) null
      else swf.getWorkflowExecutionHistory(request.withNextPageToken(prev.getNextPageToken))
    }

    val historyEvents =
      Stream
         .iterate(swf.getWorkflowExecutionHistory(request))(iterateFn)
         .takeWhile(_ != null)
         .flatten(_.getEvents.asScala)
         .toList

    HistoryFactory.from(historyEvents, inputParser)
  }

  private[this] def registerDomain(): Unit = {
    // Opt for try/catch rather than list(), since the missing exception will probably be thrown once for each domain. List, on the other hand, would be expensive every time.
    try {
      val domainDetail: DomainDetail = swf.describeDomain(new DescribeDomainRequest().withName(domain))
      assert(domainDetail.getDomainInfo.getStatus == "REGISTERED", s"domain[$domain] is not REGISTERED [${domainDetail.getDomainInfo.getStatus}]. Please delete it and then re-run.")
    } catch {
      case e: UnknownResourceException =>
        try {
          swf.registerDomain(new RegisterDomainRequest()
             .withName(domain)
             .withDescription(s"domain[$domain] created by SSWF at [${new Date()}]")
             .withWorkflowExecutionRetentionPeriodInDays(workflowExecutionRetentionPeriodDays.toString))
        } catch {
          case d: DomainAlreadyExistsException =>
            // race condition. ignore...
            ()
          case t: Throwable                    =>
            throw new WorkflowManagementException(s"Unexpected exception registering domain[$domain]", t)
        }
    }
  }

  private[this] def registerWorkflowType(): Unit = {
    try {
      val workflowType: WorkflowTypeDetail = swf.describeWorkflowType(new DescribeWorkflowTypeRequest().withDomain(domain).withWorkflowType(new WorkflowType().withName(workflow).withVersion
      (workflowVersion)))
      assert(workflowType.getTypeInfo.getStatus == "REGISTERED", s"workflow[$workflow/$workflowVersion] is not REGISTERED [${workflowType.getTypeInfo.getStatus}]. Please delete it and then re-run.")
    } catch {
      case e: UnknownResourceException =>
        try {
          swf.registerWorkflowType(new RegisterWorkflowTypeRequest()
             .withDomain(domain)
             .withName(workflow)
             .withVersion(workflowVersion)
             .withDescription(s"workflow[$workflow/$workflowVersion] registered by SSWF at [${new Date()}}]")
             .withDefaultExecutionStartToCloseTimeout(workflowExecutionTimeoutSeconds.toString)
             .withDefaultTaskStartToCloseTimeout(600.toString) // timeout for decision tasks
             .withDefaultChildPolicy(ChildPolicy.TERMINATE)
          )
        } catch {
          case e: TypeAlreadyExistsException =>
            // race condition. ignore...
            ()
          case t: Throwable                  =>
            throw new WorkflowManagementException(s"Unexpected exception registering domain[$domain] workflow[$workflow/$workflowVersion]", t)
        }
    }
  }

  private[this] def streamActivityTypes(listActivityTypesRequest: ListActivityTypesRequest): Set[(String, String)] = {
    val iterateFn = (prev: ActivityTypeInfos) =>
      if (prev == null || prev.getNextPageToken == null) null
      else swf.listActivityTypes(listActivityTypesRequest.withNextPageToken(prev.getNextPageToken))

    Stream
       .iterate(swf.listActivityTypes(listActivityTypesRequest))(iterateFn)
       .takeWhile(_ != null)
       .flatten(r => collectionAsScalaIterable(r.getTypeInfos))
       .map(i => (i.getActivityType.getName, i.getActivityType.getVersion))
       .toSet
  }

  private[this] def registerActivities() {
    def baseRequest: ListActivityTypesRequest = new ListActivityTypesRequest()
       .withDomain(domain)
       .withMaximumPageSize(100)

    val registered = streamActivityTypes(baseRequest.withRegistrationStatus(RegistrationStatus.REGISTERED))
    val deprecated = streamActivityTypes(baseRequest.withRegistrationStatus(RegistrationStatus.DEPRECATED))

    val activities = registered union deprecated
    def register(activity: StepEnum) {
      val version = util.stepToVersion(activity)
      if (!activities.contains((activity.name, version))) {
        try {
          swf.registerActivityType(new RegisterActivityTypeRequest()
             .withName(activity.name)
             .withVersion(version)
             .withDomain(domain)
             .withDefaultTaskList(new TaskList().withName(taskList))
             .withDefaultTaskHeartbeatTimeout(activity.timeoutSeconds.toString)
             .withDefaultTaskScheduleToStartTimeout(stepScheduleToStartTimeoutSeconds.toString)
             .withDefaultTaskScheduleToCloseTimeout("NONE") // the heartbeat timeout serves as our timeout
             .withDefaultTaskStartToCloseTimeout("NONE") // the heartbeat timeout serves as our timeout
          )
        } catch {
          case t: Throwable =>
            throw new WorkflowManagementException(s"Exception registering activity[${activity.name}/$version] domain[$domain]", t)
        }
      }
    }

    val stepEnumClass: Class[StepEnum] = classTag[StepEnum].runtimeClass.asInstanceOf[Class[StepEnum]]
    stepEnumClass.getEnumConstants foreach register
  }

  private[this] def innerListOpenExecutions(listOpenWorkflowExecutionsRequest: ListOpenWorkflowExecutionsRequest): java.util.List[WorkflowExecutionInfo] = {
    val openStream = {
      val iterateFn: (WorkflowExecutionInfos) => WorkflowExecutionInfos = prev =>
        if (prev == null || prev.getNextPageToken == null) null
        else swf.listOpenWorkflowExecutions(listOpenWorkflowExecutionsRequest.withNextPageToken(prev.getNextPageToken))

      Stream
         .iterate(swf.listOpenWorkflowExecutions(listOpenWorkflowExecutionsRequest))(iterateFn)
         .takeWhile(_ != null)
         .flatten(_.getExecutionInfos.asScala)
    }

    Collections.unmodifiableList(scala.collection.JavaConverters.seqAsJavaList(openStream))
  }

  private[this] def innerListClosedExecutions(listClosedWorkflowExecutionsRequest: ListClosedWorkflowExecutionsRequest): java.util.List[WorkflowExecutionInfo] = {

    val closedStream = {
      val iterateFn: (WorkflowExecutionInfos) => WorkflowExecutionInfos = prev =>
        if (prev == null || prev.getNextPageToken == null) null
        else swf.listClosedWorkflowExecutions(listClosedWorkflowExecutionsRequest.withNextPageToken(prev.getNextPageToken))

      Stream
         .iterate(swf.listClosedWorkflowExecutions(listClosedWorkflowExecutionsRequest))(iterateFn)
         .takeWhile(_ != null)
         .flatten(_.getExecutionInfos.asScala)
    }

    Collections.unmodifiableList(scala.collection.JavaConverters.seqAsJavaList(closedStream))
  }

}

redpajama_set_name: RedPajamaGithub


The hotel was rebuilt from an ancient watermill in a picturesque setting on the Berounka river in the natural reservation Cesky kras, next to the famous Karlstejn Castle, just 25 km from Prague.
Romantic Hotel Mlyn offers 21 tastefully decorated rooms comfortably equipped with minibar, safety deposit box, TV/SAT, Wi-Fi Internet connection, direct dial phone, bathrooms fitted with bath/shower, marble sink, hairdryer and heated towel rail.
Cosy stylish restaurant with bar and summer terrace overlooking the Berounka river offers warm and homely ambiance and great food for all visitors, mainly fresh fish specialities.
For total relaxation unwind in a hot tube and sauna or visit our gym in health and fitness centre (advance booking necessary).
There is no better place for garden parties with Party Marquee, BBQ and open fire as a private romantic island on the Berounka river adjacent to the Romantic Hotel Mlyn.
Discover the distinctive character of Karlstejn Castle village, visit the Castle or simply browse in the colorfull little shops. A nearby sports club in Karlstejn offers tennis courts, volleyball court and a football field. Championship golf course with practice and teaching facilities just five minutes from the hotel. Great possibilities for horse riding, walking, cycling, fishing and water sports.


text:
One of the most beautiful hill stations in the Country. It is connected by the famous Dajeeling Himalayan Railway (DHR) - a narrow gauge train service which began in 1881. The journey over the DHR by the delightful `Toy` trains is an unforgettable experience. Starting from New Jailpaiguri & Siliguri Junction in the plains , the trains chugs its way along mountainsides & valley to reach Darjeeling. On the way , one can make a break-journey at Kurseong, another hill resort at an altitudes of 1458 meters. The Batasia Loop & Tiger Hill are other favourite spots.
Places of Interest: Tiger Hill, Senchal Lake, Bhan Bhakt Sarani, Observatory, Bhutia Busty Gompa, Yogachoeling (Ghoom) and three smaller Gompas, Aloobari Monostery, Dhirdham Temple, Bengal Natural History Museum Mountaineering Institute, Lloyd Botanical Gardens.
Accessibility : The best way to travel to Darjelling is by the narrow gauge `Toy Train` from New Jailpaiguri/Siliguri. The nearest airport is Bagdogra (90 kms). A good bus service links Darjeeling to Gangtok, kalimpong, Mirik & Siliguri.
51 kms North of Siliguri and 30 kms South of Darjeeling is Kurseong, with its peaceful atmosphere and predominantly Nepali population. Kurseong is a walker's paradise. It gets its name from the 'Kursonrip' or small white orchid found here.
Places of Interest : Eagle's Crag.
Accessibility : By Toy Train from Darjeeling connected by road to Darjeeling, Siliguri and Mirik.
MIRIK
Mirik is situated amidst Picturesque surrounding having easy access from both Siliguri or Darjeeling. The view of the Kanchenjungha from here is unique. A natural Lake is an added Attraction.
Places of Interest : Bokar Gompa, Kalamata, Shiva and Humam Temples.
At a height of 1250 Meters stands the lofty Hill Town Kalimpong, full of scenic beauty. Regular bus services ply from Siliguri and Darjeeling. Serving Railway station is Siliguri Junction on Metre Gauge and New Jalpaiguri on Broad Gauge.
Places of Interest : The Tharpa Choeling, Tongsa and Zong Dog Palri Fo-Brang Gompas, Deolo Hill, Dr.Graham's Home, Flower Nurseries, The Sericulture Research Institute.
COACH BEHAR
Famous for Places, Lakes & Parks, the Beautiful District Town in North Bengal was once the Capital of the KOCH King's. Nearest Railway Station is New Coach Behar.
This is a game Sanctuary. The One-Horned Rhino, Elephant,Leopard, Tiger & a variety of Birds are its fauna. The Nearest Railway Stations Madarihat(177) & Hasimara( 127 Km. )respectively from Siliguri.


With many Business Cards per pack, there's the option to print a different image or design on every one.
Want to stand out from the crowd, with something truly eye-catching? Our Original Business cards are designed to make an instant impact, from the very first hello to that final handshake.
Original Business Cards are printed on premium paper, and come with either a smooth matte or shiny gloss finish, so they feel as good as they look. And no matter what your business, we've got hundreds of exclusive design templates for you to choose and customise, so you can find a look as unique as you.
Thanks to Vien Dong printshop, you can print a different image on to every card in a pack, so you can showcase your business right from your pocket.


BERLIN (Reuters) - Beiersdorf (BEIG.DE), the maker of Nivea skin creams, is shaking up its top management team when new chief executive Stefan De Loecker takes over on Jan. 1, poaching managers from rivals Procter & Gamble (PG.N) and Reckitt Benckiser (RB.L).
Ramon Mirt, who headed Reckitt Benckiser's business in central and eastern Europe, will take charge of the Near East and Americas regions for Beiersdorf in March, the firm said.
"We welcome Asim Naseer and Ramon A. Mirt and their rich expertise. They will help Beiersdorf further deepen its commitment to international diversity and being closest to markets and consumers," said chairman Reinhard Poellath.
Beiersdorf said the management of its consumer business would be overseen by a newly established executive committee, to include global head of research and development May Shana'a, as well as supply chain head Harald Emberger.


text:
Q: See service hostname from OpenShift CLI In OpenShift Container Platform v3.11 I can able to see the service hostname from the web console interface by inspecting the service.
In the web console if going to Applications > Services > service-name > Details.
You see the following info:
Selectors: app=nexus3, deploymentconfig=nexus3
Type: ClusterIP
IP: 172.30.154.6
Hostname: nexus3.xm-nexus.svc
Session affinity: None
Is there a way to see the service hostname from the CLI using the oc tool? I haven't been able to find it from reading the docs or online.
Example Hostname: nexus3.xm-nexus.svc
If you issue a oc get svc you will see the following but not the hostname.
NAME         TYPE        CLUSTER-IP       EXTERNAL-IP   PORT(S)    AGE
nexus        ClusterIP   172.30.186.244   <none>        3000/TCP   2h

A: Not directly. The hostname doesn't exist on the service object itself so you won't see it via the cli. However it is just a concatenation of (service-name).(service-namespace).svc. See docs on DNS for services
You could template it out via the cli if desired.
oc get svc nexus -o go-template --template='{{.metadata.name}}.{{.metadata.namespace}}.svc{{println}}'

A: Use oc describe service  -n
e.g. oc describe service nexus3 -n
Services are provisioned labels like DNS.

A: I think the simplest way is
oc get routes

And get the hostname that you need to access by url
NAME          HOST/PORT                                     PATH      SERVICES      PORT      TERMINATION   WILDCARD
demowildfly   demowildfly-swarmdemo2.192.168.42.87.nip.io             demowildfly   8080                    None

redpajama_set_name: RedPajamaStackExchange


text:
Yu Darvish diagnosed with sprain of UCL in elbow, could need Tommy John surgery
By D.J. ShortMar 7, 2015, 11:17 AM EST
Awful news here for the Rangers and baseball fans in general, as Evan Grant of the Dallas Morning News reports that Yu Darvish has been diagnosed with a sprain of the ulnar collateral ligament in his elbow. He'll be further evaluated, but the belief is that he could need season-ending Tommy John surgery.
Darvish was shut down early last season due to right elbow inflammation and left his first start of the spring this week due to what was termed as tightness in his right triceps. The Rangers downplayed the severity of the situation, but now he's facing the worst-case scenario.
Here's Darvish's reaction to the bad news, via Grant:
Darvish statement: "I will be disappointed if I have to miss the season but want to look at all options, including getting a second opinion"
— Evan Grant (@Evan_P_Grant) March 7, 2015
While Yankees right-hander Masahiro Tanaka is trying to pitch through his UCL injury, there aren't many success stories with pitchers opting for rehab over Tommy John surgery. If Darvish tries to rehab the injury and ultimately needs the surgery, he could be at risk for missing 2015 and 2016, so there's a lot on the line with this decision. The Rangers had no luck on the health front last year and with Darvish and Jurickson Profar, they are off to a pretty rotten start already in 2015.
Darvish, 28, has compiled a 3.27 ERA with 11.2 K/9 in 83 starts over his first three seasons in the majors.


The school will put strategies in place in the event of a death that impacts on the school so as to ensure that the best possible help is available to both teachers and students.
The school will aim to provide support during the grief process.
The school will aim to provide accurate information should a death occur.
Be aware of appropriate courses of action and agencies who may be able to assist, eg "Seasons for Growth", Resource Teacher of Learning and Behaviour, counsellors, Victim Support.
Any announcement will be released by the Principal and the Board Chair.
Following the event of a traumatic event parents will be provided with information concerning signs of distress in their children.


Situated in Auckland, Super Charming Devonport Villa features free WiFi and units fitted with a kitchen. The holiday home offers a seating area with a flat-screen TV and a private bathroom with free toiletries and shower. There is also an oven, microwave and a kettle. Super Charming Devonport Villa offers a terrace. Guests can also relax in the garden. North Head Historic Reserve is 3.2 km from the accommodation, while Auckland Harbour Bridge is 8 km away. Auckland Airport is 38 km from the property.
Waiheke Daily Boutique Wine Tour - Wine Tour - Auckland. Starting from $115.00 per person.


This ebook equips either attorney and historian with an entire historical past of Roman legislations, from its beginnings c.1000 BC via to its re-discovery in Europe the place it used to be commonly utilized till the eighteenth century.
Combining a legislation specialist's expert point of view of criminal background with a socio-political and cultural concentration, it examines the assets of legislation, the ways that those legislation have been utilized and enforced, and the methods the legislation used to be prompted and advanced, with an exploration of civil and legal systems and distinctive recognition paid to criminal technology. the ultimate bankruptcy covers the historical past of Roman legislations in overdue antiquity and appraises the circulate in the direction of the codification of legislations that culminated within the ultimate assertion of Roman legislations: the Corpus Iuris Civilis of Emperor Justinian. in the course of the ebook, George Mousourakis highlights the connection among Roman legislation and Roman existence through following the traces of the key old developments.
Including bibliographic references and arranged accessibly via old period, this publication is a wonderful creation to the background of Roman legislation for college kids of either legislations and historic history.
Incorporating study present in historical literary, iconographic, epigraphic, and archaeological resources, this booklet explores the reviews of the warriors who carried out conflict at the small plains of historical Greece. the amount, which attracts at the gathered services of 9 American and British students, emphasizes the particular suggestions of battling and functional matters because the use of instructions, track in conflict, using "dog-tags", and formality at the battlefield.
Fresh literary-critical paintings in felony stories reads legislations as a style of literature, noting that Western legislation originated as a department of rhetoric in classical Greece and lamenting the truth that the legislations has misplaced its connection to poetic language, narrative, and mind's eye. yet glossy criminal scholarship has paid little recognition to the particular juridical discourse of historic Greece.
Studienarbeit aus dem Jahr 2011 im Fachbereich Geschichte - Weltgeschichte - Frühgeschichte, Antike, be aware: 1,3, Friedrich-Alexander-Universität Erlangen-Nürnberg, Sprache: Deutsch, summary: Das römische Reich zerfällt immer mehr. Das three. Jahrhundert gilt als DIE Krisenzeit der römischen Antike. Neben außenpolitischen Krisen findet sich immer häufiger der Begriff der Wirtschaftskrise, sogar der Weltwirtschaftskrise, ein Begriff, der in der Antike sicherlich erst einmal problemtaisch erscheint.
Kingdom Correspondence within the old global introduces the reader to the nation correspondences of centralized states and empires of the Mediterranean and the center East from the fifteenth century BC to the sixth century advert, and analyses their position in making sure the steadiness of those geographically vast kingdom structures.


Departure of Bob Bonar will be the second since feud with Blue Cross.
Children's Minnesota announced Monday that its chief executive is retiring, the second high-level departure from the state's largest pediatric hospital since last summer's high-profile contract dispute with Blue Cross and Blue Shield of Minnesota.
Children's said Monday that CEO Bob Bonar expects to retire in December, roughly three years after he left the chief executive position at a pediatric hospital in Texas.
Bonar will be replaced by Dr. Marc Gorelick, a physician who joined Children's earlier this year as president and chief operating officer.
The hospital's announcement did not mention the contract dispute with Eagan-based Blue Cross. A hospital spokeswoman said via e-mail there was no connection, and described Bonar's move as "a personal decision."
"We are grateful for Bob's leadership and many contributions during his time at Children's, and we wish him all the best in his retirement," said Hayes Batson, chair of the board at Children's, in a statement. "We have the utmost confidence that Marc and the executive leadership team will carry forward the strong foundation Bob has established, and advance the strategic goals of the organization."
Gorelick previously served as chief operating officer and executive vice president of Children's Hospital of Wisconsin, which is in Milwaukee. He is to begin his new role at Children's on Dec. 9.
Children's is the state's largest pediatric hospital, with campuses in Minneapolis and St. Paul, plus 10 community clinics.
In 2016, Children's posted operating income of $36 million on $880 million in revenue.
The contract dispute over payment terms between Children's and Blue Cross was unusual for including a social media campaign and dueling newspaper ads, as well as its duration.
Ultimately, Minnesota Attorney General Lori Swanson helped negotiate a settlement announced on July 7 — about three weeks before the resignation of the chief financial officer at Children's.
Insurers and hospitals periodically struggle to negotiate contract agreements, but they usually settle before patients are affected.
In the case of Blue Cross and Children's, the parties could not come to terms before a July 4 deadline, so the pediatric hospital was relegated to out-of-network status for Blue Cross subscribers for a few days.
The rift meant significantly higher out-of-pocket costs for people with Blue Cross coverage who used Children's, although exceptions were made for many children who were in the midst of ongoing treatment.