Konferenzen  >  Informatik  >  Informationstheorie und Grundlagen der Informatik

IEEE

The International Conference on Web Services (ICWS) has been a prime international forum for both researchers and industry practitioners to exchange the latest fundamental advances in the state of the art and practice of Web-based services, to identify emerging research topics, and to define the future of Web-based services. Areas include services modeling, development, publishing, discovery, recommendation, composition, testing, adaptation, and delivery, and Web services applications and standards.

Service Oriented Systems ● Service-Oriented Architecture (SOA) ● Service specification and modeling ● Service evolution ● Service Oriented Software Engineering methodologies ● Formal methods in services ● Micro-service and service mesh ● Software engineering for adaptive service-oriented systems ● Secure service lifecycle development ● Service ecosystems Services Discovery, Composition and Recommendation ● Service publishing and searching ● Automatic service composition ● Scientific workflows ● Business process integration and management ● Service coordination and cooperation ● Service-based data integration ● Data-driven service composition ● Knowledge-driven service composition ● Service orchestration and choreography for the future Internet ● Service recommendation Services QoS Management ● Quality-of-Service (QoS) modeling and management ● Service QoS evaluation and prediction ● Autonomic services ● Web services testing ● Performance aspects of cloud and service virtualization ● Service level agreements Services Security, Privacy and Trust ● Service security ● Privacy and trust ● Dependable and secure services ● Service auditing ● Service policy control ● Service regulation and governance Service Applications beyond the Web ● Web Services for the Internet of Things (IoT) ● Services in Cyber-Physical Systems (CPS) ● Social networks and services ● Cloud services ● Edge services ● Mobile web services ● Satellite service computing ● Communication services ● XaaS (everything as a service) ● Service-based processing and querying ● Service-based recommendation and prediction ● Crowdsourcing Services, Conversational Services ● Metaverse/VR/AR services ● Services for Artificial Intelligence ● (Smart) Cybersecurity services ● Other applications AI in Web Services ● Generative AI in Services ● Generative AI as a Service (GaaS) ● Generative AI for API Creation, Integration, testing, and Personalization ● Security and Privacy in Generative AI-Driven Systems ● LLM and Multimodal Models enhanced service discovery, selection, composition ● LLM-driven service recommendation: algorithms, models, and performance ● AI for service customization and personalization ● Machine/Deep learning powered service discovery ● Process mining, anomaly detection, and data processing methods for service composition ● Security and privacy in AI-enhanced service architectures ● Service Reasoning with Generative AI Approaches ● Reinforcement Learning and Transformer Models for Web Services ● Innovative Applications of Generative AI in Web Services ● Explainable AI in Web Services ● Human-in-the-Loop AI Systems Datasets & Benchmarking for Service Computing Community ● Development and sharing of standard datasets ● Establishment of reliable and meaningful benchmarks ● Techniques for dataset creation, pre-processing, curation, and management in service computing ● Novel methodologies for performance evaluation using established benchmarks Web 3.0 and Decentralized Services ● Web 3.0 services leveraging blockchain, smart contracts, and decentralized architectures ● Tustless service environments and decentralized applications (dApps) ● Interoperability and integration challenges in Web 3.0 services ● Service governance, policy enforcement, and legal implications in decentralized ecosystems ● Novel service offerings and revenue models for the Web 3.0 landscape Emerging Technologies for Advanced Service-Oriented Computing: Opportunities, Challenges, and Applications ● AI enabled services ● Quantum Service Computing ● Digital Twins ● 3D Printing/Additive Manufacturing Techniques ● Blockchain ● Robotic Process Automation (RPA) ● Chatbots and Virtual Assistants ● Low-Code / No-Code Solutions ● Virtual Reality (VR) and Augmented Reality (AR) ● Green IT ● 5G Technology ● Metaverse Services ● Industry 4.0

e-Business, e-Government, Software as a service (SaaS),    Wirtschaftswissenschaft, Unternehmen und Marketing

The Fields Institute for Research in Mathematical Sciences

The Copmutational Complexity Conference (CCC) aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.

International Association of Ontology and its Applications (IAOA)

08-12 September 2025 (Catania, Italy), 04-05 September 2025 (online)

Algorithmen und Datenstrukturen,    Informations & Wissensmanagement, Big Data Computing

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

The Symposium is organised by the TSU Razmadze Mathematical Institute, the Centre for Language, Logic and Speech at the Tbilisi State University, the Georgian Academy of Sciences, the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam.

Mathematische Logik, Grundlagen der Mathematik,    Sprachwissenschaft

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Graphentheorie und Kombinatorik,    Statistik, Spieltheorie

An international autumn school "Proof and Computation" will be held from 14th to 20th September 2025 at Haus der bayerischen Landwirtschaft in Herrsching near Munich. Its aim is to bring together young researchers in the fields of Foundations of Mathematics, Computer Science and Philosophy.

Computer-gestütztes Beweisen,    Kurse und Veranstaltungen für Studenten der Mathematik

The conference is concerned with the theory of computability and complexity over real-valued data. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

Algebra,    Zahlentheorie, Arithmetik