624 research outputs found
Genetics and airway expression of interleukin-13 receptors in asthma
No full textEThOS - Electronic Theses Online ServiceGBUnited Kingdo
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
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
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
Parameterized Aspects of Strong Subgraph Closure
No full textMotivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F-closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F-free Edge Deletion. In Strong F-closure, we want to select a maximum number of edges of the input graph G, and mark them as strong edges, in the following way: whenever a subset of the strong edges forms a subgraph isomorphic to F, then the corresponding induced subgraph of G is not isomorphic to F. Hence the subgraph of G defined by the strong edges is not necessarily F-free, but whenever it contains a copy of F, there are additional edges in G to destroy that strong copy of F in G.
We study Strong F-closure from a parameterized perspective with various natural parameterizations. Our main focus is on the number k of strong edges as the parameter. We show that the problem is FPT with this parameterization for every fixed graph F, whereas it does not admit a polynomial kernel even when F =P_3. In fact, this latter case is equivalent to the Strong Triadic Closure problem, which motivates us to study this problem on input graphs belonging to well known graph classes. We show that Strong Triadic Closure does not admit a polynomial kernel even when the input graph is a split graph, whereas it admits a polynomial kernel when the input graph is planar, and even d-degenerate. Furthermore, on graphs of maximum degree at most 4, we show that Strong Triadic Closure is FPT with the above guarantee parameterization k - mu(G), where mu(G) is the maximum matching size of G. We conclude with some results on the parameterization of Strong F-closure by the number of edges of G that are not selected as strong
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
Source-to-source compilation of loop programs for manycore processors
No full textIt is widely accepted today that the end of microprocessor performance growth
based on increasing clock speeds and instruction-level parallelism (ILP)
demands new ways of exploiting transistor densities.
Manycore processors (most commonly known as
GPGPUs or simply GPUs) provide a viable solution to this performance
scaling bottleneck through large numbers of lightweight compute cores
and memory hierarchies that rely primarily on software for their
efficient utilization. The widespread proliferation of this class of
architectures today is a clear indication that exposing and managing
parallelism on a large scale as well as efficiently orchestrating
on-chip data movement is becoming an increasingly critical concern for
high-performance software development. In such a computing landscape
performance portability -- the ability to exploit the power of a variety
of manycore chips while minimizing the impact on software development
and productivity -- is perhaps one of the most important and challenging
objectives for our research community.
This thesis is about
performance portability for manycore processors and how source-to-source
compilation can help us achieve it. In particular, we show that for an
important set of loop-programs, performance portability is
attainable at low cost through compile-time polyhedral analysis and optimization
and parametric tiling for run-time performance
tuning. In other words, we propose and evaluate a source-to-source
compilation path that takes affine loop-programs as input and
produces parametrically tiled parallel code amenable to run-time tuning
across different manycore platforms and devices -- a very useful
and powerful property if we seek performance portability because it
decouples the compiler from the performance tuning process. The produced
code relies on a platform-independent run-time environment, called Avelas,
that allows us to formulate a robust and portable code generation algorithm.
Our experimental evaluation shows that Avelas induces low run-time overhead
and even substantial speed-ups for wavefront-parallel programs compared to a state-of-the-art
compile-time scheme with no run-time support. We also claim that the low overhead of Avelas is a strong
indication that it can also be effective as a general-purpose programming model
for manycore processors as we demonstrate for a set of ParBoil benchmarks.Open Acces
Peak power reduction algorithms in asymmetric digital subscriber line modems
No full textThesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.Includes bibliographical references (leaves 94-96).This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.This thesis investigates peak-to-average ratio (PAR) reduction techniques for multicarrier modulation systems, such as discrete multitone (DMT) modems and orthogonal frequency-division multiplexed (OFDM) terrestrial broadcast transmitters. Through simulation and test implementation on a state-of-the-art programmable ADSL development platform, this thesis pursues a suitable solution for minimizing PAR given the resources of a programmable platform. This solution is integrated as a prototype implementation into a fully-functional ADSL modem and optimized for maximum PAR reduction performance within modem complexity constraints.by Athanasios Dimitri Dousis.M.Eng
Homophobic Statements, a Bishop, and the Limits of Freedom of Expression. An In-Depth Commentary on ECtHR 31.08.2023, Amvrosios-Athanasios Lenis v. Greece, no. 47833/20
No full textDichiarazioni omofobe, un vescovo e i limiti della libertà di espressione. Un commento approfondito su CEDU 31.08.2023, Amvrosios-Athanasios Lenis v. Greece, no. 47833/20.
ABSTRACT: The decision of the ECtHR of 31.08.2023, Amvrosios-Athanasios Lenis v. Greece (no. 47833/20), is a further step toward an increasingly dense jurisprudence on “hate speech” and the limits of freedom of expression. The public proclamation of religious doctrines that are in conflict with the values of the contracting States enshrined in the ECHR is protected to a certain extent by the fundamental right of freedom of religion and belief. However, the qualification of a statement as religious does not justify “hate speech.” The AUTHOR shows the tension between freedom of religion, freedom of expression, and protection against discrimination, and analyzes the decision against the backdrop of Article 17 of the ECHR (prohibition of abuse of rights).
SOMMARIO: 1. Preliminary Remarks - 2. The Concept of Hate Speech - 3. The Facts of the Case - 4. The Procedure and Reasoning of the Court - 4.1 The ECtHR’s Preliminary Considerations on Fundamental Rights - 4.2 Legal assessment - 4.3 Some Remarks on (the Non-Invoked) Article 9 of the ECHR - 5. Concluding Remarks
La tomba III di Haghios Athanasios e il valore semantico dell'incarnato
No full textThe tomb III at Haghios Athanasios stands out among the Macedonian tombs for the exceptional painted decoration of the temple-like façade. Excavated in the '90s by M. Tsimbidou-Avloniti it has been published by the scholar in full detail and the iconographic program of the monument has been the object of many publications. This article re-examines the different ways of reproducing the skin color (το ανδρείκελον) in the figures of the miniature frieze and in the megalographic figures beside the door. The realistic rendering of the megalographic figures of armed men in Macedonian attire, showing their sorrow for the lost of an etairos, is contrasting with the pale color of the participants to the symposion in the frieze above the door, a scene whose illusionistic overtone has been yet perceived by the critics. This symposion is articulated in three scenes and it can be interpeted as a necrodeipnon, but in the same time as a celebration of the Macedonian banquet style, centered on the royal court. The author suggests that the first figure on the right of the frieze, related to the group of armed men looking towards the banqueters feasting in the center of the frieze, can be read as the dead himself, for the particular rendering of his ανδρείκελον, showing the typical ochròtes or necròdes face color, according to the contemporary medical lexicon. The pathetic stance assumed by the same figure, the sole in the group which is not bearing arms, seems to confirm his role in the context of the scene
- …
