Saving the World, One Cadillac at a Time: What can be Done When a Religious or Chartiable Organization Commits Solicitation Fraud?

Recognizing that controversies involving religious and charitable organizations have puzzled the courts throughout this century, this paper will examine specific instances of religious and charitable fraud. It will discuss the potential remedies that are available by donors who fall victim to the perpetrators of this fraud. Finally this paper will suggest a more feasible method by which victims may recover than the conventional approaches

High water availability increases the negative impact of a native hemiparasite on its non-native host

Environmental factors alter the impacts of parasitic plants on their hosts. However, there have been no controlled studies on how water availability modulates stem hemiparasites' effects on hosts. A glasshouse experiment was conducted to investigate the association between the Australian native stem hemiparasite Cassytha pubescens and the introduced host Ulex europaeus under high (HW) and low (LW) water supply. Cassytha pubescens had a significant, negative effect on the total biomass of U. europaeus, which was more severe in HW than LW. Regardless of watering treatment, infection significantly decreased shoot and root biomass, nodule biomass, nodule biomass per unit root biomass, F-v/F-m, and nitrogen concentration of U. europaeus. Host spine sodium concentration significantly increased in response to infection in LW but not HW conditions. Host water potential was significantly higher in HW than in LW, which may have allowed the parasite to maintain higher stomatal conductances in HW. In support of this, the delta C-13 of the parasite was significantly lower in HW than in LW (and significantly higher than the host). C. pubescens also had significantly higher F-v/F-m and 66% higher biomass per unit host in the HW compared with the LW treatment. The data suggest that the enhanced performance of C. pubescens in HW resulted in higher parasite growth rates and thus a larger demand for resources from the host, leading to poorer host performance in HW compared with LW. C. pubescens should more negatively affect U. europaeus growth under wet conditions rather than under dry conditions in the field

30 % para 2030: América Latina e a nova meta global para seus sistemas de áreas protegidas

In October 2021, representatives of the countries that have ratified the Convention on Biological Diversity will meet in China to consider new goals for the next decade. There is a consensus that a new goal will be established to conserve, in protected areas, 30 % of the planet's surface, both on land and in the sea. This means doubling the current global coverage of terrestrial protected lands and tripling the coverage of marine areas by 2030. This article analyzes different approaches and tools needed to be used together to achieve this ambitious goal in Latin America and ensure that the management of both existing and new protected areas is more effective and equitable.En octubre de 2021, representantes de los países que han ratificado la Convención sobre la Diversidad Biológica se reunirán en China para considerar nuevas metas para el próximo decenio.  Hay consenso en que se establecerá una nueva meta para la conservación de áreas protegidas: 30 % de la superficie del planeta, tanto en tierra como en el mar, para 2030.  Esto significa duplicar la cobertura mundial actual de áreas protegidas terrestres, así como triplicar la cobertura de áreas marinas para 2030. Este artículo analiza diferentes enfoques y herramientas que serán necesarios utilizar conjuntamente, para intentar cumplir con esa meta ambiciosa en América Latina, no solo ampliar el sistema de áreas protegidas de América Latina, sino también asegurar que la gestión tanto de áreas ya existentes como nuevas sea más efectiva y equitativa. Em outubro de 2021, representantes dos países que ratificaram a Convenção sobre a diversidade Biológica se reunirão na China para considerar novos objetivos para a próxima década.  Já existe consenso quanto à criação de um novo objetivo de conservação em áreas protegidas: 30 % da superfície do planeta, tanto em terra como no mar, até 2030.  Isto significa duplicar a atual cobertura mundial de áreas protegidas terrestres, bem como triplicar a cobertura de áreas marinhas até 2030. Este artigo analisa diferentes abordagens e ferramentas que serão necessárias para se utilizar em conjunto, para tentar cumprir esse objetivo ambicioso na América Latina e não apenas expandir o sistema de áreas protegidas da América Latina, mas também assegurar que a gestão de áreas já existentes e novas seja mais eficaz e equitativa.&nbsp

Intrusion-aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.Comment: 19 pages, 7 figure

Byzantine Gathering in Networks

This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the minimum number M of good agents that guarantees deterministic gathering of all of them, with termination? We provide exact answers to this open problem by considering the case when the agents initially know the size of the network and the case when they do not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2. More precisely, for networks of known size, we design a deterministic algorithm gathering all good agents in any network provided that the number of good agents is at least f+1. For networks of unknown size, we also design a deterministic algorithm ensuring the gathering of all good agents in any network but provided that the number of good agents is at least f+2. Both of our algorithms are optimal in terms of required number of good agents, as each of them perfectly matches the respective lower bound on M shown in [14], which is of f+1 when the size of the network is known and of f+2 when it is unknown

Constraint Based System-Level Diagnosis of Multiprocessors

Massively parallel multiprocessors induce new requirements for system-level fault diagnosis, like handling a huge number of processing elements in an inhomogeneous system. Traditional diagnostic models (like PMC, BGM, etc.) are insufficient to fulfill all of these requirements. This paper presents a novel modelling technique, based on a special area of artificial intelligence (AI) methods: constraint satisfaction (CS). The constraint based approach is able to handle functional faults in a similar way to the Russel-Kime model. Moreover, it can use multiple-valued logic to deal with system components having multiple fault modes. The resolution of the produced models can be adjusted to fit the actual diagnostic goal. Consequently, constrint based methods are applicable to a much wider range of multiprocessor architectures than earlier models. The basic problem of system-level diagnosis, syndrome decoding, can be easily transformed into a constraint satisfaction problem (CSP). Thus, the diagnosis algorithm can be derived from the related constraint solving algorithm. Different abstraction leveles can be used for the various diagnosis resolutions, employing the same methodology. As examples, two algorithms are described in the paper; both of them is intended for the Parsytec GCel massively parallel system. The centralized method uses a more elaborate system model, and provides detailed diagnostic information, suitable for off-line evaluation. The distributed method makes fast decisions for reconfiguration control, using a simplified model. Keywords system-level self-diagnosis, massively parallel computing systems, constraint satisfaction, diagnostic models, centralized and distributed diagnostic algorithms

Quinones as dienophiles in the Diels-Alder reaction: history and applications in total synthesis

In the canon of reactions available to the organic chemist engaged in total synthesis, the Diels–Alder reaction is among the most powerful and well understood. Its ability to rapidly generate molecular complexity through the simultaneous formation of two carboncarbon bonds is almost unrivalled, and this is reflected in the great number of reported applications of this reaction. Historically, the use of quinones as dienophiles is highly significant, being the very first example investigated by Diels and Alder. Herein, we review the application of the Diels–Alder reaction of quinones in the total synthesis of natural products. The highlighted examples span some 60 years from the landmark syntheses of morphine (1952) and reserpine (1956) by Gates and Woodward, respectively, through to the present day examples, such as the tetracyclines

Kinematicke a dynamicke parametre podavacieho mechanizmu sijaceho stroja.

Available from STL, Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi