scispace - formally typeset
Search or ask a question
Institution

National Technical University of Athens

EducationAthens, Attiki, Greece
About: National Technical University of Athens is a education organization based out in Athens, Attiki, Greece. It is known for research contribution in the topics: Large Hadron Collider & Nonlinear system. The organization has 13445 authors who have published 31259 publications receiving 723504 citations. The organization is also known as: Athens Polytechnic & NTUA.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper proposes a modular architecture for the separation of the data collection process from the SDN control plane with the employment of sFlow monitoring data and presents experimental results that demonstrate the effectiveness of the proposed sFlow-based mechanism compared to the native OF approach, in terms of overhead imposed on usage of system resources.

417 citations

Journal ArticleDOI
TL;DR: The geological strength index (GSI) is a system of rock-mass characterization that has been developed in engineering rock mechanics to meet the need for reliable input data, particularly those related to rock mass properties required as inputs into numerical analysis or closed form solutions for designing tunnels, slopes or foundations in rocks as mentioned in this paper.
Abstract: The geological strength index (GSI) is a system of rock-mass characterization that has been developed in engineering rock mechanics to meet the need for reliable input data, particularly those related to rock-mass properties required as inputs into numerical analysis or closed form solutions for designing tunnels, slopes or foundations in rocks. The geological character of rock material, together with the visual assessment of the mass it forms, is used as a direct input to the selection of parameters relevant for the prediction of rock-mass strength and deformability. This approach enables a rock mass to be considered as a mechanical continuum without losing the influence geology has on its mechanical properties. It also provides a field method for characterizing difficult-to-describe rock masses. After a decade of application of the GSI and its variations in quantitative characterization of rock mass, this paper attempts to answer questions that have been raised by the users about the appropriate selection of the index for a range of rock masses under various conditions. Recommendations on the use of GSI are given and, in addition, cases where the GSI is not applicable are discussed. More particularly, a discussion and suggestions are presented on issues such as the size of the rock mass to be considered, its anisotropy, the influence of great depth, the presence of ground water, the aperture and the infilling of discontinuities and the properties of weathered rock masses and soft rocks.

415 citations

Journal ArticleDOI
Georges Aad1, Brad Abbott2, Jalal Abdallah3, S. Abdel Khalek4  +2815 moreInstitutions (169)
TL;DR: In this article, a search for new phenomena in final states with an energetic jet and large missing transverse momentum was performed using 20.3 fb(-1) of root s = 8 TeV data collected in 2012.
Abstract: Results of a search for new phenomena in final states with an energetic jet and large missing transverse momentum are reported. The search uses 20.3 fb(-1) of root s = 8 TeV data collected in 2012 ...

414 citations

Journal ArticleDOI
TL;DR: The bottom line of this review is that a joint co-operation between control experts and supply chain managers has the potential to introduce more realism to the dynamical models and develop improved supply chain management policies.

414 citations

Journal ArticleDOI
TL;DR: It is shown that determining whether s(G) ≤ K, for a given integer K, is NP-hard for general graphs but can be solved in linear time for trees.
Abstract: T. Parsons originally proposed and studied the following pursuit-evasion problem on graphs: Members of a team of searchers traverse the edges of a graph G in pursuit of a fugitive, who moves along the edges of the graph with complete knowledge of the locations of the pursuers. What is the smallest number s(G) of searchers that will suffice for guaranteeing capture of the fugitive? It is shown that determining whether s(G) ≤ K, for a given integer K, is NP-complete for general graphs but can be solved in linear time for trees. We also provide a structural characterization of those graphs G with s(G) ≤ K for K = 1, 2, 3.

412 citations


Authors

Showing all 13584 results

NameH-indexPapersCitations
J. S. Lange1602083145919
Nicholas A. Peppas14182590533
Claude Amsler1381454135063
Y. B. Hsiung138125894278
M. I. Martínez134125179885
Elliott Cheu133121991305
Evangelos Gazis131114784159
Stavros Maltezos12994379654
Serkant Ali Cetin129136985175
Matteo Cavalli-Sforza129127389442
Stefano Colafranceschi129110379174
Konstantinos Nikolopoulos12893175907
Ilya Korolkov12888475312
Martine Bosman12894273848
Sotirios Vlachos12878977317
Network Information
Related Institutions (5)
Royal Institute of Technology
68.4K papers, 1.9M citations

94% related

Delft University of Technology
94.4K papers, 2.7M citations

94% related

Chalmers University of Technology
53.9K papers, 1.5M citations

93% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

92% related

Technical University of Denmark
66.3K papers, 2.4M citations

91% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023105
2022220
20211,618
20201,645
20191,721
20181,701