Competition and cooperation: An assessment and integration of seemingly paradoxical actions

Competition and cooperation represent two foundational elements within the strategic management research domain. While substantial research examining competition or cooperation exists, research assessing these two paradoxical actions simultaneously has been limited. This study leverages the attention based view of the firm and insights from literature examining organizational ambidexterity to further understand if, and how, these two seemingly contradictory actions are managed and leveraged by firms. First, this research identifies and assesses the extent to which attention within the firm shapes competitive and cooperative action. Further, this research conceptually defines and empirically tests curvilinear relationships between competitive and cooperative action and subsequent firm performance. Finally, this study predicts and tests the performance implications associated with balancing competitive and cooperative actions. The findings suggest that attention to cooperation is associated with subsequent cooperative action, and that the curvilinear relationship between cooperative action and firm performance is moderated by cooperative action diversity such that high levels of action diversity lead to poorer performance. In the context of competitive actions, the results are found to be nonsignficant, but present valuable opportunities for future research

Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model

We show how to multiply two n x n matrices S and T over semirings in the Congested Clique model, where n nodes communicate in a fully connected synchronous network using O(log{n})-bit messages, within O(nz(S)^{1/3} nz(T)^{1/3}/n + 1) rounds of communication, where nz(S) and nz(T) denote the number of non-zero elements in S and T, respectively. By leveraging the sparsity of the input matrices, our algorithm greatly reduces communication costs compared with general multiplication algorithms [Censor-Hillel et al., PODC 2015], and thus improves upon the state-of-the-art for matrices with o(n^2) non-zero elements. Moreover, our algorithm exhibits the additional strength of surpassing previous solutions also in the case where only one of the two matrices is such. Particularly, this allows to efficiently raise a sparse matrix to a power greater than 2. As applications, we show how to speed up the computation on non-dense graphs of 4-cycle counting and all-pairs-shortest-paths. Our algorithmic contribution is a new deterministic method of restructuring the input matrices in a sparsity-aware manner, which assigns each node with element-wise multiplication tasks that are not necessarily consecutive but guarantee a balanced element distribution, providing for communication-efficient multiplication. Moreover, this new deterministic method for restructuring matrices may be used to restructure the adjacency matrix of input graphs, enabling faster deterministic solutions for graph related problems. As an example, we present a new sparsity aware, deterministic algorithm which solves the triangle listing problem in O(m/n^{5/3} + 1) rounds, a complexity that was previously obtained by a randomized algorithm [Pandurangan et al., SPAA 2018], and that matches the known lower bound of Omega~(n^{1/3}) when m=n^2 of [Izumi and Le Gall, PODC 2017, Pandurangan et al., SPAA 2018]. Naturally, our triangle listing algorithm also implies triangle counting within the same complexity of O(m/n^{5/3} + 1) rounds, which is (possibly more than) a cubic improvement over the previously known deterministic O(m^2/n^3)-round algorithm [Dolev et al., DISC 2012]

Sensitivity of a subregional scale atmospheric inverse CO 2 modeling framework to boundary conditions

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/95175/1/jgrd16614.pd

Atmospheric inverse modeling to constrain regional‐scale CO 2 budgets at high spatial and temporal resolution

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/95480/1/jgrd15697.pd

Ethnicity and prevalence of multiple sclerosis in east London

This work has been supported by a non-promotional educational grant from Novartis to Queen Mary University of London (through KS). KS has been supported by a Higher Education Funding Council for England Clinical Senior Lectureship

The Iowa Homemaker vol.9, no.2

What the Graduate May Do by Mary Elva Sather, page 1 Art in Flower Arrangement by Ruth Dean, page 2 Here Comes the Bride by Dorothy Anderson, page 3 Grading Market Eggs by Jean Guthrie, page 3 Art and Artists, page 4 4-H Club by Mrs. Edith Barker, page 6 Home Economics Association by Marcia E. Turner, page 8 Mrs. Scott Takes a Vacation by Isabel Leith, page 10 Editorial, page 11 Alumnae News by Vera Caulum, page 1

BATSE Observations of the Piccinotti Sample of AGN

BATSE Earth occultation data have been used to search for emission in the 20-100 keV band from all sources in the Piccinotti sample, which represents to date the only complete 2-10 keV survey of the extragalactic sky down to a limiting flux of 3.1 x 10^(-11) erg cm^(-2)$ s^(-1). Nearly four years of observations have been analyzed to reach a 5sigma sensitivity level of about 7.8x 10^(-11) erg cm^(-2) s^(-1) in the band considered. Of the 36 sources in the sample, 14 have been detected above 5sigma confidence level while marginal detection (3<sigma<5) can be claimed for 13 sources; for 9 objects 2sigma upper limits are reported. Comparison of BATSE results with data at higher energies is used to estimate the robustness of our data analysis: while the detection level of each source is reliable, the flux measurement maybe overestimated in some sources by as much as 35%, probably due to incomplete data cleaning. Comparison of BATSE fluxes with X-ray fluxes, obtained in the 2-10 keV range and averaged over years, indicates that a canonical power law of photon index 1.7 gives a good description of the broad band spectra of bright AGNs and that spectral breaks preferentially occur above 100 keV.Comment: 18 pages, 1 figure. Accepted for publication on Apj