Whitewashing the nation: racist jokes and the construction of the African ‘other’ in Greek popular cinema

This article explores representations of race in three Greek popular films of the 1970s and 1980s. The portrayal of African characters in these films is antagonistically positioned in relation to the dominant, ‘whitewashed’ Greek national narrative which relies on the nineteenth century idea that Greece is the progenitor of European civilization. Often masquerading itself as ‘just a joke’, the discourse of these films narrates the African Other as lacking in terms of culture, intelligence and beauty – the three central categories upon which the idea of the ‘white supremacy’, according to Cornell West, is historically constructed in modernity. Tightly woven with this idea (largely introduced in Greece by the leading European powers), these films enunciate explicitly colonial viewpoints in a country that was neither a colonial power nor at the geopolitical center of the European project. The article argues that the racialized representations of these films are an effect of appropriating the Eurocentric idea of historicism, where the ‘progress’ and ‘backwardness’ of groups and nations are measured according to how effectively they perform the values of modernity.     

A Tiered Framework for Risk‐Relevant Characterization and Ranking of Chemical Exposures: Applications to the National Children's Study (NCS)

A challenge for large‐scale environmental health investigations such as the National Children's Study (NCS), is characterizing exposures to multiple, co‐occurring chemical agents with varying spatiotemporal concentrations and consequences modulated by biochemical, physiological, behavioral, socioeconomic, and environmental factors. Such investigations can benefit from systematic retrieval, analysis, and integration of diverse extant information on both contaminant patterns and exposure‐relevant factors. This requires development, evaluation, and deployment of informatics methods that support flexible access and analysis of multiattribute data across multiple spatiotemporal scales. A new “Tiered Exposure Ranking” (TiER) framework, developed to support various aspects of risk‐relevant exposure characterization, is described here, with examples demonstrating its application to the NCS. TiER utilizes advances in informatics computational methods, extant database content and availability, and integrative environmental/exposure/biological modeling to support both “discovery‐driven” and “hypothesis‐driven” analyses. “Tier 1” applications focus on “exposomic” pattern recognition for extracting information from multidimensional data sets, whereas second and higher tier applications utilize mechanistic models to develop risk‐relevant exposure metrics for populations and individuals. In this article, “tier 1” applications of TiER explore identification of potentially causative associations among risk factors, for prioritizing further studies, by considering publicly available demographic/socioeconomic, behavioral, and environmental data in relation to two health endpoints (preterm birth and low birth weight). A “tier 2” application develops estimates of pollutant mixture inhalation exposure indices for NCS counties, formulated to support risk characterization for these endpoints. Applications of TiER demonstrate the feasibility of developing risk‐relevant exposure characterizations for pollutants using extant environmental and demographic/socioeconomic data.     

Stakeholder Perspectives on Children's Mental Health Needs and Supports in Six Low‐ and Middle‐Income Countries

Low‐ and middle‐income countries (LMIC) are faced with disproportionately high levels of unmet child mental health needs. This study explored through interviews the perspectives of 17 inter‐agency service stakeholders from Brazil, Indonesia, Kenya, Pakistan, Rwanda and Turkey on existing supports and challenges. Four themes emerged on the holistic nature of children's mental health needs linked with disadvantage; limited resources and skilled workforce; stigma; and strategies for future implementation, including awareness, parental engagement, skills‐based programmes and cultural adaptation. Stakeholder input is essential in conceptualising, developing and evaluating culturally appropriate interventions for vulnerable children in LMIC.     

On Approximability of Boolean Formula Minimization

For a Boolean function given by a Boolean formula (or a binary circuit) S we discuss the problem of building a Boolean formula (binary circuit) of minimal size, which computes the function g equivalent to , or -equivalent to , i.e., . In this paper we prove that if P NP then this problem can not be approximated with a good approximation ratio by a polynomial time algorithm.     

The wireless network jamming problem

In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for a set of jamming devices in order to neutralize a wireless communication network. This problem is known as the wireless network jamming problem. We develop several mathematical programming formulations based on covering the communication nodes and limiting the connectivity index of the nodes. Two case studies are presented comparing the formulations with the addition of various percentile constraints. Finally, directions of further research are addressed.     

Feature Selection for Consistent Biclustering via Fractional 0–1 Programming

Biclustering consists in simultaneous partitioning of the set of samples and the set of their attributes (features) into subsets (classes). Samples and features classified together are supposed to have a high relevance to each other which can be observed by intensity of their expressions. We define the notion of consistency for biclustering using interrelation between centroids of sample and feature classes. We prove that consistent biclustering implies separability of the classes by convex cones. While previous works on biclustering concentrated on unsupervised learning and did not consider employing a training set, whose classification is given, we propose a model for supervised biclustering, whose consistency is achieved by feature selection. The developed model involves solution of a fractional 0–1 programming problem. Preliminary computational results on microarray data mining problems are reported.This research work was partially supported by NSF, NIH and AirForce grants.     

Robust estimation methods for exponential data: a monte-carlo comparison

We compare the performance of seven robust estimators for the parameter of an exponential distribution. These include the debiased median and two optimally-weighted one-sided trimmed means. We also introduce four new estimators: the Transform, Bayes, Scaled and Bicube estimators. We make the Monte Carlo comparisons for three sample sizes and six situations. We evaluate the comparisons in terms of a new performance measure, Mean Absolute Differential Error (MADE), and a premium/protection interpretation of MADE. We organize the comparisons to enhance statistical power by making maximal use of common random deviates. The Transform estimator provides the best performance as judged by MADE. The singly-trimmed mean and Transform method define the efficient frontier of premium/protection.     

Sample Size Calculation for the Therapeutic Equivalence Problem

A method is proposed for the sample size calculation in the case of therapeutic equivalence of two pharmaceuticals, when the decision is based on post-treatment differences and the post-treatment values are dependent on the pretreatment ones. When the correlation coefficient is large (over 0.7), it is shown that sample size calculation (and the corresponding hypothesis test) based on the sample statistic formed by the mean difference of the post–pre differences of each group has smaller variance and hence leads to smaller sample sizes.     

A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations

In this paper a fast greedy sequential heuristic for the vertex colouring problem is presented. The suggested algorithm builds the same colouring of the graph as the well-known greedy sequential heuristic in which on every step the current vertex is coloured in the minimum possible colour. Our main contributions include introduction of a special matrix of forbidden colours and application of efficient bitwise operations on bit representations of the adjacency and forbidden colours matrices. Computational experiments show that in comparison with the classical greedy heuristic the average speedup of the developed approach is 2.6 times on DIMACS instances.