Precedence-constrained scheduling problems parameterized by partial order width

Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we show that Shuffle Product, the problem of deciding whether a given word can be obtained by interleaving the letters of $k$ other given words, is W[2]-hard parameterized by $k$, thus additionally answering a question posed by Rizzi and Vialette (CSR 2013). Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled. Oper. 7(1):75-82), we show that the more general Resource-Constrained Project Scheduling problem is fixed-parameter tractable parameterized by the partial order width combined with the maximum allowed difference between the earliest possible and factual starting time of a job.Comment: 14 pages plus appendi

But Not Both:The Exclusive Disjunction in Qualitative Comparative Analysis (QCA)

The application of Boolean logic using Qualitative Comparative Analysis (QCA) is becoming more frequent in political science but is still in its relative infancy. Boolean ‘AND’ and ‘OR’ are used to express and simplify combinations of necessary and sufficient conditions. This paper draws out a distinction overlooked by the QCA literature: the difference between inclusive- and exclusive-or (OR and XOR). It demonstrates that many scholars who have used the Boolean OR in fact mean XOR, discusses the implications of this confusion and explains the applications of XOR to QCA. Although XOR can be expressed in terms of OR and AND, explicit use of XOR has several advantages: it mirrors natural language closely, extends our understanding of equifinality and deals with mutually exclusive clusters of sufficiency conditions. XOR deserves explicit treatment within QCA because it emphasizes precisely the values that make QCA attractive to political scientists: contextualization, confounding variables, and multiple and conjunctural causation

BDD-based heuristics for binary optimization

In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems

Keeping the Faith: African American Faith Leaders’ Perspectives and Recommendations for Reducing Racial Disparities in HIV/AIDS Infection

In Philadelphia, 66% of new HIV infections are among African Americans and 2% of African Americans are living with HIV. The city of Philadelphia has among the largest numbers of faith institutions of any city in the country. Although faith-based institutions play an important role in the African American community, their response to the AIDS epidemic has historically been lacking. We convened 38 of Philadelphia’s most influential African American faith leaders for in-depth interviews and focus groups examining the role of faith-based institutions in HIV prevention. Participants were asked to comment on barriers to engaging faith-based leaders in HIV prevention and were asked to provide normative recommendations for how African American faith institutions can enhance HIV/AIDS prevention and reduce racial disparities in HIV infection. Many faith leaders cited lack of knowledge about Philadelphia’s racial disparities in HIV infection as a common reason for not previously engaging in HIV programs; others noted their congregations’ existing HIV prevention and outreach programs and shared lessons learned. Barriers to engaging the faith community in HIV prevention included: concerns about tacitly endorsing extramarital sex by promoting condom use, lack of educational information appropriate for a faith-based audience, and fear of losing congregants and revenue as a result of discussing human sexuality and HIV/AIDS from the pulpit. However, many leaders expressed a moral imperative to respond to the AIDS epidemic, and believed clergy should play a greater role in HIV prevention. Many participants noted that controversy surrounding homosexuality has historically divided the faith community and prohibited an appropriate response to the epidemic; many expressed interest in balancing traditional theology with practical public health approaches to HIV prevention. Leaders suggested the faith community should: promote HIV testing, including during or after worship services and in clinical settings; integrate HIV/AIDS topics into health messaging and sermons; couch HIV/AIDS in social justice, human rights and public health language rather than in sexual risk behavior terms; embrace diverse approaches to HIV prevention in their houses of worship; conduct community outreach and host educational sessions for youth; and collaborate on a citywide, interfaith HIV testing and prevention campaign to combat stigma and raise awareness about the African American epidemic. Many African American faith-based leaders are poised to address racial disparities in HIV infection. HIV prevention campaigns should integrate leaders’ recommendations for tailoring HIV prevention for a faith-based audience

Ubiquitous molecular substrates for associative learning and activity-dependent neuronal facilitation.

Recent evidence suggests that many of the molecular cascades and substrates that contribute to learning-related forms of neuronal plasticity may be conserved across ostensibly disparate model systems. Notably, the facilitation of neuronal excitability and synaptic transmission that contribute to associative learning in Aplysia and Hermissenda, as well as associative LTP in hippocampal CA1 cells, all require (or are enhanced by) the convergence of a transient elevation in intracellular Ca2+ with transmitter binding to metabotropic cell-surface receptors. This temporal convergence of Ca2+ and G-protein-stimulated second-messenger cascades synergistically stimulates several classes of serine/threonine protein kinases, which in turn modulate receptor function or cell excitability through the phosphorylation of ion channels. We present a summary of the biophysical and molecular constituents of neuronal and synaptic facilitation in each of these three model systems. Although specific components of the underlying molecular cascades differ across these three systems, fundamental aspects of these cascades are widely conserved, leading to the conclusion that the conceptual semblance of these superficially disparate systems is far greater than is generally acknowledged. We suggest that the elucidation of mechanistic similarities between different systems will ultimately fulfill the goal of the model systems approach, that is, the description of critical and ubiquitous features of neuronal and synaptic events that contribute to memory induction

A New Ranking Method Approach for Decision Making in Maintenance Management

Decision making process in maintenance management produces a final choice. Fault Tree Analysis (FTA) is proposed as a graphical representation of logical relationships between the elements that comprise the decision making process in maintenance management. A Fault Tree (FT) is compound by different events and logic gates. Complex systems analysis may produce thousands of combinations of events (cut-sets) that can cause the system failure. The determination of these cut-sets can be a large and time-consuming process even on modern computers. Binary Decision Diagrams (BDD) provides a new alternative to the traditional cut-set based approach for FTA that leads to the determination of the function output value through the examination of the input values. BDD is a directed acyclic graph that represents the Boolean functions. The cut sets generated by BDD will depend on the events ordering. The “Level”, “Top-Down-Left–Right”, “AND”, “Depth-First Search” and “Breadth-First Search” methods have been considered for listing the events, and a comparative analysis of them has been done. A new ranking approach is proposed in this paper, where its efficiency has been validated

The Connection Layout in a Lattice of Four-Terminal Switches

A non classical approach to the logic synthesis of Boolean functions based on switching lattices is considered, for which deriving a feasible layout has not been previously studied. All switches controlled by the same literal must be connected together and to an input lead of the chip, and the layout of such connections must be realized in superimposed layers. Inter-layer connections are realized with vias, with the overall goal of minimizing the number of layers needed. The problem shows new interesting combinatorial and algorithmic aspects. Since the specific lattice cell where each switch is placed can be decided with a certain amount of freedom, and one literal among several may be assigned for controlling a switch, we first study a lattice rearrangement (Problem 1) and a literal assignment (Problem 2), to place in adjacent cells as many switches controlled by the same literal as possible. Then we study how to build a feasible layout of connections onto different layers using a minimum number of such layers (Problem 3). We prove that Problem 2 is NP-hard, and Problems 1 and 3 appear also intractable. Therefore we propose heuristic algorithms for the three phases that show an encouraging performance on a set of standard benchmarks