1,254 research outputs found
It Takes A Man To Be A Soldier!
https://digitalcommons.library.umaine.edu/mmb-vp/4630/thumbnail.jp
Bonny white tender flowers : Beautiful Ballad
https://digitalcommons.library.umaine.edu/mmb-me/1013/thumbnail.jp
Only a Little Flower : Song and Chorus
https://digitalcommons.library.umaine.edu/mmb-me/1677/thumbnail.jp
My poor heart is sad with its dreaming
https://digitalcommons.library.umaine.edu/mmb-vp/4926/thumbnail.jp
Pretty as a Picture
https://digitalcommons.library.umaine.edu/mmb-me/1212/thumbnail.jp
SiO2-rich condrules in ordinary chondrites
The solar system abundances of Mg, Fe, and Si dictate that chondritic meteorites are silica-deficient compared to most terrestrial or lunar igneous rocks; thus olivine-orthopyroxene assemblages are commonly observed in ordinary chondrites. However, in the unequilibrated H-chondrites Sharps, Bremervorde, and Dhajala, we have observed chondrules and fragments which contain either tridymite or cristobalite as a major phase
The Landscape of Family Business Outcomes: A Summary and Numerical Taxonomy of Dependent Variables
To promote theoretical development in family business research, this research identified 327 dependent/outcome variables used in 257 empirical family business studies in 1998-2009. In four studies, the authors categorized outcome variables, developed a numerical taxonomy with seven clusters (performance, strategy, social and economic impact, governance, succession, family business roles, and family dynamics) plotted along two dimensions (business–family and short-term–long-term), validated their research, and identified missing outcome variables and variables that deserve more attention. Experts agree that family business roles, succession, and family dynamics make the family business domain unique and that noneconomic performance and family-specific topics deserve more attention
Tropical Dominating Sets in Vertex-Coloured Graphs
Given a vertex-coloured graph, a dominating set is said to be tropical if
every colour of the graph appears at least once in the set. Here, we study
minimum tropical dominating sets from structural and algorithmic points of
view. First, we prove that the tropical dominating set problem is NP-complete
even when restricted to a simple path. Then, we establish upper bounds related
to various parameters of the graph such as minimum degree and number of edges.
We also give upper bounds for random graphs. Last, we give approximability and
inapproximability results for general and restricted classes of graphs, and
establish a FPT algorithm for interval graphs.Comment: 19 pages, 4 figure
- …