66 research outputs found

    Infusing Critical Thinking into Communication Courses

    Get PDF
    The importance of critical thinking is generally recognized by educators and during the past 20 years numerous initiatives have been taken to improve critical thinking. Although research demonstrates courses in communication study can have a positive impact on critical thinking skills, we argue that instruction in critical thinking can be more explicitly covered in basic communication courses. This article details our efforts to infuse critical thinking into an entrylevel communication course and outlines a guide to help communication teachers integrate critical thinking into their courses

    Filling a blank on the map: 60 years of fisheries in Equatorial Guinea

    Get PDF
    Despite a scarcity of pertinent information, it has been possible to reconstruct time series of marine fisheries catches for Equatorial Guinea from 1950 to 2010 using per capita fish consumption and population numbers for small-scale fisheries, catch rates and number of vessels for industrial fisheries and discard rates to estimate the discarded bycatch. Small-scale fisheries, industrial large-scale fisheries, domestic and legal and illegal foreign fisheries and their discards are all included. Total catches were estimated at 2.7 million tonnes over the time period considered, of which 653 000 t were caught domestically compared to 187 000 t reported by FAO. This shows that fisheries have more importance for Equatorial Guinea's food security than the official data suggest. In contrast to what is suggested by official figures, fisheries were shown to be strongly impacted by civil and political unrest; notably, they declined overall because of civil and political conflicts, socio-demographic dynamics, and a growing role of the newly discovered oil resources, which directly and indirectly threaten the food security of the people of Equatorial Guinea

    Solving Linux Upgradeability Problems Using Boolean Optimization

    Full text link
    Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and systems are expected to be reliable and consistent after that. For each package in the system, a set of dependencies and a set of conflicts have to be taken into account. Although this problem is computationally hard to solve, efficient tools are required. In the best scenario, the solutions provided should also be optimal in order to better fulfill users requirements and expectations. This paper describes two different tools, both based on Boolean satisfiability (SAT), for solving Linux upgradeability problems. The problem instances used in the evaluation of these tools were mainly obtained from real environments, and are subject to two different lexicographic optimization criteria. The developed tools can provide optimal solutions for many of the instances, but a few challenges remain. Moreover, it is our understanding that this problem has many similarities with other configuration problems, and therefore the same techniques can be used in other domains.Comment: In Proceedings LoCoCo 2010, arXiv:1007.083

    Introducing LoCo, a Logic for Configuration Problems

    Full text link
    In this paper we present the core of LoCo, a logic-based high-level representation language for expressing configuration problems. LoCo shall allow to model these problems in an intuitive and declarative way, the dynamic aspects of configuration notwithstanding. Our logic enforces that configurations contain only finitely many components and reasoning can be reduced to the task of model construction.Comment: In Proceedings LoCoCo 2011, arXiv:1108.609

    Global delivery models: the role of talent, speed and time zones in the global outsourcing industry

    Get PDF
    Global delivery models (GDMs) are transforming the global IT and business process outsourcing industry. GDMs are a new form of client-specific investment promoting service integration with clients by combining client proximity with time-zone spread for 24/7 service operations. We investigate antecedents and contingencies of setting up GDM structures. Based on comprehensive data we show that providers are likely to establish GDM location configurations when clients value access to globally distributed talent and speed of service delivery, in particular when services are highly commoditized. Findings imply that coordination across time zones increasingly affects international operations in business-to-business and born-global industries

    A Proof Theoretic Analysis of Intruder Theories

    Full text link
    We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like systems and proving decidability requires significant effort in showing that the rules are "local" in some sense. By using the well-known translation between natural deduction and sequent calculus, we recast the intruder deduction problem as proof search in sequent calculus, in which locality is immediate. Using standard proof theoretic methods, such as permutability of rules and cut elimination, we show that the intruder deduction problem can be reduced, in polynomial time, to the elementary deduction problem, which amounts to solving certain equations in the underlying individual equational theories. We show that this result extends to combinations of disjoint AC-convergent theories whereby the decidability of intruder deduction under the combined theory reduces to the decidability of elementary deduction in each constituent theory. To further demonstrate the utility of the sequent-based approach, we show that, for Dolev-Yao intruders, our sequent-based techniques can be used to solve the more difficult problem of solving deducibility constraints, where the sequents to be deduced may contain gaps (or variables) representing possible messages the intruder may produce.Comment: Extended version of RTA 2009 pape
    corecore