نتایج جستجو برای: amal danghal
تعداد نتایج: 393 فیلتر نتایج به سال:
‘’beinamatni’’ is one of the subjects which was known by the name of ‘’tazmin’’. this new concept was offererd julia kristipha .she took this concept from the concept of polyphony which the russian critic and thinker, michael bachtin, observed it. eventually beinamatni becamed widespread and as a new critical phenomenon was taken into consideration and was spread about in the literature of euro...
Predicates and Mutable ADTs in Hoare Type Theory Aleksandar Nanevski Amal Ahmed Greg Morrisett Lars Birkedal Harvard University IT University of Copenhagen {aleks,amal,greg}@eecs.harvard.edu [email protected]
Adaptive Modular Active Leg (AMAL), a robotic Intelligent Prosthetic Limb has been developed at the Indian Institute of Information Technology Allahabad. The aim of the project was to provide the comfort of an intelligent prosthetic knee joint for differently abeled person with one leg amputated above the knee. AMAL provides him with the necessary shock absorption and a suitable bending of the ...
The Structure of Pseudocomplemented Distributive Lattices. Ii: Congruence Extension and Amalgamation
This paper continues the examination of the structure of pseudocomplemented distributive lattices. First, the Congruence Extension Property is proved. This is then applied to examine properties of the equational classes ¿Sn, — lá«So), which is a complete list of all the equational classes of pseudocomplemented distributive lattices (see Part I). The standard semigroups (i.e., the semigroup gene...
This paper focuses of the group judgments obtained from a committee of agents that use deliberation. The deliberative process is realized by an argumentation framework called AMAL. The AMAL framework is completely based on learning from examples: the argument preference relation, the argument generation policy, and the counterargument generation policy are case-based techniques. For join delibe...
A graph G = (V (G), E(G)) admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H-magic if there exists a bijection f : V (G)∪E(G)→ {1, 2, 3, . . . , |V (G)∪E(G)|} such that for every subgraph H ′ of G isomorphic to H, ∑ v∈V (H′) f(v) + ∑ e∈E(H′) f(e) is constant. Then G is H-supermagic if f(V (G)) = {1, 2, 3, . . . , |V (G)|}. Let {Gi}i=1 be a fi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید