3,375 research outputs found
Wedding of Asimina and Athanasios Zois
No full textThe wedding of Asimina and Athanasios Zois (seated) with (l-r) Toula Speros, Bertha Manos, (unknown), Athanasios Anagnostis (Koumabaros), Athanasios Blikas (Asimina's father), Chris Gavalas, (unknown), Fautini Zois, Stamatia Zois, January 24, 193
The Δρομοδείχτης της Ελλάδος of 1824 and Athanasios Stageirites (Τίτλος περίληψης)
No full textσ. [281]-290Κείμενο στα ελληνικά με περίληψη στα αγγλικά με τον τίτλο: The Δρομοδείχτης της Ελλάδος of 1824 and Athanasios StageiritesThe article first examines the close relationship between the publication “Δρομοδείχτης της Ελλάδος” [1824] and the publication “Ηπειρωτικά” (1819) by Athanasios Stageirites and then suggests that Athanasios Stageirites is the likeliest author of the “Δρομοδείχτης της Ελλάδος”.Δωδώνη: Τεύχος Πρώτο: επιστημονική επετηρίδα του Τμήματος Ιστορίας και Αρχαιολογίας της Φιλοσοφικής Σχολής του Πανεπιστημίου Ιωαννίνων; Τόμ. 43-44 (2014-2015
Figure 2 in Brown bear (Ursus arctos L.) habitat use patterns in two regions of northern Pindos, Greece - management implications
No full textFigure 2. The habitat suitability map produced by the ecological niche factor analysis for the Gramos study site. Habitat suitability is presented by a greyscale gradient. The lighter the colour the more suitable habitat location for the bear.Published as part of Mertzanis, Georgios, Kallimanis, Athanasios S., Kanellopoulos, Nikolaos, Sgardelis, Stefanos P., Tragos, Athanasios & Aravidis, Ilias, 2008, Brown bear (Ursus arctos L.) habitat use patterns in two regions of northern Pindos, Greece - management implications, pp. 301-315 in Journal of Natural History 42 (5-8) on page 310, DOI: 10.1080/00222930701835175, http://zenodo.org/record/466662
Figure 3 in Brown bear (Ursus arctos L.) habitat use patterns in two regions of northern Pindos, Greece - management implications
No full textFigure 3. The habitat suitability map produced by the ecological niche factor analysis for the Grevena study site. Habitat suitability is presented by a greyscale gradient. The lighter the colour the more suitable habitat location for the bear.Published as part of Mertzanis, Georgios, Kallimanis, Athanasios S., Kanellopoulos, Nikolaos, Sgardelis, Stefanos P., Tragos, Athanasios & Aravidis, Ilias, 2008, Brown bear (Ursus arctos L.) habitat use patterns in two regions of northern Pindos, Greece - management implications, pp. 301-315 in Journal of Natural History 42 (5-8) on page 311, DOI: 10.1080/00222930701835175, http://zenodo.org/record/466662
Monetary policy rules, macroeconomic stability and inflation: a view from the trenches
No full textI estimate a forward-looking monetary policy reaction function for the Federal Reserve for the periods before and after Paul Volcker's appointment as Chairman in 1979, using information that was available to the FOMC in real time from 1966 to 1995. The results suggest broad similarities in policy and point to a forward looking approach to policy consistent with a strong reaction to inflation forecasts during both periods. This contradicts the hypothesis, based on analysis with ex post constructed data, that the instability of the Great Inflation was the result of weak FOMC policy responses to expected inflation. A difference is that prior to Volcker's appointment, policy was too activist in reacting to perceived output gaps that retrospectively proved overambitious. Drawing on contemporaneous accounts of FOMC policy, I discuss the implications of the findings for alternative explanations of the Great Inflation and the improvement in macroeconomic stability since then JEL Classification: E3, E52, E58Greenbook forecasts, monetary policy rules, real-time data, stagflation
Learning-dependent modulation of working memory
No full textData and code associated with manuscript entitled 'Learning-dependent modulation of working memory'. Authors: Frida A.B. Printzlau, Athanasios Bourganos, Keisuke Fukuda and Michael L. Mack
Transitions: Athanasios Koukopoulos [AθανάσιΟς κΟυκόπΟυλΟς], M.D. (1931–2013)
No full textAthanasios Koukopoulos was born in Chaeronea, a village in the district of Boeotia in central Greece, on 23 November 1931 as the son of Konstantinos and Maria Koukopoulos. His father hoped that he would remain at home to manage the land they owned, but Athanasios preferred to study. His energetic and supportive mother fought for his education. At the end of World War II, following years of exposure to violence and privation, his family moved to Athens just before the Greek civil war of 1946 to 1949. In Athens, Koukopoulos continued his education while playing professional basketball with the prestigious Panatinaikos Sports Club of Athens, which later on presented him with the Golden Clover award. In 1951, he moved to Italy despite remaining hard feelings in Greece following the recent Greco-Italian war of 1940 to 1941 and the subsequent Balkan campaign of the Axis powers in World War II
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
No full textIn social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which the problem is solvable. We show that the problem admits a polynomial-time algorithm for two unrelated classes of graphs: proper interval graphs and trivially-perfect graphs. To complement our result, we show that the problem remains NP-complete on split graphs, and consequently also on chordal graphs. Thus we contribute to define the first border between graph classes on which the problem is polynomially solvable and on which it remains NP-complete
Dataset in support of the Southampton doctoral thesis 'The boatbuilding tradition of the Aegean during the Late Neolithic – Early Bronze Age periods. Typological classification, digital reconstruction and seakeeping assessment'
No full textDataset in support of the Southampton doctoral thesis 'The boatbuilding tradition of the Aegean during the Late Neolithic – Early Bronze Age periods. Typological classification, digital reconstruction and seakeeping assessment' Appendix D - Resistance data and Appendix C - Stability data.
This dataset is focused on two appendices:
Appendix D - Resistance data. D.1 Resistance data produced by the author via MAXSURF Resistance for this thesis.
Appendix C - Stability data
C1. Stability data – STIX and ISO criteria, produced by the author via MAXSURF Stability software for his thesis
This research was funded by Southampton Marine and Maritime Institute (SMMI), Vice-Chancellor's Scholarship, Greek Archaeological Committee UK (GACUK)
</span
Cluster Deletion on Interval Graphs and Split Related Graphs
No full textIn the Cluster Deletion problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a clique. It is known that the decision version of Cluster Deletion is NP-complete on (P_5-free) chordal graphs, whereas Cluster Deletion is solved in polynomial time on split graphs. However, the existence of a polynomial-time algorithm of Cluster Deletion on interval graphs, a proper subclass of chordal graphs, remained a well-known open problem. Our main contribution is that we settle this problem in the affirmative, by providing a polynomial-time algorithm for Cluster Deletion on interval graphs. Moreover, despite the simple formulation of the algorithm on split graphs, we show that Cluster Deletion remains NP-complete on a natural and slight generalization of split graphs that constitutes a proper subclass of P_5-free chordal graphs. Although the later result arises from the already-known reduction for P_5-free chordal graphs, we give an alternative proof showing an interesting connection between edge-weighted and vertex-weighted variations of the problem. To complement our results, we provide faster and simpler polynomial-time algorithms for Cluster Deletion on subclasses of such a generalization of split graphs
- …
