122,669 research outputs found
Asad (Talal), Genealogies of Religion
No full textPace Enzo. Asad (Talal), Genealogies of Religion. In: Archives de sciences sociales des religions, n°94, 1996. p. 48
L'image des Iraniens dans les manuels scolaires arabes
No full textAtrissy Talal. L'image des Iraniens dans les manuels scolaires arabes. In: CEMOTI, n°22, 1996. Arabes et Iraniens. pp. 233-250
An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents
No full textThe process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed. Now, instead of having a single agent calculate all these values (as is typically the case), it is more efficient to distribute this calculation among the agents, thus using all the computational resources available to the system and avoiding the existence of a single point of failure. Given this, we present a novel algorithm for distributing this calculation among agents in cooperative environments. Specifically, by using our algorithm, each agent is assigned some part of the calculation such that the agents’ shares are exhaustive and disjoint. Moreover, the algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. To evaluate the effectiveness of our algorithm, we compare it with the only other algorithm available in the literature for distributing the coalitional value calculations (due to Shehory and Kraus). This shows that for the case of 25 agents, the distribution process of our algorithm took less than 0.02% of the time, the values were calculated using 0.000006% of the memory, the calculation redundancy was reduced from 383229848 to 0, and the total number of bytes sent between the agents dropped from 1146989648 to 0 (note that for larger numbers of agents, these improvements become exponentially better)
Le Proche-Orient : étude politique et militaire
No full textBin Talal Hassan. Le Proche-Orient : étude politique et militaire. In: Politique étrangère, n°3 - 1981 - 46ᵉannée. pp. 699-709
Le Proche-Orient : étude politique et militaire
No full textBin Talal Hassan. Le Proche-Orient : étude politique et militaire. In: Politique étrangère, n°3 - 1981 - 46ᵉannée. pp. 699-709
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
No full textUntil recently, the fastest distributed MIS algorithm, even for simple graph classes such as unoriented trees that can contain large independent sets within neighborhoods, has been the simple randomized algorithm discovered independently by several researchers in the late 80s. This algorithm (commonly called Luby’s algorithm) computes an MIS of an n-node graph in O(log n) communication rounds (with high probability). This situation changed when Lenzen and Wattenhofer (PODC 2011) presented a distributed (randomized) MIS algorithm for unoriented treesrunning in O( sqrt (log n * log log n)) rounds. This algorithm was slightly improved by Barenboim et al. (FOCS 2012), resulting in an O( sqrt (log n * log log n))-round (randomized) MIS algorithm for trees. At their core, these algorithms still run Luby's algorithm, but only up to the point at which the graph has been "shattered" into small connected components that can be independently processed in parallel.
The analyses of these tree MIS algorithms critically depends on "near independence" among probabilistic events, a feature that arises from the tree structure of the network. In their paper, Lenzen and Wattenhofer express hope that their algorithm and analysis could be extended to graphs with bounded arboricity. We show how to do this in the current paper. By using a new tail inequality for read-k families of random variables due to Gavinsky et al. (Random Struct Algorithms, 2015), we show how to deal with dependencies induced by the recent tree MIS algorithms when they are executed on bounded arboricity graphs. Specifically, we analyze a version of the tree MIS algorithm of Barenboim et al. and show that it runs in O(poly(a) * sqrt ( log n * log log n)) rounds in the CONGEST model for graphs with arboricity a.
While the main thrust of this paper is the new probabilistic analysis via read-k inequalities, we point out that for small values of a, this algorithm is faster than the MIS algorithm of Barenboim et al. specifically designed for bounded arboricity graphs. In this context, it should be noted that recently (in SODA 2016) Ghaffari presented a novel distributed MIS algorithm for general graphs that runs in O (log d) + 2^O(sqrt(log log n)) rounds and a corollary of this algorithm is an O(log d + sqrt (log n))-round MIS algorithm on graphs with arboricity a
An improved dynamic programming algorithm for coalition structure generation
No full textForming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions so as to maximize social welfare. This coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. Specifically, given n agents, there are O(nn) possible partitions. To date, the only algorithm that can find an optimal solution in O(3n) is the Dynamic Programming (DP) algorithm, due To Rothkopf et al. However, one of the main limitations of DP is that it requires a significant amount of memory. In this paper, we devise an Improved Dynamic Programming algorithm (IDP) that is proven to perform fewer operations than DP (e.g. 38.7% of the operations given 25 agents), and is shown to use only 33.3% of the memory in the best case, and 66.6% in the worst
Talal Asad’ın düşüncesinde “din” ve “seküler” kavramları
No full textBu makale, din ve seküler kavramları üzerindeki eleştirileri İngilizce
literatürdeki sosyal bilimler, din çalışmaları ve İslam çalışmalarında geniş yankı
bulmuş Talal Asad’ın eleştirilerini, yaklaşımını ve alternatif kategorilerini kendi
eserlerine dayanarak tanıtmakta ve değerlendirmektedir. Makale, Asad’ın din
tanımına yaklaşımını Wilfred Cantwell Smith ve Clifford Geertz’ün teorilerine
yönelttiği eleştirileri çerçevesinde incelemekte; ardından, Asad’ın seküler
hakkındaki görüşlerini ve Jose Casanova’ya yönelttiği eleştirileri ele almaktadır.
Seküler kavramını yeterince incelemedikleri nedeniyle, sekülerleşme tartışmalarını
baştan anlamsız bulan Asad, çalışmalarında “seküler”in antropolojisini yapmaya
çalışmaktadır. Bir sekülerizm ve sekülerleşme tarihi sunmayı hedeflemeden,
seküler kavramını dolaylı bir yolla; insan, toplum, devlet, hak, itaat, acı, faillik gibi
konular hakkında çeşitli varsayımları ile ele almaktadır. Protestan Reformu öncesi
Hristiyanlığın ve söylemsel bir gelenek olarak tanımladığı İslam’ın varsayımları ile
modern “seküler”in varsayımlarını karşılaştırmaktadır. Asad’a göre, seküler, din ile
bir karşıtlık kurularak kavramlaştırılsa da, aslında dinden ayrılması mümkün
olmayan bir kavramdır. Seküler, birtakım düşünce ve duyarlılıklarla bir tür “insan”,
“din” ve “toplumsal düzen” inşa etmektedir. Asad’ın din ve seküler hakkındaki
düşüncelerini aktaran makale, Asad’ın eserlerinde kendi evrensel din tanımını
ortaya koymaya çalışmadığını ancak, otantik bir İslam ve reform öncesi Hristiyanlık
varsaydığını ileri sürmektedir. Asad’ın bu varsayımı ve bireyi paranteze alan genel
yaklaşımı da çeşitli problemler içermektedirThis article examines Talal Asad’s critique of the concepts of religion and
the secular by analyzing his groundbreaking work on the subject which has been
widely read and discussed in religious studies, Islamic studies, and social sciences.
The first part of the article examines Asad’s approach to religion by analyzing his
critique of Wilfred Cantwell Smith and Clifford Geertz. The second part of the article
examines Asad’s views on the secular and his critique of Casanova. Arguing that
supporters and critics of the secularization thesis do not pay enough attention to the
concept of the secular, Asad turns to undertake an anthropology of the secular.
Approaching the secular indirectly, Asad examines assumptions of the secular
through human, society, state, right, submission, pain, agency, and so on; and
compares them with those of the Pre-Reformation Christianity and Islam that he
describes as a discursive tradition. According to Asad, the secular presuppositions
construct new meanings of “human”, “religion”, and “social order”. In this respect,
the concepts of universal religion prevalent in the anthropology of religion are
rooted in the idea of “liberal individual” which was developed in the history of the
modern West; therefore, it is not universal but historical and it is shaped under the
influence of the secular. The article argues that while Asad does not try to assert his
own all-encompassing definition of religion, he, nevertheless, assumes an authentic
Islam and Christianity. This assumption of authenticity and Asad’s approach to
tradition bracketing the individual also raise various question
La Jordanie et le conflit du Proche-Orient
No full textHassan bin Talal Prince, Moïsi Dominique. La Jordanie et le conflit du Proche-Orient. In: Politique étrangère, n°4 - 1983 - 48ᵉannée. pp. 947-949
- …
