Closing the Resource Gap: Strengthening the Nonprofit Sector in California

With support from The James Irvine Foundation, Nonprofit Finance Fund (NFF) used its 2015 State of the Nonprofit Sector Survey to examine California nonprofits, focusing on organizations in the San Joaquin Valley and the Inland Empire. The Foundation asked NFF to look at the challenges facing organizations in these regions, their resource needs, and their overall financial situations both on an absolute basis and in comparison to their coastal neighbors in the Bay Area and Los Angeles

A Statewide Study of Neighbors\u27 Knowledge of and Reactions to Physical Child Abuse

Neighbors are believed to have an important influence on child abuse prevention and intervention. This article reports the results of a statewide telephone survey of Kentucky (n = 650) which examined the extent to which respondents suspected neighbors of child abuse (9.4%), and had ever taken in a neighbor\u27s abused or neglected child (7.2%). Variables related to parenting (having a minor child, age, employment status, receiving AFDC benefits) were the only demographic characteristics significantly associated with suspicion of neighbors\u27 abuse; only being the parent of a minor child was significantly associated with taking in a neighbor\u27s child. The results imply that knowledge of and informal intervention in neighbors\u27 child abuse or neglect are related to direct knowledge of the victims through their interactions with one\u27s own children. Programs to enhance neighbors\u27 prevention of or early intervention in child abuse or neglect situations would be most efficient if directed at parents of minor children

Trust-based security for the OLSR routing protocol

International audienceThe trust is always present implicitly in the protocols based on cooperation, in particular, between the entities involved in routing operations in Ad hoc networks. Indeed, as the wireless range of such nodes is limited, the nodes mutually cooperate with their neighbors in order to extend the remote nodes and the entire network. In our work, we are interested by trust as security solution for OLSR protocol. This approach fits particularly with characteristics of ad hoc networks. Moreover, the explicit trust management allows entities to reason with and about trust, and to take decisions regarding other entities. In this paper, we detail the techniques and the contributions in trust-based security in OLSR. We present trust-based analysis of the OLSR protocol using trust specification language, and we show how trust-based reasoning can allow each node to evaluate the behavior of the other nodes. After the detection of misbehaving nodes, we propose solutions of prevention and countermeasures to resolve the situations of inconsistency, and counter the malicious nodes. We demonstrate the effectiveness of our solution taking different simulated attacks scenarios. Our approach brings few modifications and is still compatible with the bare OLSR

Pricing in Social Networks with Negative Externalities

We study the problems of pricing an indivisible product to consumers who are embedded in a given social network. The goal is to maximize the revenue of the seller. We assume impatient consumers who buy the product as soon as the seller posts a price not greater than their values of the product. The product's value for a consumer is determined by two factors: a fixed consumer-specified intrinsic value and a variable externality that is exerted from the consumer's neighbors in a linear way. We study the scenario of negative externalities, which captures many interesting situations, but is much less understood in comparison with its positive externality counterpart. We assume complete information about the network, consumers' intrinsic values, and the negative externalities. The maximum revenue is in general achieved by iterative pricing, which offers impatient consumers a sequence of prices over time. We prove that it is NP-hard to find an optimal iterative pricing, even for unweighted tree networks with uniform intrinsic values. Complementary to the hardness result, we design a 2-approximation algorithm for finding iterative pricing in general weighted networks with (possibly) nonuniform intrinsic values. We show that, as an approximation to optimal iterative pricing, single pricing can work rather well for many interesting cases, but theoretically it can behave arbitrarily bad