Congregational Composition and Explanations for Racial Inequality Among Black Religious Affiliates

Prior research suggests that congregational characteristics are associated with the racial attitudes of Black churchgoers. This study examines the relationship between congregational diversity and beliefs about the Black/White socioeconomic gap among Black religious adherents. Drawing upon pooled data from the General Social Survey and the National Congregations Study, we fit binary logistic regression models to estimate the association between congregational diversity and the explanations of Black/White economic inequality among Black religious adherents. Findings from our study reveal that congregational diversity is one factor that accounts for intragroup differences in racial attitudes among Black religious affiliates. Relative to Blacks that attend religious services in overwhelmingly Black congregations, Blacks that attend religious services in congregations that are overwhelmingly White are significantly less likely to attribute Black/White socioeconomic gaps to a lack of educational opportunities. Our study demonstrates that congregational diversity is a source of intragroup variation in racial attitudes among Black religious affiliates, which may attenuate the ability of such congregations to bridge racial divisions.     

African American Adolescents’ Psychological Well-Being: The Impact of Parents’ Religious Socialization on Adolescents’ Religiosity

The dearth of research literature on the religious beliefs and practices of African American adolescents has led to increased empirical inquiry, yet a lack of research considers African American adolescents’ religious beliefs and practices as an important developmental milestone. This study explored how African American parents’ religious socialization affected youth religious experiences and served as a culturally specific strength-based asset that promotes psychological well-being. Our sample included a socioeconomically diverse sample of 154 African American families. Accounting for demographics, adolescents’ relationship and communication with God were found to be associated with a healthier psychological well-being. Additionally, parents’ religious socialization impacted the relationship between youths religious beliefs and practice and psychological well-being. Overall, results suggest that parents’ and adolescents’ religious beliefs can promote psychological well-being.     

Mosque-Based Social Support and Collective and Personal Self-Esteem Among Young Muslim American Adults

This study investigated the association between congregational relationships and personal and collective self-esteem among young Muslim American adults. Mosque-based emotional support and negative interactions with congregants were assessed in relation to personal and collective self-esteem. Data analysis was based on a sample of 231 respondents residing in southeast Michigan. Results indicated that receiving emotional support from congregants was associated with higher levels of collective self-esteem but was unassociated with personal self-esteem. Negative interaction with congregants was associated with personal self-esteem. Together, these findings indicate that mosque-based emotional support and negative interactions function differently for personal and collective self-esteem, which provides evidence that although personal and collective self-esteem are interrelated constructs, they are also conceptually discrete aspects self-evaluations.     

Was <Emphasis Type="Italic">that</Emphasis> Racist? An Experimental Study of Microaggression Ambiguity and Emotional Reactions for Racial–Ethnic Minority and White Individuals

This study examined racial–ethnic minority and white identified participants’ perceptions of racial microaggressions in four video scenarios involving a white professor and a black student. Participants (N = 261) were randomly assigned to observe a one of the four video conditions. The video involved an interaction with no microaggression, a very ambiguous microaggression, an ambiguous microaggression, or an overt microaggression. Participants rated their observations of (a) negative emotions toward the committer (white professor) and receiver (black student) of the microaggression, (b) positive emotions toward the committer and receiver of the microaggression, (c) perceptions on the degree of biasedness of committer, and (d) degree of positive perceptions of the committer. Analysis compared ratings of two groups, including racial–ethnic minority and white observers. We found a significant difference between the overt condition and other three conditions on negative emotions, positive emotions, and attributions of the professor (i.e., cultural biasedness and positive perceptions). However, there were no differences between the no microaggression, very ambiguous, and ambiguous conditions. No significant differences between racial–ethnic minority and white participants’ ratings were detected. Implications for training, practice, and future research are offered in our discussion.     

Who is More Likely to “Not See Race”? Individual Differences in Racial Colorblindness

Many Americans endorse a colorblind racial ideology, meaning they strive to “not see race” and emphasize sameness and equal distribution of resources across racial lines. Currently, there is an absence of studies examining the personality and individual difference correlates of racial colorblindness. The current study investigated the association between three different aspects of racial colorblindness (unawareness of racial privilege, unawareness of institutional discrimination, and unawareness of blatant racism) and the Big 5, empathy, and aggression in white undergraduates. Our results revealed two divergent patterns. Unawareness of racial privilege was related to lower openness and perspective taking, but more empathic concern, whereas unawareness of blatant racism and unawareness of institutional discrimination were related to lower agreeableness, perspective taking, and empathic concern. These results are discussed in relation to the broader literature on prejudice and personality.     

On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

The Kidney Exchange Problem (KEP) is a combinatorial optimization problem and has attracted the attention from the community of integer programming/combinatorial optimisation in the past few years. Defined on a directed graph, the KEP has two variations: one concerns cycles only, and the other, cycles as well as chains on the same graph. We call the former a Cardinality Constrained Multi-cycle Problem (CCMcP) and the latter a Cardinality Constrained Cycles and Chains Problem (CCCCP). The cardinality for cycles is restricted in both CCMcP and CCCCP. As for chains, some studies in the literature considered cardinality restrictions, whereas others did not. The CCMcP can be viewed as an Asymmetric Travelling Salesman Problem that does allow subtours, however these subtours are constrained by cardinality, and that it is not necessary to visit all vertices. In existing literature of the KEP, the cardinality constraint for cycles is usually considered to be small (to the best of our knowledge, no more than six). In a CCCCP, each vertex on the directed graph can be included in at most one cycle or chain, but not both. The CCMcP and the CCCCP are interesting and challenging combinatorial optimization problems in their own rights, particularly due to their similarities to some travelling salesman- and vehicle routing-family of problems. In this paper, our main focus is to review the existing mathematical programming models and solution methods in the literature, analyse the performance of these models, and identify future research directions. Further, we propose a polynomial-sized and an exponential-sized mixed-integer linear programming model, discuss a number of stronger constraints for cardinality-infeasible-cycle elimination for the latter, and present some preliminary numerical results.     

Maximum cardinality neighbourly sets in quadrilateral free graphs

Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (Discret Appl Math 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an \(O(n^{11})\) algorithm for the same, here n is the number of vertices in the graph, (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in \(O(n^5)\) running time). In this paper we propose an \(O(n^2)\) time algorithm for finding a maximum cardinality neighbourly set in a quadrilateral-free graph.     

A heuristic for the time constrained asymmetric linear sum assignment problem

The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an \(n \times m, m \ge n\) benefit matrix \(B = (b_{ij})\), matching each row to a different column so that the sum of entries at the row-column intersections is maximised. This paper describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version (\(n \ne m\)) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment between two proteins, normally of different numbers of amino acids, needs to be maximised.     

Online MapReduce scheduling problem of minimizing the makespan

MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is \(\frac{m+m(\Psi (m)-\Psi (k))}{k+m(\Psi (m)-\Psi (k))}\), higher than the basic online machine scheduling problem, where k is the root of the equation \(k=\big \lfloor {\frac{m-k}{1+\Psi (m)-\Psi (k)}+1 }\big \rfloor \) and m is the quantity of machines. Then we devise an \((2-\frac{1}{m})\)-competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines.