排序方式: 共有24条查询结果,搜索用时 15 毫秒
1.
Theodore D. Wachs German Posada Olga A. Carbonell Hillary Creed‐Kanashiro Pinar Gurkas 《Infancy》2011,16(1):91-111
A notable omission in studies of developmental links to early nutritional deficiencies is infant attachment. In those few studies investigating associations between infant nutrition and attachment, nutrition was defined solely by physical growth, and infants had moderate–severe growth retardation. In this study, we utilized multiple markers of infant nutrition. Our sample consisted of 172 12‐month‐old Peruvian infants and their mothers from low‐income families, with a follow‐up assessment on 77 infants at 18 months. Infants were not severely malnourished, but did have micronutrient deficiencies. Anthropometry, dietary intake, and iron status were used as measures of infant nutrition. Based on infant behavior in a structured laboratory situation, Q‐sort techniques were used to rate three attachment markers: infant secure base behavior, interaction quality, and negative emotionality with mother. At 12 months, infant weight was positively related to interaction quality. At 18 months, infant iron status was positively related to secure base behavior. This pattern of findings remained even after statistically controlling for family socioeconomic status and maternal education. Our findings indicate that infant nutritional status is associated with markers of infant attachment and these associations are not restricted just to severely malnourished infants. 相似文献
2.
Pinar Okur Noemí Pereda Leontien M. Van Der Knaap Stefan Bogaerts 《Journal of child sexual abuse》2013,22(3):301-317
ABSTRACTAccording to the attribution theory, negative outcomes of child sexual abuse (CSA) are thought to vary depending on whether CSA victims attribute the abuse to internal or external factors, respectively, self-blame and perpetrator-blame. Therefore, the purpose of this study was to identify abuse characteristics and attitudes that influence blame attributions among CSA victims from a community sample. Data from respondents with a history of CSA (N = 1,496) have been used in predicting blame attributions; perpetrator-blame, self-blame, or both. Results from a multinomial logistic regression analysis showed that attitudes toward gender roles had a significant effect on blame: victims were more likely to blame themselves when they endorsed more conservative gender attitudes than victims with more liberal attitudes. Implications for this finding are discussed. 相似文献
3.
zlem Ergun Luyi Gui Jessica L. Heier Stamm Pinar Keskinocak Julie Swann 《Production and Operations Management》2014,23(6):1002-1014
Humanitarian supply chains involve many different entities, such as government, military, private, and non‐governmental organizations and individuals. Well‐coordinated interactions between entities can lead to synergies and improved humanitarian outcomes. Information technology (IT) tools can help facilitate collaboration, but cost and other barriers have limited their use. We document the use of an IT tool to improve last‐mile supply distribution and data management in one of many camps for internally displaced persons after the January 2010 earthquake in Haiti, and we describe other current uses of technology in camp management. Motivated by these examples and the interest among humanitarian organizations in expanding the use of such tools to facilitate coordination, we introduce a cooperative game theory model and explore insights about the conditions under which multi‐agency coordination is feasible and desirable. We also outline an agenda for future research in the area of technology‐enabled collaboration in the humanitarian sector. 相似文献
4.
5.
6.
7.
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions 总被引:2,自引:0,他引:2
M. Dawande J. Kalagnanam P. Keskinocak F.S. Salman R. Ravi 《Journal of Combinatorial Optimization》2000,4(2):171-186
Motivated by a real world application, we study the multiple knapsack problem with assignment restrictions (MKAR). We are given a set of items, each with a positive real weight, and a set of knapsacks, each with a positive real capacity. In addition, for each item a set of knapsacks that can hold that item is specified. In a feasible assignment of items to knapsacks, each item is assigned to at most one knapsack, assignment restrictions are satisfied, and knapsack capacities are not exceeded. We consider the objectives of maximizing assigned weight and minimizing utilized capacity.We focus on obtaining approximate solutions in polynomial computational time. We show that simple greedy approaches yield 1/3-approximation algorithms for the objective of maximizing assigned weight. We give two different 1/2-approximation algorithms: the first one solves single knapsack problems successively and the second one is based on rounding the LP relaxation solution. For the bicriteria problem of minimizing utilized capacity subject to a minimum requirement on assigned weight, we give an (1/3,2)-approximation algorithm. 相似文献
8.
Review of Economics of the Household - This paper explores the effect of violent crime on teenage pregnancy in Mexico using data from a nationally representative longitudinal survey conducted... 相似文献
9.
Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan 《Journal of Combinatorial Optimization》2011,22(3):438-456
A graph class is sandwich monotone if, for every pair of its graphs G
1=(V,E
1) and G
2=(V,E
2) with E
1⊂E
2, there is an ordering e
1,…,e
k
of the edges in E
2∖E
1 such that G=(V,E
1∪{e
1,…,e
i
}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open
question by Bakonyi and Bono (Czechoslov. Math. J. 46:577–583, 1997). So far, very few classes have been proved to be sandwich monotone, and the most famous of these are chordal graphs. Sandwich
monotonicity of a graph class implies that minimal completions of arbitrary graphs into that class can be recognized and computed
in polynomial time. For minimal completions into strongly chordal or chordal bipartite graphs no polynomial-time algorithm
has been known. With our results such algorithms follow for both classes. In addition, from our results it follows that all
strongly chordal graphs and all chordal bipartite graphs with edge constraints can be listed efficiently. 相似文献
10.
Feryal Erhun Pinar Keskinocak Sridhar Tayur 《Production and Operations Management》2008,17(5):543-550
We study a model with a single supplier and a single buyer who interact multiple times before the buyer sells her product in the end‐consumer market. We show that when the supplier uses a wholesale price contract, even under perfect foresight, the supplier, the buyer, and the end consumers benefit from multiple trading opportunities versus a one‐shot procurement agreement. 相似文献