Horn of plenty

Farm produce ; Food supply

Boom in the West

Federal Reserve District, 12th ; Economic conditions - West (U.S.)

Weakening boom?

Federal Reserve District, 12th ; Economic conditions - West (U.S.)

Efficient Estimation of Word Representations in Vector Space

We propose two novel model architectures for computing continuous vector representations of words from very large data sets. The quality of these representations is measured in a word similarity task, and the results are compared to the previously best performing techniques based on different types of neural networks. We observe large improvements in accuracy at much lower computational cost, i.e. it takes less than a day to learn high quality word vectors from a 1.6 billion words data set. Furthermore, we show that these vectors provide state-of-the-art performance on our test set for measuring syntactic and semantic word similarities

Seymour's second neighborhood conjecture for tournaments missing a generalized star

Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted version holds for tournaments missing a sun, star, or a complete graph.Comment: Accepted for publication in Journal of Graph Theory in 24 June 201

Improved Approximation Algorithms for Stochastic Matching

In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are executing a process, which one-by-one probes the edges and gradually constructs a matching. The process is constrained in two ways: once an edge is taken it cannot be removed from the matching, and the timeout of node $v$ upper-bounds the number of edges incident to $v$ that can be probed. The goal is to maximize the expected profit of the constructed matching. For this problem Bansal et al. (Algorithmica 2012) provided a $3$-approximation algorithm for bipartite graphs, and a $4$-approximation for general graphs. In this work we improve the approximation factors to $2.845$ and $3.709$, respectively. We also consider an online version of the bipartite case, where one side of the partition arrives node by node, and each time a node $b$ arrives we have to decide which edges incident to $b$ we want to probe, and in which order. Here we present a $4.07$-approximation, improving on the $7.92$-approximation of Bansal et al. The main technical ingredient in our result is a novel way of probing edges according to a random but non-uniform permutation. Patching this method with an algorithm that works best for large probability edges (plus some additional ideas) leads to our improved approximation factors

On creep-fatigue endurance of TIG-dressed weldments using the linear matching method

This paper is devoted to parametric study on creep-fatigue endurance of the steel type 316N(L) weldments at 550◦C identified as type 3 according to R5 Vol. 2/3 procedure classification. The study is implemented using a direct method known as the Linear Matching Method (LMM) and based upon the creep-fatigue evaluation procedure considering time fraction rule for creep-damage assessment. Seven configurations of the weldment, characterised by particular values of a geometrical parameter ρ, are proposed. Parameter ρ, which represents different grades of TIG dressing, is a ratio between the radius of the fillet of the remelted metal on a weld toe and the thickness of welded plates. For each configuration, the total number of cycles to failure N⋆ in creep-fatigue conditions is assessed numerically for different loading cases defined by normalised bending moment ˜M and dwell period t. The obtained set of N⋆ is extrapolated by the analytic function dependent on ˜M, t and parameter ρ. Proposed function for N⋆ shows good agreement with numerical results obtained by the LMM. Therefore, it is used for the identification of Fatigue Strength Reduction Factors (FSRFs) effected by creep, which are intended for design purposes, and dependent on t and ρ

Collectivist values for productive teamwork between Korean and Chinese employees

The global marketplace increasingly demands that cultural diverse people work together but studies have documented important barriers to inter-cultural collaboration. Researchers have argued the need to study intercultural interaction directly in order to develop knowledge that diverse people can use to overcome obstacles and work productively. This study proposes that collectivist values are a basis upon which Korean and Chinese colleagues working in joint ventures in China develop quality collegial relationships and thereby work productively together. Chinese employees completed measures of collectivist and individualist values in their relationships with a Korean colleague. The Korean partners completed measures of collegial relationships, productivity, and confidence of future collaboration. In addition to supporting that collectivist values can promote quality collegial relationships, findings support the theorizing that quality relationships facilitate productive collaborative work. Results suggest that collectivist values can be an important basis for Korean and Chinese employees to develop a common platform where they work together productively across cultural boundaries

Inequalities for Light Nuclei in the Wigner Symmetry Limit

Using effective field theory we derive inequalities for light nuclei in the Wigner symmetry limit. This is the limit where isospin and spin degrees of freedom can be interchanged. We prove that the energy of any three-nucleon state is bounded below by the average energy of the lowest two-nucleon and four-nucleon states. We show how this is modified by lowest-order terms breaking Wigner symmetry and prove general energy convexity results for SU(N). We also discuss the inclusion of Wigner-symmetric three and four-nucleon force terms.Comment: 10 page