نتایج جستجو برای: amore divino

تعداد نتایج: 766  

Journal: :Aoristo 2021

Il saggio analizza il percorso di Paul Ricoeur intorno alla giustizia, cogliendone cammino che inizia dalle criticità (Ricoeur parla fallimenti) dell’ordine giuridico inteso come diritto positivo impotente nel giustificare in maniera convincente “diritto punire”. Nella tessitura ricoeuriana irrompono altri concetti tentano una mediazione amore, perdono per disegnare circolarità etica e politica...

Journal: :Istituto Lombardo - Accademia di Scienze e Lettere • Rendiconti di Lettere 2019

Journal: :Discrete Applied Mathematics 2013
Shiying Wang Kai Feng Guozhen Zhang

The k-ary n-cube is one of the most popular interconnection networks for parallel and distributed systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is amore extensive formof the originalmatching preclusion that assumes only edge faults. In this paper, we establish the strong matching preclusion number and all minimum strong matching preclusi...

2017
Ronald Wyss Christoph Tamm

Incorporation of [l3C,2H3-CHs]-L-methionine into cytochala-: sin A (I), cytochalasin B (II), proxiphomin (III) and protophomin (IV) by Phoma exiqua var. exiqua demonstrated that the two C-methylations occur with retention of all three H-atoms of the methyl group. Conclusions are drawn concerning the stage of the methylation reaction during the biogenetic pathway. On the basis of the results amo...

A power plant can be considered a workplace with a high level of risk.For this reason in order to ensure sustainable Performance in Power Plants risk management is essential.  In this study the AHP method for Classification of risks And the FMEA method for risk Rating and SAW method was used to rank the risks. Finally, the ranking was done by FMEA&SAW method.According to the result s of the AHP...

Journal: :Religare: Revista do Programa de Pós-Graduação em Ciências das Religiões da UFPB 2017

Journal: :Optimization Letters 2014
Huilan Chang Hung-Lin Fu Chih-Huai Shih

We study the problem of learning a hidden graph by edge-detecting queries, each of which tells whether a set of vertices induces an edge of the hidden graph or not. We provide a new information-theoretic lower bound and give amore efficient adaptive algorithm to learn a general graph with n vertices and m edges in m log n + 10m + 3n edge-detecting queries.

Journal: :Ingenium. Revista Electrónica de Pensamiento Moderno y Metodología en Historia de las Ideas 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید