Σύγχρονα Ερευνητικά Θέµατα σε Παγκόσµιο και Ευρωπαϊκό επίπεδο Οι Μεγάλες Προκλήσεις (Grand Challenges)

Transcript

1 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Σύγχρονα Ερευνητικά Θέµατα σε Παγκόσµιο και Ευρωπαϊκό επίπεδο Οι Μεγάλες Προκλήσεις (Grand Challenges) Κώστας Χαλάτσης 1

2 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Θα παρουσιαστούν Μεγάλες Προκλήσεις για ΕΑ Μεγάλες προκλήσεις για τις ΗΠΑ (NITRD) Η άποψη του National Coordination Office for Information Technology Research and Development Μεγάλες προκλήσεις για την ΕΕ (IST FP7) Η άποψη του Information Society Technologies Advisory Group Μεγάλες προκλήσεις για την ΑΣΙΑ ( Ιαπωνία, Κορέα, Κίνα, Ινδία, κλπ) Μεγάλες προκλήσεις στη Βασική Έρευνα Χρηµατοδότηση Ε Α παγκοσµίως 2

3 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Μεγάλη Πρόκληση (Grand Challenge) είναι: Μια µακροπρόθεσµη επιστηµονική, τεχνολογική ή κοινωνική πρόοδος η υλοποίηση της οποίας απαιτεί καινοτοµίες στην Έρευνα και Ανάπτυξη των Τεχνολογιών Πληροφορικής και η οποία θα βοηθήσει στην αντιµετώπιση των προτεραιοτήτων µιας χώρας. Οδηγεί σε απτή εικόνα του µέλλοντος που είναι εύκολα κατανοητή από πολιτικούς και βιοµηχάνους Κείται στο όριο του τι είναι ίσως δυνατόν µε µαζική προσπάθεια Ε Α Ολοκληρώνει πολλά διεπιστηµονικά πεδία, παράγει πολλά υποπροϊόντα και έχει ξεκάθαρο εµπορικό και κοινωνικό όφελος 3

4 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Το πρόγραµµα NITRD (Networking and Information Technology Research and Development) Οι 16 NITRD Μεγάλες Προκλήσεις (GCs) Knowledge Environments for Science and Engineering Clean Energy Production Through Improved Combustion High Confidence Infrastructure Control Systems Improved Patient Safety and Health Quality Informed Strategic Planning for Long- Term Regional Climate Change Nanoscale Science and Technology: Explore and Exploit the Behavior Ensembles of Atoms and Molecules Predicting Pathways and Health Effects of Pollutants Real-Time Detection, Assessment, and Response to Natural or Man-Made Threats Safer, More Secure, More Efficient, Higher-Capacity Multi-Modal Transportation System Anticipate Consequences of Universal Participation in a Digital Society Collaborative Intelligence: Integrating Humans with Intelligent Technologies Generating Insights From Information at Your Fingertips Managing Knowledge-Intensive Organizations in Dynamic Environments Rapidly Acquiring Proficiency in Natural Languages SimUniverse: Learning by Exploring Virtual Lifetime Tutor for All 4

5 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Το πρόγραµµα NITRD Οι 14 περιοχές ύσκολων Προβληµάτων που σχετίζονται µε την επίλυση των Μεγάλων Προκλήσεων Algorithms and Applications Intelligent Systems Complex Heterogeneous Systems IT Systems Design Hardware Technologies IT Usability High Confidence IT IT Workforce High-End Computing Systems Management of IT Human Augmentation IT Networks Information Management Software Technologies 5

6 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Το πρόγραµµα IST FP7 Το 7 ο Framework Programme Οι 11 Μεγάλες Προκλήσεις The 100% Safe Car The Multilingual Companion The Service Robot Companion The Self-Monitoring and Self-Repairing Computer The Internet Police Agent The Disease and Treatment Simulator The Augmented Personal Memory The Pervasive Communication Jacket The Personal Everywhere Visualiser The Ultra-light Aerial Transport Agent The Intelligent Retail Store 6

7 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Το πρόγραµµα IST FP7 Οι Ερευνητικές Προκλήσεις σε Τεχνολογίες Πληροφοριών Επικοινωνιών (Information and Communications Technologies, ICT) Advanced ICT Models and Technologies Cognitive Technologies Human Interfaces Distributed Ambient Computing Advanced Knowledge Management Innovative ICT Methods and Infrastructures Software-Intensive System Development Systems Modeling and Simulation Next Generation Communications Technologies Nano-electronics, Architectures and Sensing 7

8 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Μεγάλες προκλήσεις για την ΑΣΙΑ Βασικά, προκλήσεις παρόµοιες µε αυτές των ΗΠΑ ΕΕ Π.χ., το πρόγραµµα της Ν. Κορέας περιλαµβάνει: Building an Information-Knowledge-Intelligence Society Aiming at Bio Healthtopia Advancing E2(Environment and Energy) Frontier Upgrading the Value of Major Industries of Korea Today Improving National Safety and Prestige Σηµαντικό γεγονός: Η Ασία (Κίνα, Ιαπωνία και Ν. Κορέα) αποφάσισαν να συνεργαστούν για την εισαγωγή το 2008 της τεχνολογίας 4ης γενεάς για Ασύρµατες Επικοινωνίες. Η απόφαση αυτή απειλεί τις ευρωπαϊκές εταιρίεςericsson, Nokia, Alkatel, και Siemens. 8

9 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Μεγάλες Προκλήσεις για Βασική Έρευνα Στην Πληροφορική Στην Επεξεργασία Σήµατος τις Επικοινωνίες Σε Νέες Τεχνολογίες 9

10 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για το Web: Αναζήτηση Εξόρυξη Data Understanding and Exploiting the Graph Structure of the Web What are the meaningful graph-theoretic properties of the Web? Finding Frequently Occurring Subgraphs of the Web Graph In order to identify cyber-communities not yet known to directories The Web of Queries Detect changes in queries and answers, as well as implicit dependencies among them. Efficient distributed processing of large numbers of queries in response to changes in webpages. Extracting Associations and Other Structure from Web Pages extracting information from many pages in order to build databases that summarize the contents of many pages Answering Search Queries More Quickly (make term-matching fast) Next Generation Searching For search engines that exploit the organization and specialized semantics of the data (eg., for corpus-specific repositories) Determining the Geography of the Web Construct and update the current physical map of the Internet 10

11 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για Ηλεκτρονικό Εµπόριο άλλες εφαρµογές στο Web Real-World Multiparty Function Computation Develop (non-generic) efficient, secure, multiparty protocols for specific functions of interest (eg., for elections and auctions) Designing Secure Electronic Trading Systems which ensure that Far-away traders are not disadvantaged by communications delays (fairness). Traders can verify that their orders were executed according to their instructions (anti-manipulation). Traders can detect whether someone's trading program is winning excessively (market efficiency). Develop a Theory of Web-Site Design Develop a theory of the data model underlying web sites. The theory should encompass both the underlying content of the site and the navigational structure imposed over this content. Develop a theory underlying the optimization of web-site performance. Part of the problem is to automatically select which data needs to be materialized and cached in a web site based on analysis of the web-site structure and user browsing patterns. Develop methods for specifying and verifying integrity constraints on web sites. Designing Adaptive Web Sites Detecting patterns of usage that suggest interesting restructurings, Automatically restructuring the site in a consistent manner. 11

12 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για τοweb: Ασφάλεια Ιδιωτικότητα Preventing Denial of Service Attacks and Related Problems Develop router protocols to force users to play fair Designing Security Services Identify basic ``security services'' that should be available on the Internet and explore how to combine such services into secure protocols Privacy and Access Control in Information Retrieval Systems without sacrificing the quality and performance of modern searching and data mining methods (those using a graph view of the Web). Semantic Zero-Knowledge Proofs Develop a protocol that lets a server with a given document convince a client that the document is ``about'' topic X, without revealing the document to the client. Public-Key Watermarking Develop a public-key watermarking scheme, or prove that none can exist. Good Enough Intellectual Property Management Exploit Human Ability Considerations in Security Design to make sure that humans are the ones requesting a resource Theory and Applications of Moderately Hard Functions 12

13 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για την Τεχνολογία Λογισµικού Software Specification Devise formal specification techniques for large reactive software systems Efficient algorithms for testing the self-consistency of a specification. Efficient algorithms for assisting the process of telling whether the specifications are met by a given implementation Automatic Transformation of Specification to System Design Design algorithms and tools for converting specifications into system designs. Understanding Incomplete Programs Software theory for the understanding of incomplete programs From System Design to Code (and in between) For distributed system, with the various systems components as communicating processes Construct high-level interpreters for a system design Querying the Software System View an existing software system as a ``database'' that can be queried to understand properties of the system. 13

14 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για Computer Aided Verification Next Steps for Symbolic Model Checking Practical model checking algorithms for reasoning about hybrid systems Better heuristics for ordering the variables when constructing Ordered Binary Decision Diagrams, OBDD's. Combine model checking and theorem proving Devise more powerful compositional reasoning techniques Find good techniques for reasoning about parameterized systems Develop techniques for extracting finite state synchronization skeletons from concurrent programs. Model Checking without OBDD's Develop good algorithms for SATISFIABILITY (by using exact procedures or effective heuristics) Modelling Source Code practical techniques for deriving a sound abstract representation of a program from the program source text guided by a formal specification of (some of) the program's requirements 14

15 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για Networking Specifying, Constructing, and Verifying Communications Protocols Automate as much as possible the process of constructing and verifying communications protocols. Routing, Congestion Control, and Failure Recovery on the Internet Provide real-time adaptive routing mechanisms model and optimize performance (minimize latency and packet loss) taking into account cost, real-world (heavy-tailed) traffic models, network topology, link failure probabilities, etc. Design a Replacement for the BGP protocol Provide a precise specification of the problem that Border Gateway Protocol should be solving and design a network protocol that correctly implements this specification. 15

16 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για τις Βάσεις εδοµένων Dealing with Large-Scale Data and Secondary Storage Invent new ways of executing queries on large-scale data, using such secondary-storage models of cost, and possibly exploiting parallel and distributed processing when available. Especially, consider complex queries involving grouping and aggregation and multiway joins. Query Optimization optimization for object-oriented and semi-structured data models (e.g., XML documents) than for the relational model, optimizing queries when subqueries are to a variety of different sources on the Web. 16

17 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για τα Λειτουργικά Συστήµατα Protecting File Systems Formalize and provide examples of security for ``permissions'' in file systems. Μodel the secure execution of untrusted code. Optimizing Data Access Automatic techniques for ``optimal'' dynamic rearrangement of data in response to access patterns and Fast online reordering techniques for access requests so as to minimize overall latency, given a fixed data layout. 17

18 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για την Αρχιτεκτονική Υπολογιστών Exploiting Instruction Level Parallelism Evaluate how well processor-specific tuning fits algorithmic models we use, or could use. Could PRAM algorithmics, or another algorithmic approach, lead towards a research agenda for new computer systems, where the responsibility of the programmer could be cleanly stated? Proceed to validate whatever you propose through modeling and various modes of quantitative analysis. 18

19 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για τη Σύγκλιση των Parallel and Distributed Computing Apply intellectual tools developed for distributed systems to parallel systems apply well-developed theories for distributed systems (such as atomicity and serializability, network algorithms, replication lock-free synchronization, competitive analysis of anything that moves, and security) to a theory of how to implement useful shared-memory abstractions on top of networks of (severely) space-bounded automata. New complexity theory for synchronization. e.g., compare a single-word compare-and-swap, a k-word compare-and-swap, and a (k+1)-word compare-and-swap. Find the connection between the architecture of a modern processor and that of a distributed system Modern processors use deep pipelines and aggressive speculative execution. The classical theory of distributed computing has a well-developed theory of transaction systems, optimistic concurrency control, optimistic recovery, discrete-event simulation, and distributed checkpointing. It seems there should be some connection. 19

20 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για την Τεχνητή Νοηµοσύνη Inference Algorithms for Probabilistic Models What are the most effective algorithmic techniques, and how can we adapt them to exploit the structure of particular models? Does randomization help? Geometric Object Recognition Identify of invariants of objects that are preserved in all (likely) image configurations are easy to measure. Define a (no doubt complex and non-euclidean) distance function covering both objects and images. Develop data structures allowing fast approximate queries under this metric, so that we can quickly find objects that are ``near matches.'' 20

21 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Προκλήσεις για Επιστηµονικούς Υπολογισµούς Better Algorithms for Mesh Generation Better Preconditioning Techniques Eigenvalue Problems and Graph Partitioning 21

22 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Θέµατα για Κρυπτογραφία και Ασφάλεια General Tools for Proving Protocols Secure Develop simple, sound formalisms for reasoning about protocol security, and extend these to enable proofs of security at the system level. Automate the Design of Cryptographic Protocols Simplify and automate design of efficient end-to-end protocols Expand the Reach of Zero-Knowledge Proofs Find more problems that (a) have efficient zero-knowledge proofs and (b) are useful primitives in protocols. Find a general construction of zero-knowledge proofs where the number of cryptographic operations is smaller than the circuit-size for verification. Designing Secure Public Functions Functions that are sufficiently unstructured that it would be difficult to determine them from simply computing them for a moderate number of inputs. Scheme for encrypting programs that does not change the function they compute and yet is not efficiently invertible. Find Public-Key Cryptosystems that are Safe from Quantum Computers can we design a public-key cryptosystem that is secure unless P = NP? 22

23 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Θέµατα για Συνδυαστικούς Αλγορίθµους Find Polynomial-Time Algorithms for Long-Open Problems e.g., Factoring, Graph Isomorphism, 3-Processor Scheduling Find a Strongly Polynomial-Time Algorithm for Linear Programming (both for a standard computer model and for a real number RAM for n variables and m constraints, the Tardos algorithm is restricted to 0, 1, -1 coefficients) Quantifying Approximability for NP-Hard Problems Understanding Metaheuristics e.g., Simulated Annealing, Genetic Algorithms, TABU Search, Neural Nets, Greedy Randomized Adaptive Search Procedure (GRASP), Go-with-the-Winners Faster Polynomial-Time Algorithms e.g., Multiplying N by N Matrices, Assignment Problem, Min Cut/Max Flow, Single Source Shortest Paths, Minimum Spanning Tree. Develop a Science of Algorithm Testing e.g., what constitutes an adequate set of test instances? One-Pass, Space-Efficient Algorithms for Massive Data Streams (especially for network-generated massive data streams) 23

24 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Κεντρικά Θέµατα για την Υπολογιστική Γεωµετρία Open Problems in Computational Geometry (try to bridge the gap between upper and lower bounds) What is the complexity of certifying general position: given a bounded-degree polynomial p in Q[X1...Xd] and n reals, do any d of them form a zero of p? Find a singly-exponential algorithm for computing a triangulation of a real semialgebraic set (or at least its homology groups)? How hard is geometric searching in a non-fixed number of dimensions? Find novel representation of shapes. In particular, representations that allow statistical inference, learning, matching and classification of shapes. Solve the ``big'' open problems in combinatorial geometry, eg, the size of k-sets, and single-face complexity for algebraic varieties. Generalize to computational topology (especially, a ``multiscale'' version that captures both geometry and topology). Address output-sensitive algorithms (eg, hidden surface removal). 24

25 15 Χρόνια Προσφοράς στην Εκπαίδευση την Έρευνα Κεντρικά Θέµατα για την Θεωρητική Πληροφορική Complexity The Power of Nondeterminism -- Does P = NP? (L=NL?) The Power of Randomization -- Does P = BPP? (L=BPL?) The Power of Complementation -- Does NP = co-np? (whereas L=co-L) The Power of Space -- Does P = PSPACE? 25

26