Zintegrowane kształcenie przedmiotowo-językowe. Dydaktyka zadaniowa a rozwój osobistej kompetencji komunikacyjnej w warunkach półautonomii

Wydział Neofilologii

Radiowe audycje umuzykalniające Marii Wieman jako forma wychowania muzycznego w przedszkolu. Analiza audycji z lat 1948-1976

Wydział Studiów Edukacyjnych: Zakład Edukacji Artystycznej

Autor filmowy według przepisów prawa w systemach droit d`auteur i copyright. Zarys problematyki

The aim of the article is to outline the key issues surrounding legal notions of film authorship. For scholars interested in studying the process of production it is extremely important to analyze the status and scope of power of its participants as well as their position in the hierarchy – one of the main sources of priveleges is the fact of being recognized by the law as the author of the work produced. The article depicts the benefits of such situation, but its main aim is to descibe the legal rules of granting the status of the author. Outlined are the issues emerged from the two radically different legal system – european droit d`auteur tradition and american copyright. The first one honours the artists while the other focuses mostly on providing the certainty of the economics, so the actual authors of the work are not that important. The paper points to the fact that – especially in the case of american copyright – the actual (determined by law) situation of a creator may differ significantly from the character of their contribution to the process of producing a film. Analysis of the rules and principles of the law is essential to the understanding of the structural determinants of film production and deserves no less attention than social, political and economic factors.

W stronę uniwersytetu jako instytucji dobra wspólnego. Filozoficzne podstawy krytycznych badań nad szkolnictwem wyższym

Wydział Nauk Społecznych: Instytut Filozofii

Analityczna filozofia dziejów w poznańskiej szkole metodologicznej. Próba falsyfikacji Popperowskiej krytyki historii teoretycznej

The purpose of this paper is the reconstruction of the theory of historical process elaborated at the Poznań School of Methodology. The heuristic tool will be Popper’s model of knowledge, according to which, the development of scientific theory went through the phase of the posing of the scientific problem, proposing a tentative theory, a critical discussion and its modification. Proposed by Leszek Nowak the adaptive interpretation of historical materialism was transformed – under the influence of the elaboration of the idealizational theory of science and the categorical interpretation of dialectics – into the generalized version of historical materialism. This version includes theory of the class and primitive societies. Difficulties in the building of the theory of real socialism led to the transformation of adaptive historical materialism into the non-Marxian historical materialism where some tenets of Marxism were refuted (e.g. the domination of economy over politics). In the course of the building of the adaptive interpretation of historical materialism and the non-Marxian historical materialism some primary notions were defined and modified satisfying the criteria of falsification. Although Popper severely criticized the possibility of theoretical history, the theory of history as developed at the Poznań School of Methodology satisfies his criteria of falsification. This throws doubt upon the validity of Popperian critique of theoretical history.

A gestão na medicina dentária

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Towards Eco-Dharma: The Contribution of Gandhian Thought to Ecological Ethics in India

Ecological concern prompts poor and indigenous people of India to consider how a society can ensure both protection of nature and their rightful claim for a just and sustainable future. Previous discussions defended the environment while ignoring the struggles of the poor for sustenance and their religious traditions and ethical values. Mohandas Karamchand Gandhi addressed similar socio-ecological concerns by adopting and adapting traditional religious and ethical notions to develop strategies for constructive, engaged resistance. The dissertation research and analysis verifies the continued relevance of the Gandhian understanding of dharma (ethics) in contemporary India as a basis for developing eco-dharma (eco-ethics) to link closely development, ecology, and religious values. The method of this study is interpretive, analytical, and critical. Françoise Houtart’s social analytical method is used to make visible and to suggest how to overcome social tensions from the perspective of marginalized and exploited peoples in India. The Indian government's development initiatives create a nexus between the eco-crisis and economic injustice, and communities’ responses. The Chipko movement seeks to protect the Himalayan forests from commercial logging. The Narmada Bachao Andolan strives to preserve the Narmada River and its forests and communities, where dam construction causes displacement. The use of Gandhian approaches by these movements provides a framework for integrating ecological concerns with people's struggles for survival. For Gandhi, dharma is a harmony of satya (truth), ahimsa (nonviolence), and sarvodaya (welfare of all). Eco-dharma is an integral, communitarian, and ecologically sensitive ethical paradigm. The study demonstrates that the Gandhian notion of dharma, implemented through nonviolent satyagraha (firmness in promoting truth), can direct community action that promotes responsible economic structures and the well-being of the biotic community and the environment. Eco-dharma calls for solidarity, constructive resistance, and ecologically and economically viable communities. The dissertation recommends that for a sustainable future, India must combine indigenous, appropriate, and small- or medium-scale industries as an alternative model of development in order to help reduce systemic poverty while enhancing ecological well-being.

Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk

Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstations|and other distributed memory architectures in general|based on the Bulk Synchronous Parallel (BSP) model. BSPk emphasizes efficiency in communication by minimizing local memory-to-memory copying, and in barrier synchronization by not forcing a process to wait unless it needs remote data. Both the message passing (MP) and distributed shared memory (DSM) programming styles are supported in BSPk. MP helps processes efficiently exchange short-lived unnamed data values, when the identity of either the sender or receiver is known to the other party. By contrast, DSM supports communication between processes that may be mutually anonymous, so long as they can agree on variable names in which to store shared temporary or long-lived data.

Deanonymizing Users of the SafeWeb Anonymizing Service

The SafeWeb anonymizing system has been lauded by the press and loved by its users; self-described as "the most widely used online privacy service in the world," it served over 3,000,000 page views per day at its peak. SafeWeb was designed to defeat content blocking by firewalls and to defeat Web server attempts to identify users, all without degrading Web site behavior or requiring users to install specialized software. In this article we describe how these fundamentally incompatible requirements were realized in SafeWeb's architecture, resulting in spectacular failure modes under simple JavaScript attacks. These exploits allow adversaries to turn SafeWeb into a weapon against its users, inflicting more damage on them than would have been possible if they had never relied on SafeWeb technology. By bringing these problems to light, we hope to remind readers of the chasm that continues to separate popular and technical notions of security.

Non-Uniform Reductions

We study properties of non-uniform reductions and related completeness notions. We strengthen several results of Hitchcock and Pavan and give a trade-off between the amount of advice needed for a reduction and its honesty on NEXP. We construct an oracle relative to which this trade-off is optimal. We show, in a more systematic study of non-uniform reductions, that among other things non-uniformity can be removed at the cost of more queries. In line with Post's program for complexity theory we connect such 'uniformization' properties to the separation of complexity classes.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.

Safe Compositional Network Sketches: Tool & Use Cases

NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the abstraction of an existing system so as to retain sufficient enough details to enable future analysis of safety properties. As a design tool, NetSketch enables the exploration of alternative safe designs as well as the identification of minimal requirements for outsourced subsystems. NetSketch embodies a lightweight formal verification philosophy, whereby the power (but not the heavy machinery) of a rigorous formalism is made accessible to users via a friendly interface. NetSketch does so by exposing tradeoffs between exactness of analysis and scalability, and by combining traditional whole-system analysis with a more flexible compositional analysis approach based on a strongly-typed, Domain-Specific Language (DSL) to specify network configurations at various levels of sketchiness along with invariants that need to be enforced thereupon. In this paper, we overview NetSketch, highlight its salient features, and illustrate how it could be used in applications, including the management/shaping of traffic flows in a vehicular network (as a proxy for CPS applications) and in a streaming media network (as a proxy for Internet applications). In a companion paper, we define the formal system underlying the operation of NetSketch, in particular the DSL behind NetSketch's user-interface when used in "sketch mode", and prove its soundness relative to appropriately-defined notions of validity.

Safe Compositional Network Sketches: The Formal Framework

NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the abstraction of an existing system while retaining sufficient information about it to carry out future analysis of safety properties. As a design tool, NetSketch enables the exploration of alternative safe designs as well as the identification of minimal requirements for outsourced subsystems. NetSketch embodies a lightweight formal verification philosophy, whereby the power (but not the heavy machinery) of a rigorous formalism is made accessible to users via a friendly interface. NetSketch does so by exposing tradeoffs between exactness of analysis and scalability, and by combining traditional whole-system analysis with a more flexible compositional analysis. The compositional analysis is based on a strongly-typed Domain-Specific Language (DSL) for describing and reasoning about constrained-flow networks at various levels of sketchiness along with invariants that need to be enforced thereupon. In this paper, we define the formal system underlying the operation of NetSketch, in particular the DSL behind NetSketch's user-interface when used in "sketch mode", and prove its soundness relative to appropriately-defined notions of validity. In a companion paper [6], we overview NetSketch, highlight its salient features, and illustrate how it could be used in two applications: the management/shaping of traffic flows in a vehicular network (as a proxy for CPS applications) and in a streaming media network (as a proxy for Internet applications).

Participation by place-based community organisations in local development: case studies from East Cork

The past two decades have witnessed concerted efforts by theorists and policy-makers to place civil society at the centre of social, economic and environmental development processes. To this end, policies grounded in a Third Way approach have sought to forge stronger linkages between the state and voluntary community-based organisations. Concepts such as active citizenship, social capital, partnership and sustainability have underpinned this political philosophy, which reflects a movement in development theory and political science away from notions of state-led development and unfettered neo-liberalism. In the Irish context, a series of initiatives have given expression to this new policy agenda, the foremost amongst them the publication of a White Paper in 2000. New local governance structures and development schemes have multiplied since the early 1990s, while the physical planning system has also been modified. All this has taken place against the backdrop of unprecedented economic development and social change precipitated by the ‘Celtic Tiger’.This thesis examines the interaction between community organisations, state institutions and other actors in development processes in East Cork. It focuses upon place-based community organisations, who seek to represent the interests of their particular localities. A case study approach is employed to explore the realpolitik of local development and to gauge the extent to which grassroots community organisations wield influence in determining the development of their communities. The study concludes that the transfer of decision-making power to community organisations has been more illusory than real and that, in practical terms, such groups remain marginal in the circuits of power. However, the situation of community organisations operating in different geographical locales cannot be reduced to an overarching theoretical logic. The case studies show that the modus operandi of community groups varies considerably and can be influenced by specific local geographies, events and personalities.

Computing explanations for interactive constraint-based systems

Constraint programming has emerged as a successful paradigm for modelling combinatorial problems arising from practical situations. In many of those situations, we are not provided with an immutable set of constraints. Instead, a user will modify his requirements, in an interactive fashion, until he is satisfied with a solution. Examples of such applications include, amongst others, model-based diagnosis, expert systems, product configurators. The system he interacts with must be able to assist him by showing the consequences of his requirements. Explanations are the ideal tool for providing this assistance. However, existing notions of explanations fail to provide sufficient information. We define new forms of explanations that aim to be more informative. Even if explanation generation is a very hard task, in the applications we consider, we must manage to provide a satisfactory level of interactivity and, therefore, we cannot afford long computational times. We introduce the concept of representative sets of relaxations, a compact set of relaxations that shows the user at least one way to satisfy each of his requirements and at least one way to relax them, and present an algorithm that efficiently computes such sets. We introduce the concept of most soluble relaxations, maximising the number of products they allow. We present algorithms to compute such relaxations in times compatible with interactivity, achieving this by indifferently making use of different types of compiled representations. We propose to generalise the concept of prime implicates to constraint problems with the concept of domain consequences, and suggest to generate them as a compilation strategy. This sets a new approach in compilation, and allows to address explanation-related queries in an efficient way. We define ordered automata to compactly represent large sets of domain consequences, in an orthogonal way from existing compilation techniques that represent large sets of solutions.