1,354,348 research outputs found
Massimo il Confessore
No full textIn questa Voce, a partire dalla approfondita ricognizione dei testi di Massimo il Confessore e della letteratura critica a lui dedicata, da me realizzata in una monografia precedente, ricostruisco in modo sintetico la vita, le opere, il pensiero, gli influssi del Confessore, corredando la voce di una Bibliografia specifica essenziale
L'identità alternativa della periferia: l'Università a Lecce
No full textViene ricostruita l'identità culturale della provincia ionico-salentina attraverso la storia dell'Università di Lecce, oggi del Salento, dagli inizi dell'800 a oggi. Sulla base di un'antica tradizione di cattedre accademiche, che risale al XVI secolo, negli anni Cinquanta del Novecento si costituisce la libera Università degli Studi di Lecce che esercita nel corso degli anni un'intensa attività di formazione e di ricerca scientifica, contribuendo alla crescita e allo sviluppo del territorio salentino. La storia dell'Università del Salento, come quella delle altre Università del Mezzogiorno, s'intreccia strettamente con la "nuova" questione meridionale
Gary J. Confessore, approximately 1962-1963
No full textPortrait of Gary J. Confessore, Norwich University class of 1963, as a cadet.Photograph most likely by Roger Conant based on his dates of employment
An approximation result for a periodic allocation problem
No full textIn this paper we study a periodic allocation problem which is a generalization of the dynamic storage allocation problem to the case in which the arrival and departure time of each item is periodically repeated. These problems are equivalent to the interval coloring problem on weighted graphs in which each feasible solution corresponds to an acyclic orientation, and the solution value is equal to the length of the longest weighted path of the oriented graph. Optimal solutions correspond to acyclic orientations having the length of longest weighted path as small as possible. We prove that for the interval coloring problem on a class of circular arc graphs, and hence for a periodic allocation problem, there exists an approximation algorithm that finds a feasible solution whose value is at most two times the optimal. (C) 2001 Elsevier Science B.V. All rights reserved
La luce come memoria del divino in Massimo il Confessore
No full textTesto ampio della relazione letta e discussa al Convegno "Memoria e senso del divino" (Cascia 3-4 ottobre 2008). Sono analizzati testi di Agostino, Basilio di Cesarea, Gregorio di Nissa, Gregorio Nazianzeno e Massimo il Confessore nella prospettiva di una filosofia del linguaggio dei Padri della Chiesa fra IV e VII secolo. L'articolo è stato consegnato per la stampa il 19 luglio 2010. In data 8 novembre 2012 consegnate bozze corrette dall'autore
A Linear Time Approximation Algorithm for Interval Coloring on Proper Interval Graphs
No full textGiven a set of intervals on the real line, an interval graph is de®ned by a set of vertices associated to the intervals with edges between two vertices when the corresponding intervals overlap. If no interval properly contains another, we have a proper interval graph. When weights are associated to vertices, the interval coloring problem on a graph consists in assigning to each vertex a number of consecutive colors equal to the weight, such that adjacent vertices do not share any color and the total number of used colors is minimized. In this paper, we prove that this optimization problem on proper interval graphs is NP-hard. We give a linear time 2-approximation algorithm for it, and show that the bound is tight. Moreover, by exploiting the particular problem representation, the structure of the provided solutions are guaranteed to remain 2-approximated for any vertex weight function
Effects of lung volume and thoracic gas compression on maximal and partial flow-volume curves.
No full textExperimental Evaluation of Approximation and Heuristic Algorithms for the Dominating Paths Problem
No full textMonitoring flows on networks is a research area for which a number of applications are waiting for
models and algorithms to face new problems emerging with a very high pace. In this paper we analyze a
particular optimization problem, namely the Dominating Paths Problem (DPP), that has application in this
filed specially for urban transportation networks. Given an undirected graph G = (V; E) and a subset B ⊆ V
of bound vertices, we look for a set of vertices M of minimum size such that each element of M is the origin
of one or more paths, and, the set of all these paths dominates B. For this NP-hard problem, we present an
approximation algorithm and new heuristic procedures extensively evaluated on a set of test instances. We
defined two different sets of benchmarks: grid graphs and random graphs. Moreover, we included two test
cases taken from real traffic networks. Computational results, discussed in the paper, give insights both on the
problem and on algorithms’ performance
A distributed simulation model for inventory management in a supply chain
No full textOne of the challenging issues faced by each enterprise of a supply chain is to determine the right production and/or stock levels in order to minimize costs while ensuring a given customer service. In a supply chain, each enterprise pursues its own goal and takes its own decisions in all independent way. However, the decisions are usually influenced by the actions or decisions of the others. One of the main factors influencing the decision process is the customer demand originated at the downstream layer of the supply chain and traveling tip the supply chain in terms of orders placed oil to upstream layers and becoming more and more altered. In order to achieve high efficiency in the whole system, an effective coordination between enterprises is needed. In this paper, all analysis of how supply chain actors interact with each other and how the communication and coordination improve the efficiency of the supply chain is presented; we propose a distributed simulation model for analyzing the effect of inventory policies and information sharing on changing customer demands. The proposed model is tested oil all Italian extended enterprise in which the actors cooperate to produce compressors for refrigerators
- …
