951 resultados para Symbolic tokens
Resumo:
This study examines the diaconia work of the Finnish Evangelical Lutheran Church from the standpoint of clients. The role of diaconia work has grown since the early 1990s recession, and since it established itself as one of the actors along with other social organizations. Previous studies have described the changing role of diaconal work, especially from the standpoint of diaconia workers and co-operators. This research goes back to examine, beyond the activities of the diaconia work of everyday practices, its relations of ruling which are determining practices. The theoretical and methodological framework rises from the thinking of Dorothy E. Smith, the creator of institutional ethnography. Its origins are in feminism, Marxism, phenomenology, etnomethodology, and symbolic interactionism. However, it does not represent any school. Unlike the objectivity-based traditional sociology, institutional ethnography has its starting point in everyday life, and people s subjective experience of it. Everyday life is just a starting point, and is used to examine everyday life s experiences of hidden relations of ruling, linking people and organizations. The level of generalization is just on the relations of ruling. The research task is to examine those meanings of diaconia work which are embedded in its clients experiences. The research task is investigated with two questions: how diaconia work among its clients takes shape and what kinds of relations of ruling exist in diaconia work. The meanings of diaconia work come through an examination of the relations of ruling, which create new forms of diaconal work compared with previous studies. For the study, two kinds of data were collected: a questionnaire and ethnographic fieldwork. The first data set was collected from diaconal workers using the questionnaire. It gives background information of the diaconia work process from the standpoint of the clients. In the ethnographic study there were two phases. The first ethnographic material was collected from one local parish by observing, interviewing clients and diaconal workers and gathering documents. The number of observations was 36 customer appointments, and 29 interviews. The second ethnographic material was included as a part of the analysis, in which ruling relations in people s experiences were collected from the transcribed data. Close reading and narrative analysis are used as analysing methods. The analysis has three phases. First, the experiences are identified with close reading; the following step is to select some of the institutional processes that are shaping those experiences and are relevant for the research. At the third stage, those processes are investigated in order to describe analytically how they determine people s experience. The analysis produces another narrative about diaconia work, which provides tools for examining the diaconal work from a new perspective. Through the analysis it is possible to see diaconia as an exchange ratio, in which the exchange takes place between a client and a diaconia worker, but also more broadly with other actors, such as social workers, shop clerks, or with other parishioners. The exchange ratio is examined from the perspective of power which is embedded in the client s experiences. The analysis reveals that the most important relations of ruling are humiliation and randomness in the exchange ratio of diaconia work; valuating spirituality above the bodily being; and replacing official social work. The results give a map about the relations of ruling of diaconia work which gives tools to look at diaconia work s meanings to the clients. The hidden element of humiliation in the exchange ratio breaks the current picture of diaconia work. The ethos of the holistic encounters and empathic practices are shown to be of another kind when spirituality is preferred to the bodily being. Nevertheless, diaconia appears to be a place for a respectful encounter, especially in situations where the public sector s actors are retreating on liability or clients are in a life crisis. The collapse of the welfare state structures imposes on diaconia work tasks that have not previously belonged to it. At the local level, clients receive partners from diaconia workers in order to advocate them in the welfare system. Actions to influence the wider societal structures are not reached because of lacking resources. An awareness of the oppressive practices of diaconia work and their critical reviewing are the keys to the development of diaconia work, since there are such practices even in holistic and respectful diaconia work. While the research raises new information for the development of diaconia work, it also opens up new aspects for developing other kinds of social work by emphasizing the importance of taking people s experiences seriously. Keywords: diaconia work, institutional ethnography, Dorothy E. Smith, experience, customer, relations of ruling.
Resumo:
This study approaches the problem of poverty in the hinterlands of Northeast Brazil through the concept of structural violence, linking the environmental threats posed by climate change, especially those related to droughts, to the broader social struggles in the region. When discussions about potentials and rights are incorporated into the problematic of poverty, a deeper insight is obtained regarding the various factors behind the phenomenon. It is generally believed that climate change is affecting the already marginalized and poor more than those of higher social standing, and will increasingly do so in the future. The data for this study was collected during a three month field work in the states of Pernambuco and Paraíba in Northeast Brazil. The main methods used were semi-structured interviews and participant observation, including attending seminars concerning climate change on the field. The focus of the work is to compare both layman and expert perceptions on what climate change is about, and question the assumptions about its effects in the future, mainly that of increased numbers of ‘climate refugees’ or people forced to migrate due to changes in climate. The focus on droughts, as opposed to other manifestations of climate change, arises from the fact that droughts are not only phenomena that develop over a longer time span than floods or hurricanes, but is also due to the historical persistence of droughts in the region, and both the institutional and cultural linkages that have evolved around it. The instances of structural violence that are highlighted in this study; the drought industry, land use, and the social and power relations present in the region, including those between the civil society, the state and the private agribusiness sector, all work against a backdrop of symbolic and moral realms of value production, where relations between the different actors are being negotiated anew with the rise of the climate change discourse. The main theoretical framework of the study consists of Johan Galtung’s and Paul Farmer’s theory of structural violence, Ulrich Beck’s theory of the risk society, and James Scott’s theory of everyday peasant resistance.
Resumo:
Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.
Resumo:
We describe a compiler for the Flat Concurrent Prolog language on a message passing multiprocessor architecture. This compiler permits symbolic and declarative programming in the syntax of Guarded Horn Rules, The implementation has been verified and tested on the 64-node PARAM parallel computer developed by C-DAC (Centre for the Development of Advanced Computing, India), Flat Concurrent Prolog (FCP) is a logic programming language designed for concurrent programming and parallel execution, It is a process oriented language, which embodies dataflow synchronization and guarded-command as its basic control mechanisms. An identical algorithm is executed on every processor in the network, We assume regular network topologies like mesh, ring, etc, Each node has a local memory, The algorithm comprises of two important parts: reduction and communication, The most difficult task is to integrate the solutions of problems that arise in the implementation in a coherent and efficient manner. We have tested the efficacy of the compiler on various benchmark problems of the ICOT project that have been reported in the recent book by Evan Tick, These problems include Quicksort, 8-queens, and Prime Number Generation, The results of the preliminary tests are favourable, We are currently examining issues like indexing and load balancing to further optimize our compiler.
Resumo:
In the knowledge-based clustering approaches reported in the literature, explicit know ledge, typically in the form of a set of concepts, is used in computing similarity or conceptual cohesiveness between objects and in grouping them. We propose a knowledge-based clustering approach in which the domain knowledge is also used in the pattern representation phase of clustering. We argue that such a knowledge-based pattern representation scheme reduces the complexity of similarity computation and grouping phases. We present a knowledge-based clustering algorithm for grouping hooks in a library.
Resumo:
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.
Resumo:
In this paper we have developed methods to compute maps from differential equations. We take two examples. First is the case of the harmonic oscillator and the second is the case of Duffing's equation. First we convert these equations to a canonical form. This is slightly nontrivial for the Duffing's equation. Then we show a method to extend these differential equations. In the second case, symbolic algebra needs to be used. Once the extensions are accomplished, various maps are generated. The Poincare sections are seen as a special case of such generated maps. Other applications are also discussed.
Resumo:
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this article, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics that suggests such a restricted use of the freeze operator. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets by proposing a symbolic representation of models. This is a quite surprising result in view of the expressive power of the logic since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier. The article also contains developments about the relationships between temporal logics with the freeze operator and counter automata as well as reductions into first-order logics over data words.
Resumo:
Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.
Resumo:
The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
In this paper, we extend the characterization of Zx]/(f), where f is an element of Zx] to be a free Z-module to multivariate polynomial rings over any commutative Noetherian ring, A. The characterization allows us to extend the Grobner basis method of computing a k-vector space basis of residue class polynomial rings over a field k (Macaulay-Buchberger Basis Theorem) to rings, i.e. Ax(1), ... , x(n)]/a, where a subset of Ax(1), ... , x(n)] is an ideal. We give some insights into the characterization for two special cases, when A = Z and A = ktheta(1), ... , theta(m)]. As an application of this characterization, we show that the concept of Border bases can be extended to rings when the corresponding residue class ring is a finitely generated, free A-module. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
Most pattern mining methods yield a large number of frequent patterns, and isolating a small relevant subset of patterns is a challenging problem of current interest. In this paper, we address this problem in the context of discovering frequent episodes from symbolic time-series data. Motivated by the Minimum Description Length principle, we formulate the problem of selecting relevant subset of patterns as one of searching for a subset of patterns that achieves best data compression. We present algorithms for discovering small sets of relevant non-redundant episodes that achieve good data compression. The algorithms employ a novel encoding scheme and use serial episodes with inter-event constraints as the patterns. We present extensive simulation studies with both synthetic and real data, comparing our method with the existing schemes such as GoKrimp and SQS. We also demonstrate the effectiveness of these algorithms on event sequences from a composable conveyor system; this system represents a new application area where use of frequent patterns for compressing the event sequence is likely to be important for decision support and control.
Resumo:
Resumen: “Escenas de la Vida de Santo Domingo de Guzmán” es el título otorgado a la bella obra atribuida al pintor Pere Nicolau, uno de los máximos representantes del Gótico Internacional en Valencia. Esta obra nos informa de la imagen simbólica de Santo Domingo, creada a partir de la literatura hagiográfica y las manifestaciones artísticas en la Edad Media, “cada una en su lenguaje, su riqueza y sus límites, y en ellos reside su belleza, su capacidad de sugerir y de permitirnos soñar o recrearnos”.