The document discusses the all pairs shortest path problem, which aims to find the shortest distance between every pair of vertices in a graph. It explains that the algorithm works by calculating the minimum cost to traverse between nodes using intermediate nodes, according to the equation A_k(i,j)=min{A_{k-1}(i,j), A_{k-1}(i,k), A_{k-1}(k,j)}. An example is provided to illustrate calculating the shortest path between nodes over multiple iterations of the algorithm.
This presentation and we will explore some of the more complex areas of QML and present tips, tricks, best practices and common areas of error and confusion. The material is based on real-world experience developing customer applications for mobile, embedded and desktop.
Part II covers:
- Anchors
- Creating New Items
- States and Transitions
This document discusses using fuzzy multi-objective linear programming (FMOLP) to solve the traveling salesman problem (TSP). TSP aims to find the shortest route to visit each city once. FMOLP handles fuzzy constraints and goals. It formulates TSP as three objectives - minimizing cost, distance, and time. A case study applies FMOLP to find the optimal route between 4 cities. The solution maximizes satisfaction level α while meeting fuzzy constraints on each objective.
The model/view design pattern is the standard way of separating UI from business logic, especially when the data exchanged is dynamic. In a series of blog posts released in May, we presented an introduction to model/view design and provided an example of how this pattern is leveraged in Qt applications. In this webinar, we will go more in depth, illustrating model/view with a set of two QML programming examples. The first will consider the simple case where data size remains constant. The second will cover the more common situation where data size is dynamic.
The document discusses the static keyword in Java and its uses for variables, methods, blocks and nested classes. It explains that static members belong to the class rather than instances, and provides examples of static variables, methods, blocks and how they work. Key points include static variables having only one copy in memory and being shared across instances, static methods that can be called without an instance, and static blocks that initialize static fields when the class loads.
An algorithm is a finite set of instructions to accomplish a predefined task. Performance of an algorithm is measured by its time and space complexity, with common metrics being big O, big Omega, and big Theta notation. Common data structures include arrays, linked lists, stacks, queues, trees and graphs. Key concepts are asymptotic analysis of algorithms, recursion, and analyzing complexity classes like constant, linear, quadratic and logarithmic time.
The document discusses key concepts in Java programming including:
1. Java is an object-oriented programming language that is platform independent and allows developers to create applications, applets, and web applications.
2. The Java code is first compiled to bytecode, which can then be executed on any Java Virtual Machine (JVM) regardless of the underlying hardware or operating system.
3. Core Java concepts covered include classes, objects, encapsulation, inheritance, polymorphism, and abstraction. Operators, flow control statements, arrays, strings and object-oriented programming principles are also summarized.
The JDK contains the JRE plus development tools like the javac compiler and java runtime. The JRE contains libraries and files used by the JVM at runtime. The JVM provides the runtime environment to execute bytecode and allows Java to be platform independent, though the JVM itself is operating system dependent.
Strings In OOP(Object oriented programming)Danial Virk
The document discusses strings and string handling in Java. It covers the String and StringBuffer classes, basic string methods like length(), substring(), indexOf(), and replace(). It also discusses parsing strings with StringTokenizer and the differences between StringBuffer and String in terms of mutability and capacity. StringBuffer allows growing the string size while String is immutable.
Google Translate is a neural machine translation service developed by Google that can translate text, documents, and websites between over 100 languages. It uses neural networks to analyze input text and convert it to the desired output language. More than 500 million people use Google Translate each day to translate over 100 billion words, most commonly between English, Spanish, Arabic, Russian, Portuguese and Indonesian. The service can translate text via typing, documents via uploading, and speech via voice input on smartphones.
James Gosling initiated the Java language project in 1991. The first public implementation of Java was released as Java 1.0 in 1995. Oracle acquired Sun Microsystems in 2010. Java is an object-oriented programming language that is platform independent and promises "Write Once, Run Anywhere". A key component of Java is the Java Virtual Machine (JVM) which is responsible for memory allocation and provides a runtime environment for executing Java bytecode.
40+ examples of user defined methods in java with explanationHarish Gyanani
The document discusses user defined methods in Java and provides examples of simple programs that utilize methods. Some key points covered include:
- Advantages of using methods to organize and reuse code.
- Examples of methods that perform basic operations like addition, average calculation, data type conversions, etc.
- Passing arrays to methods and returning arrays from methods.
- Differences between functions and methods in Java.
- Overloading methods by changing the number and type of arguments.
- Implementing methods to calculate operations like LCM, HCF, prime number checks, etc.
This document provides an introduction and overview of the Python programming language. It discusses what Python is, its features, applications, and how to install Python on Windows and Linux systems. It also covers Python basics like variables, data types, operators, comments, conditional statements like if/else, and loops like for, while, and nested loops. Examples are provided for key concepts. The document is intended as a beginner tutorial for learning Python.
The purpose of making this presentation is to explain Kruskal's Algorithm in a simple and attractive way. However, the content of this presentation is taken from more than one resources and merged at one place for the better understanding of students. It also contains an example which will definitely help students to understand it more quickly.
The document discusses the knapsack problem, which involves selecting a subset of items that fit within a knapsack of limited capacity to maximize the total value. There are two versions - the 0-1 knapsack problem where items can only be selected entirely or not at all, and the fractional knapsack problem where items can be partially selected. Solutions include brute force, greedy algorithms, and dynamic programming. Dynamic programming builds up the optimal solution by considering all sub-problems.
A Primality test is an algorithm for determining whether an input number is Prime. Among other fields of mathematics, it is used for Cryptography. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
The document discusses clean coding practices for Java developers. It covers topics such as choosing meaningful names for variables, methods, and classes; writing code that is easy for others to understand; breaking methods down into single logical steps; and using fluent APIs to make code more readable. The presentation provides examples of clean code and ways to refactor code to follow best practices.
This document provides an overview of Java I/O including different types of I/O, how Java supports I/O through streams and classes like File, serialization, compression, Console, and Properties. It discusses byte and character streams, buffered streams, reading/writing files, and preferences. Key points are that Java I/O uses streams as an abstraction, byte streams operate on bytes while character streams use characters, and buffered streams improve efficiency by buffering reads/writes.
The document is a Visual Basic program for a hotel reservation system. It allows users to enter a guest name, select a room type and number, and pick check-in and check-out dates. It then calculates the room rate, number of nights stayed, and any applicable discounts (0-75% off for long stays). The total payment due is displayed along with a record of the reservation added to several list boxes.
The document discusses GUI technologies in Python. It covers Tkinter, which is the standard GUI library in Python. Tkinter can be used to create desktop applications and provides widgets like labels, buttons, entries and frames. It also discusses how to create windows, add widgets, handle events and create a simple calculator application as an example.
This document discusses strings and string buffers in Java. It defines strings as sequences of characters that are class objects implemented using the String and StringBuffer classes. It provides examples of declaring, initializing, concatenating and using various methods like length(), charAt() etc. on strings. The document also introduces the StringBuffer class for mutable strings and lists some common StringBuffer functions.
This document discusses dynamic programming and algorithms for solving all-pair shortest path problems. It begins by explaining dynamic programming as an optimization technique that works bottom-up by solving subproblems once and storing their solutions, rather than recomputing them. It then presents Floyd's algorithm for finding shortest paths between all pairs of nodes in a graph. The algorithm iterates through nodes, updating the shortest path lengths between all pairs that include that node by exploring paths through it. Finally, it discusses solving multistage graph problems using forward and backward methods that work through the graph stages in different orders.
Java dikembangkan oleh Sun Microsystem pada 1995 dan merupakan bahasa pemrograman berorientasi objek yang aman dan independen platform. JDK berisi alat kompilasi dan eksekusi untuk membuat dan menjalankan program Java.
The JDK contains the JRE plus development tools like the javac compiler and java runtime. The JRE contains libraries and files used by the JVM at runtime. The JVM provides the runtime environment to execute bytecode and allows Java to be platform independent, though the JVM itself is operating system dependent.
Strings In OOP(Object oriented programming)Danial Virk
The document discusses strings and string handling in Java. It covers the String and StringBuffer classes, basic string methods like length(), substring(), indexOf(), and replace(). It also discusses parsing strings with StringTokenizer and the differences between StringBuffer and String in terms of mutability and capacity. StringBuffer allows growing the string size while String is immutable.
Google Translate is a neural machine translation service developed by Google that can translate text, documents, and websites between over 100 languages. It uses neural networks to analyze input text and convert it to the desired output language. More than 500 million people use Google Translate each day to translate over 100 billion words, most commonly between English, Spanish, Arabic, Russian, Portuguese and Indonesian. The service can translate text via typing, documents via uploading, and speech via voice input on smartphones.
James Gosling initiated the Java language project in 1991. The first public implementation of Java was released as Java 1.0 in 1995. Oracle acquired Sun Microsystems in 2010. Java is an object-oriented programming language that is platform independent and promises "Write Once, Run Anywhere". A key component of Java is the Java Virtual Machine (JVM) which is responsible for memory allocation and provides a runtime environment for executing Java bytecode.
40+ examples of user defined methods in java with explanationHarish Gyanani
The document discusses user defined methods in Java and provides examples of simple programs that utilize methods. Some key points covered include:
- Advantages of using methods to organize and reuse code.
- Examples of methods that perform basic operations like addition, average calculation, data type conversions, etc.
- Passing arrays to methods and returning arrays from methods.
- Differences between functions and methods in Java.
- Overloading methods by changing the number and type of arguments.
- Implementing methods to calculate operations like LCM, HCF, prime number checks, etc.
This document provides an introduction and overview of the Python programming language. It discusses what Python is, its features, applications, and how to install Python on Windows and Linux systems. It also covers Python basics like variables, data types, operators, comments, conditional statements like if/else, and loops like for, while, and nested loops. Examples are provided for key concepts. The document is intended as a beginner tutorial for learning Python.
The purpose of making this presentation is to explain Kruskal's Algorithm in a simple and attractive way. However, the content of this presentation is taken from more than one resources and merged at one place for the better understanding of students. It also contains an example which will definitely help students to understand it more quickly.
The document discusses the knapsack problem, which involves selecting a subset of items that fit within a knapsack of limited capacity to maximize the total value. There are two versions - the 0-1 knapsack problem where items can only be selected entirely or not at all, and the fractional knapsack problem where items can be partially selected. Solutions include brute force, greedy algorithms, and dynamic programming. Dynamic programming builds up the optimal solution by considering all sub-problems.
A Primality test is an algorithm for determining whether an input number is Prime. Among other fields of mathematics, it is used for Cryptography. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
The document discusses clean coding practices for Java developers. It covers topics such as choosing meaningful names for variables, methods, and classes; writing code that is easy for others to understand; breaking methods down into single logical steps; and using fluent APIs to make code more readable. The presentation provides examples of clean code and ways to refactor code to follow best practices.
This document provides an overview of Java I/O including different types of I/O, how Java supports I/O through streams and classes like File, serialization, compression, Console, and Properties. It discusses byte and character streams, buffered streams, reading/writing files, and preferences. Key points are that Java I/O uses streams as an abstraction, byte streams operate on bytes while character streams use characters, and buffered streams improve efficiency by buffering reads/writes.
The document is a Visual Basic program for a hotel reservation system. It allows users to enter a guest name, select a room type and number, and pick check-in and check-out dates. It then calculates the room rate, number of nights stayed, and any applicable discounts (0-75% off for long stays). The total payment due is displayed along with a record of the reservation added to several list boxes.
The document discusses GUI technologies in Python. It covers Tkinter, which is the standard GUI library in Python. Tkinter can be used to create desktop applications and provides widgets like labels, buttons, entries and frames. It also discusses how to create windows, add widgets, handle events and create a simple calculator application as an example.
This document discusses strings and string buffers in Java. It defines strings as sequences of characters that are class objects implemented using the String and StringBuffer classes. It provides examples of declaring, initializing, concatenating and using various methods like length(), charAt() etc. on strings. The document also introduces the StringBuffer class for mutable strings and lists some common StringBuffer functions.
This document discusses dynamic programming and algorithms for solving all-pair shortest path problems. It begins by explaining dynamic programming as an optimization technique that works bottom-up by solving subproblems once and storing their solutions, rather than recomputing them. It then presents Floyd's algorithm for finding shortest paths between all pairs of nodes in a graph. The algorithm iterates through nodes, updating the shortest path lengths between all pairs that include that node by exploring paths through it. Finally, it discusses solving multistage graph problems using forward and backward methods that work through the graph stages in different orders.
Java dikembangkan oleh Sun Microsystem pada 1995 dan merupakan bahasa pemrograman berorientasi objek yang aman dan independen platform. JDK berisi alat kompilasi dan eksekusi untuk membuat dan menjalankan program Java.
Dokumen tersebut merangkum pengertian bahasa pemrograman Java, sejarah, fitur, dan konsep dasarnya seperti tipe data, variabel, operator, input/output, pengulangan, dan percabangan. Java dikembangkan oleh James Gosling di Sun Microsystems pada 1995 dan mampu berjalan di berbagai platform berkat mesin virtualnya.
Dokumen tersebut memberikan penjelasan mengenai konsep dasar data mining klasifikasi, proses klasifikasi menggunakan algoritma Naive Bayes, serta contoh kasus klasifikasi menggunakan atribut usia, pendapatan, pekerjaan, dan punya deposito atau tidak.
Here is an algorithm to determine which child stole the cookie:
1. Interview each child individually
2. Ask each child if they took a cookie
3. If the child says no, go to the next child
4. If the child says yes, that child is the cookie thief
5. If all children say no, no one has confessed - the cookie thief remains unknown
This uses a sequence structure to interview each child one by one, and a selection structure (if/then) to determine if the child confesses or moving on to the next child.
Perulangan adalah suatu cara untuk mengulang satu atau sekumpulan perintah sampai mencapai kondisi tertentu. Terdapat tiga bentuk perulangan yaitu for, while, dan do while. Perulangan for digunakan saat jumlah perulangan diketahui, sedangkan while dan do while digunakan saat kondisi perulangan diketahui.
Pemrograman berorientasi objek ii 04 prosedur dan fungsiEdri Yunizal
This document discusses procedures and functions in Visual Basic programming. It contains the following key points:
1. Procedures (subs) are blocks of code that execute a set of instructions but do not return a value. Functions are similar but do return a value.
2. Procedures and functions can be declared with keywords like "Sub", "Function", and "End Sub/Function". They can optionally take parameters and return values of a specified data type.
3. Examples are given of creating simple procedures and functions, including how to call them. Modules are also introduced as a way to group related procedures and functions.
Fungsi merupakan bagian program yang digunakan untuk mengerjakan tugas tertentu dan menghasilkan nilai. Fungsi digunakan untuk menghindari penulisan kode berulang dan membuat program lebih terorganisir. Ada berbagai cara untuk mendeklarasikan dan memanggil fungsi serta menggunakan argumen dan nilai dalam fungsi.
Dokumen ini memberikan instruksi untuk tugas UAS pemrograman Java tentang membuat laporan jadwal input yang telah dibuat, dengan group by dosen menggunakan query di MS Access, dan hasilnya harus dikirim lewat email ke alamat tertentu.
This document discusses looping structures in algorithms and programming. It defines looping as repeating statements to fulfill a looping condition. The main types of looping structures are for, while, and repeat loops. Examples are given in pseudocode and Pascal to illustrate for loops that count ascending and descending, while loops, and repeat loops. Exercises are provided to practice different types of loops.
Array dapat digunakan untuk menyimpan banyak data yang bertipe sama sekaligus. Nilai-nilai dalam array dapat diproses secara berurutan dengan menggunakan indeks. Ada beberapa cara untuk menemukan nilai maksimum dalam array, salah satunya dengan membandingkan setiap elemen dengan nilai maksimum sementara.
Algorithm and Programming (Introduction of dev pascal, data type, value, and ...Adam Mukharil Bachtiar
This file contains explanation about introduction of dev pascal, data type, value, and identifier. This file was used in my Algorithm and Programming Class.
Soal UAS Pemrograman Desktop kelas 11 SMK semester ganjil tahun ajaran 2015-2016Saprudin Eskom
Dokumen tersebut berisi soal-soal ujian akhir semester ganjil mata pelajaran Pemrograman Desktop kelas XI RPL SMK Negeri 1 Pandeglang tahun pelajaran 2015/2016. Soal-soal tersebut meliputi konsep dasar pemrograman desktop, bahasa pemrograman Java, serta penggunaan aplikasi NetBeans.
Algoritma untuk menukar isi dua gelas yang berisi minuman berbeda dengan menggunakan gelas kosong sebagai tempat menukar isinya, sehingga pada akhirnya masing-masing gelas berisi minuman yang sebelumnya ada pada gelas lain. Algoritma terdiri dari 4 langkah untuk menukar isi gelas secara logis dan efektif.
Dokumen tersebut memberikan tips untuk membuat formatting kode program yang baik agar mudah dibaca dan dipahami. Terdapat dua jenis formatting, yaitu vertical dan horizontal formatting. Secara vertical, kode perlu diatur dengan memperhatikan konsep-konsep, jarak antar konsep, kerapatan kode yang berkaitan, dan letak deklarasi dan pemanggilan fungsi. Secara horizontal, perlu memperhatikan pemberian jarak, penyamaan baris, dan pengindentasian untuk membedakan struktur program.
Slide ini menjelaskan perihal penggunaan komentar yang baik dan buruk pada suatu kode program. Slide ini merupakan bahan ajar untuk mata kuliah Clean Code dan Design Pattern.
Dokumen tersebut memberikan tips-tips untuk membuat nama variabel, fungsi, kelas, dan paket yang baik dalam pembuatan kode program. Beberapa tips utama adalah menggunakan nama yang jelas maksudnya, hindari penggunaan encoding, gunakan kata benda untuk nama kelas dan verba untuk nama metode, serta tambahkan konteks yang bermakna.
Dokumen tersebut membahas tentang pengujian perangkat lunak, termasuk definisi pengujian perangkat lunak, tujuan pengujian, jenis pengujian seperti manual testing, automated testing, unit testing, integration testing, serta metode pengujian seperti white box testing dan black box testing.
Slide ini berisi penjelasan tentang Data Mining Klasifikasi. Di dalamnya ada tiga algoritma yang dibahas, yaitu: Naive Bayes, kNN, dan ID3 (Decision Tree).
Dokumen tersebut membahas algoritma program dinamis untuk menentukan lintasan terpendek antara dua simpul dalam sebuah graf. Metode yang digunakan adalah program dinamis mundur dimana permasalahan dibagi menjadi beberapa tahap dan dihitung secara mundur untuk menentukan nilai optimal pada setiap tahap. Hasil akhir adalah terdapat tiga lintasan terpendek dengan panjang 11 antara simpul 1 dan 10.
Teks tersebut membahas strategi algoritma Divide and Conquer untuk memecahkan masalah. Strategi ini membagi masalah menjadi submasalah kecil, memecahkan submasalah tersebut secara rekursif, lalu menggabungkan hasilnya untuk mendapatkan solusi masalah awal. Dua contoh masalah yang dijelaskan adalah mencari nilai maksimum dan minimum dalam tabel, serta mencari pasangan titik terdekat dalam himpunan titik.
Slide ini berisi penjelasan tentang teorema-teorema yang berlaku untuk notasi asimptotik beserta cara perhitungannya untuk kebutuhan waktu suatu algoritma.
Have you upgraded your application from Qt 5 to Qt 6? If so, your QML modules might still be stuck in the old Qt 5 style—technically compatible, but far from optimal. Qt 6 introduces a modernized approach to QML modules that offers better integration with CMake, enhanced maintainability, and significant productivity gains.
In this webinar, we’ll walk you through the benefits of adopting Qt 6 style QML modules and show you how to make the transition. You'll learn how to leverage the new module system to reduce boilerplate, simplify builds, and modernize your application architecture. Whether you're planning a full migration or just exploring what's new, this session will help you get the most out of your move to Qt 6.
Build Smarter, Deliver Faster with Choreo - An AI Native Internal Developer P...WSO2
Enterprises must deliver intelligent, cloud native applications quickly—without compromising governance or scalability. This session explores how an internal developer platform increases productivity via AI for code and accelerates AI-native app delivery via code for AI. Learn practical techniques for embedding AI in the software lifecycle, automating governance with AI agents, and applying a cell-based architecture for modularity and scalability. Real-world examples and proven patterns will illustrate how to simplify delivery, enhance developer productivity, and drive measurable outcomes.
Learn more: https://wso2.com/choreo
Code and No-Code Journeys: The Coverage OverlookApplitools
Explore practical ways to expand visual and functional UI coverage without deep coding or heavy maintenance in this session. Session recording and more info at applitools.com
NTRODUCTION TO SOFTWARE TESTING
• Definition:
• Software testing is the process of evaluating and
verifying that a software application or system meets
specified requirements and functions correctly.
• Purpose:
• Identify defects and bugs in the software.
• Ensure the software meets quality standards.
• Validate that the software performs as intended in
various scenarios.
• Importance:
• Reduces risks associated with software failures.
• Improves user satisfaction and trust in the product.
• Enhances the overall reliability and performance of
the software
Async-ronizing Success at Wix - Patterns for Seamless Microservices - Devoxx ...Natan Silnitsky
In a world where speed, resilience, and fault tolerance define success, Wix leverages Kafka to power asynchronous programming across 4,000 microservices. This talk explores four key patterns that boost developer velocity while solving common challenges with scalable, efficient, and reliable solutions:
1. Integration Events: Shift from synchronous calls to pre-fetching to reduce query latency and improve user experience.
2. Task Queue: Offload non-critical tasks like notifications to streamline request flows.
3. Task Scheduler: Enable precise, fault-tolerant delayed or recurring workflows with robust scheduling.
4. Iterator for Long-running Jobs: Process extensive workloads via chunked execution, optimizing scalability and resilience.
For each pattern, we’ll discuss benefits, challenges, and how we mitigate drawbacks to create practical solutions
This session offers actionable insights for developers and architects tackling distributed systems, helping refine microservices and adopting Kafka-driven async excellence.
Integrating Survey123 and R&H Data Using FMESafe Software
West Virginia Department of Transportation (WVDOT) actively engages in several field data collection initiatives using Collector and Survey 123. A critical component for effective asset management and enhanced analytical capabilities is the integration of Geographic Information System (GIS) data with Linear Referencing System (LRS) data. Currently, RouteID and Measures are not captured in Survey 123. However, we can bridge this gap through FME Flow automation. When a survey is submitted through Survey 123 for ArcGIS Portal (10.8.1), it triggers FME Flow automation. This process uses a customized workbench that interacts with a modified version of Esri's Geometry to Measure API. The result is a JSON response that includes RouteID and Measures, which are then applied to the feature service record.
Revolutionize Your Insurance Workflow with Claims Management SoftwareInsurance Tech Services
Claims management software enhances efficiency, accuracy, and satisfaction by automating processes, reducing errors, and speeding up transparent claims handling—building trust and cutting costs. Explore More - https://www.damcogroup.com/insurance/claims-management-software
Agentic Techniques in Retrieval-Augmented Generation with Azure AI SearchMaxim Salnikov
Discover how Agentic Retrieval in Azure AI Search takes Retrieval-Augmented Generation (RAG) to the next level by intelligently breaking down complex queries, leveraging full conversation history, and executing parallel searches through a new LLM-powered query planner. This session introduces a cutting-edge approach that delivers significantly more accurate, relevant, and grounded answers—unlocking new capabilities for building smarter, more responsive generative AI applications.
Traditional Retrieval-Augmented Generation (RAG) pipelines work well for simple queries—but when users ask complex, multi-part questions or refer to previous conversation history, they often fall short. That’s where Agentic Retrieval comes in: a game-changing advancement in Azure AI Search that brings LLM-powered reasoning directly into the retrieval layer.
This session unveils how agentic techniques elevate your RAG-based applications by introducing intelligent query planning, subquery decomposition, parallel execution, and result merging—all orchestrated by a new Knowledge Agent. You’ll learn how this approach significantly boosts relevance, groundedness, and answer quality, especially for sophisticated enterprise use cases.
Key takeaways:
- Understand the evolution from keyword and vector search to agentic query orchestration
- See how full conversation context improves retrieval accuracy
- Explore measurable improvements in answer relevance and completeness (up to 40% gains!)
- Get hands-on guidance on integrating Agentic Retrieval with Azure AI Foundry and SDKs
- Discover how to build scalable, AI-first applications powered by this new paradigm
Whether you're building intelligent copilots, enterprise Q&A bots, or AI-driven search solutions, this session will equip you with the tools and patterns to push beyond traditional RAG.
Generative Artificial Intelligence and its ApplicationsSandeepKS52
The exploration of generative AI begins with an overview of its fundamental concepts, highlighting how these technologies create new content and ideas by learning from existing data. Following this, the focus shifts to the processes involved in training and fine-tuning models, which are essential for enhancing their performance and ensuring they meet specific needs. Finally, the importance of responsible AI practices is emphasized, addressing ethical considerations and the impact of AI on society, which are crucial for developing systems that are not only effective but also beneficial and fair.
Providing Better Biodiversity Through Better DataSafe Software
This session explores how FME is transforming data workflows at Ireland’s National Biodiversity Data Centre (NBDC) by eliminating manual data manipulation, incorporating machine learning, and enhancing overall efficiency. Attendees will gain insight into how NBDC is using FME to document and understand internal processes, make decision-making fully transparent, and shine a light on underlying code to improve clarity and reduce silent failures.
The presentation will also outline NBDC’s future plans for FME, including empowering staff to access and query data independently, without relying on external consultants. It will also showcase ambitions to connect to new data sources, unlock the full potential of its valuable datasets, create living atlases, and place its valuable data directly into the hands of decision-makers across Ireland—ensuring that biodiversity is not only protected but actively enhanced.
Automating Map Production With FME and PythonSafe Software
People still love a good paper map, but every time a request lands on a GIS team’s desk, it takes time to create that perfect, individual map—even when you're ready and have projects prepped. Then come the inevitable changes and iterations that add even more time to the process. This presentation explores a solution for automating map production using FME and Python. FME handles the setup of variables, leveraging GIS reference layers and parameters to manage details like map orientation, label sizes, and layout elements. Python takes over to export PDF maps for each location and template size, uploading them monthly to ArcGIS Online. The result? Fresh, regularly updated maps, ready for anyone to grab anytime—saving you time, effort, and endless revisions while keeping users happy with up-to-date, accessible maps.
In today's world, artificial intelligence (AI) is transforming the way we learn.
This talk will explore how we can use AI tools to enhance our learning experiences, by looking at some (recent) research that has been done on the matter.
But as we embrace these new technologies, we must also ask ourselves:
Are we becoming less capable of thinking for ourselves?
Do these tools make us smarter, or do they risk dulling our critical thinking skills?
This talk will encourage us to think critically about the role of AI in our education. Together, we will discover how to use AI to support our learning journey while still developing our ability to think critically.
From Chaos to Clarity - Designing (AI-Ready) APIs with APIOps CyclesMarjukka Niinioja
Teams delivering API are challenges with:
- Connecting APIs to business strategy
- Measuring API success (audit & lifecycle metrics)
- Partner/Ecosystem onboarding
- Consistent documentation, security, and publishing
🧠 The big takeaway?
Many teams can build APIs. But few connect them to value, visibility, and long-term improvement.
That’s why the APIOps Cycles method helps teams:
📍 Start where the pain is (one “metro station” at a time)
📈 Scale success across strategy, platform, and operations
🛠 Use collaborative canvases to get buy-in and visibility
Want to try it and learn more?
- Follow APIOps Cycles in LinkedIn
- Visit the www.apiopscycles.com site
- Subscribe to email list
-
How the US Navy Approaches DevSecOps with Raise 2.0Anchore
Join us as Anchore's solutions architect reveals how the U.S. Navy successfully approaches the shift left philosophy to DevSecOps with the RAISE 2.0 Implementation Guide to support its Cyber Ready initiative. This session will showcase practical strategies for defense application teams to pivot from a time-intensive compliance checklist and mindset to continuous cyber-readiness with real-time visibility.
Learn how to break down organizational silos through RAISE 2.0 principles and build efficient, secure pipeline automation that produces the critical security artifacts needed for Authorization to Operate (ATO) approval across military environments.
The Future of Open Source Reporting Best Alternatives to Jaspersoft.pdfVarsha Nayak
In recent years, organizations have increasingly sought robust open source alternative to Jasper Reports as the landscape of open-source reporting tools rapidly evolves. While Jaspersoft has been a longstanding choice for generating complex business intelligence and analytics reports, factors such as licensing changes and growing demands for flexibility have prompted many businesses to explore other options. Among the most notable alternatives to Jaspersoft, Helical Insight stands out for its powerful open-source architecture, intuitive analytics, and dynamic dashboard capabilities. Designed to be both flexible and budget-friendly, Helical Insight empowers users with advanced features—such as in-memory reporting, extensive data source integration, and customizable visualizations—making it an ideal solution for organizations seeking a modern, scalable reporting platform. This article explores the future of open-source reporting and highlights why Helical Insight and other emerging tools are redefining the standards for business intelligence solutions.
In a tight labor market and tighter economy, PMOs and resource managers must ensure that every team member is focused on the highest-value work. This session explores how AI reshapes resource planning and empowers organizations to forecast capacity, prevent burnout, and balance workloads more effectively, even with shrinking teams.
13. ExampleofProcedure
(SleepProcedure) • Brush your teeth
• Go to bed
• Pray
• Cover your body with bedcover
• Count the sheep (if you are insomnia)
• Start to dream
• Wake up (if you are not death)
• Pray again
14. Format of Procedure (Algorithm Notation)
Procedure NamaProsedur (Parameter jika ada)
{I.S.: Keadaan awal sebelum prosedur dijalankan}
{F.S.: Keadaan akhir sesudah prosedur dijalankan}
Kamus:
{Variabel, konstanta, tipe buatan lokal}
Algoritma:
{Badan Prosedur, Berisi instruksi}
EndProcedure
15. Format of Procedure (Pascal Notation)
procedure NamaProsedur (Parameter jika ada);
{Variabel, konstanta, tipe buatan}
begin
{Badan Prosedur, Berisi instruksi}
end;
17. Example of Procedure (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
13
Procedure HitungLuasPersegi
{I.S: Diinputkan sisi oleh pengguna}
{F.S: Menampilkan hasil perhitungan luas persegi di layar}
Kamus:
sisi:integer
luas:integer
Algoritma:
input(sisi)
luas sisi * sisi
output(‘Luas Persegi = ‘,luas)
EndProcedure
18. Example of Procedure (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
13
procedure HitungLuasPersegi;
var
sisi:integer;
luas:integer;
begin
write(‘Masukan sisi : ‘);readln(sisi);
luas sisi * sisi;
writeln(‘Luas Persegi = ‘,luas);
write(‘Tekan sembarang tombol untuk keluar...’);
readkey();
end;
20. Format of Calling Procedure (Algorithm)
NamaProsedur
Atau
NamaProsedur(parameter jika ada)
21. Format of Calling Procedure (Algorithm)
NamaProsedur;
Atau
NamaProsedur(parameter jika ada);
23. Example of Calling Procedure (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
Algoritma PanggilHitungLuasPersegi
{I.S: Diinputkan sebuah bilangan oleh pengguna}
{F.S: Memanggil prosedur sebanyak bilangan}
Kamus:
i,bil:integer {kamus global}
procedure HitungLuasPersegi {Cukup Headernya saja}
Algoritma:
input(bil)
for i 1 to bil do
HitungLuasPersegi {memanggil prosedur}
endfor
24. Example of Calling Procedure (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
13
program PanggilHitungLuasPersegi;
uses crt;
var
bil:integer;
{Prosedur HitungLuasPersegi kamu diletakkan di sini}
begin
write(‘Masukan bilangan = ‘);readln(bil);
for i 1 to bil do
HitungLuasPersegi; {memanggil prosedur}
{Baris penutup jangan sampai lupa!!!}
end.
28. Local Variable (Algorithm Notation)
Procedure NamaProsedur (Parameter jika ada)
{I.S.: Keadaan awal sebelum prosedur dijalankan}
{F.S.: Keadaan akhir sesudah prosedur dijalankan}
Kamus:
{Identifier lokal diletakkan di sini}
Algoritma:
{Badan Prosedur, Berisi instruksi}
EndProcedure
FORMAL PARAMETER
29. Global Variable (Algorithm Notation)
Algoritma judul_algoritma
{I.S.: diisi keadaan yang terjadi di awal algoritma}
{F.S.: diisi keadaan yang terjadi di akhir algoritma}
Kamus/Deklarasi:
{Identifier global diletakkan di sini}
Algoritma/Deskripsi:
{diisi dengan input, proses, dan output}
30. Local and Global Variable (Pascal Notation)
program nama_program;
var
{identifier global di sini}
procedure nama_prosedur (parameter jika ada);
var
{identifier lokal di sini}
begin
end;
begin
end.
35. Input Parameter (Algorithm Notation)
Procedure NamaProsedur (Input NamaVariabel:TipeData)
{I.S.: Keadaan awal sebelum prosedur dijalankan}
{F.S.: Keadaan akhir sesudah prosedur dijalankan}
Kamus:
{Identifier lokal diletakkan di sini}
Algoritma:
{Badan Prosedur, Berisi instruksi}
EndProcedure
36. Calling Input Parameter (Algorithm Notation)
Algoritma NamaProsedur
{I.S.: Keadaan awal sebelum algoritma dijalankan}
{F.S.: Keadaan akhir sesudah algoritma dijalankan}
Kamus:
{Identifier global diletakkan di sini}
Procedure NamaProsedur (Input NamaVariabel:TipeData)
Algoritma:
NamaProsedur(NamaVariabel) {pemanggilan prosedur}
EndProcedure
ACTUAL PARAMETER
37. Input Parameter (Pascal Notation)
program nama_program;
var
{identifier global di sini}
procedure nama_prosedur (variabel:tipedata);
var
{identifier lokal di sini}
begin
end;
Begin
nama_prosedur(variabel);{pemanggilan prosedur}
end.
39. Example of Input Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
Procedure Persegi(Input sisi:integer)
{I.S: Menerima input berupa sisi}
{F.S: Menampilkan luas dan keliling persegi}
Kamus:
luas,keliling:integer
Algoritma:
luas sisi * sisi
keliling 4 * sisi
output(luas,keliling)
EndProcedure
40. Example of Calling Input Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
Algoritma PanggilHitungLuasPersegi
{I.S: Diinputkan sisi oleh pengguna}
{F.S: Memanggil prosedur persegi}
Kamus:
sisi:integer
procedure Persegi(Input sisi:integer)
Algoritma:
input(sisi)
Persegi(sisi)
41. Example of Input Parameter (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
program HitungPersegi;
uses crt;
var
sisi:integer;
procedure persegi(sisi:integer);
var
luas,keliling:integer;
begin
luas := sisi * sisi;
keliling := 4 * sisi;
writeln(‘Luas Persegi : ‘,luas); {bersambung}
42. Example of Input Parameter (Pascal)
15
16
17
18
19
20
21
22
23
24
writeln(‘Keliling persegi : ‘,keliling);
end;
begin
write(‘Masukan sisi persegi= ‘);readln(sisi);
persegi(sisi);
writeln();
write(‘Tekan sembarang tombol untuk menutup...’);
readkey();
end.
44. Output Parameter (Algorithm Notation)
Procedure NamaProsedur (Output NamaVariabel:TipeData)
{I.S.: Keadaan awal sebelum prosedur dijalankan}
{F.S.: Keadaan akhir sesudah prosedur dijalankan}
Kamus:
{Identifier lokal diletakkan di sini}
Algoritma:
{Badan Prosedur, Berisi instruksi}
EndProcedure
45. Calling Output Parameter (Algorithm Notation)
Algoritma NamaProsedur
{I.S.: Keadaan awal sebelum algoritma dijalankan}
{F.S.: Keadaan akhir sesudah algoritma dijalankan}
Kamus:
{Identifier global diletakkan di sini}
Procedure NamaProsedur (Output NamaVariabel:TipeData)
Algoritma:
NamaProsedur(NamaVariabel) {pemanggilan prosedur}
EndProcedure
46. Output Parameter (Pascal Notation)
program nama_program;
var
{identifier global di sini}
procedure nama_prosedur (var variabel:tipedata);
var
{identifier lokal di sini}
begin
end;
Begin
nama_prosedur(variabel);{pemanggilan prosedur}
end.
48. Example of Output Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
Procedure Persegi(Output luas,keliling:integer)
{I.S: Meminta input sisi dari pengguna}
{F.S: Mengirimkan nilai luas dan keliling persegi}
Kamus:
sisi:integer
Algoritma:
input(sisi)
luas sisi * sisi
keliling 4 * sisi
EndProcedure
49. Example of Calling Output Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
Algoritma PanggilHitungLuasPersegi
{I.S: Memanggil prosedur persegi}
{F.S: Menampilkan nilai dari prosedur persegi}
Kamus:
luas,keliling:integer
Procedure Persegi(Output luas,keliling:integer)
Algoritma:
Persegi(luas,keliling)
output(luas,keliling)
50. Example of Output Parameter (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
program HitungPersegi;
uses crt;
var
luas,keliling:integer;
procedure persegi(var luas,keliling:integer);
var
sisi:integer;
begin
write(‘Masukan sisi persegi= ‘);readln(sisi);
luas := sisi * sisi;
keliling := 4 * sisi; {bersambung}
51. Example of Output Parameter (Pascal)
15
16
17
18
19
20
21
22
23
24
end;
begin
persegi(luas,keliling);
writeln(‘Keliling persegi : ‘,keliling);
writeln(‘Luas Persegi : ‘,luas);
writeln();
write(‘Tekan sembarang tombol untuk menutup...’);
readkey();
end.
53. Input/Output Parameter (Algorithm Notation)
Procedure NamaProsedur (I/O NamaVariabel:TipeData)
{I.S.: Keadaan awal sebelum prosedur dijalankan}
{F.S.: Keadaan akhir sesudah prosedur dijalankan}
Kamus:
{Identifier lokal diletakkan di sini}
Algoritma:
{Badan Prosedur, Berisi instruksi}
EndProcedure
54. Calling Input/Output Parameter (Algorithm Notation)
Algoritma NamaProsedur
{I.S.: Keadaan awal sebelum algoritma dijalankan}
{F.S.: Keadaan akhir sesudah algoritma dijalankan}
Kamus:
{Identifier global diletakkan di sini}
Procedure NamaProsedur (I/O NamaVariabel:TipeData)
Algoritma:
NamaProsedur(NamaVariabel) {pemanggilan prosedur}
EndProcedure
55. Input/Ouput Parameter (Pascal Notation)
program nama_program;
var
{identifier global di sini}
procedure nama_prosedur (var variabel:tipedata);
var
{identifier lokal di sini}
begin
end;
Begin
nama_prosedur(variabel);{pemanggilan prosedur}
end.
57. Example of Input/Output Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
Procedure Persegi(I/O sisi:integer,Output luas,keliling:integer)
{I.S: Menerima input sisi}
{F.S: Mengirimkan nilai sisi, luas, dan keliling persegi}
Kamus:
Algoritma:
luas sisi * sisi
keliling 4 * sisi
sisi sisi + 1; {lihat apa yang terjadi}
EndProcedure
58. Example of Calling Output Parameter (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
Algoritma PanggilHitungLuasPersegi
{I.S: Memanggil prosedur persegi}
{F.S: Menampilkan nilai dari prosedur persegi}
Kamus:
sisi,luas,keliling:integer
Procedure Persegi(I/O sisi:integer,Output luas,keliling:integer)
Algoritma:
input(sisi)
Persegi(sisi,luas,keliling)
output(sisi,luas,keliling) {Berapa nilai sisinya?}
59. Example of Input/Output Parameter (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
program HitungPersegi;
uses crt;
var
luas,keliling:integer;
procedure persegi(sisi:integer;var luas,keliling:integer);
begin
luas := sisi * sisi;
keliling := 4 * sisi;
sisi := sisi + 1; {Lihat apa yang terjadi}
end;
60. Example of Input/Output Parameter (Pascal)
13
14
15
16
17
18
19
20
21
22
begin
write(‘Masukan sisi persegi= ‘);readln(sisi);
persegi(sisi,luas,keliling);
writeln(‘Keliling persegi : ‘,keliling);
writeln(‘Luas Persegi : ‘,luas);
writeln(‘Sisi persegi : ‘,sisi);
writeln();
write(‘Tekan sembarang tombol untuk menutup...’);
readkey();
end.
64. Format of Function (Algorithm Notation)
FUnction NamaFungsi (Parameter jika ada) tipefungsi
{I.S.: Keadaan awal sebelum fungsi dijalankan}
{F.S.: Keadaan akhir sesudah fungsi dijalankan}
Kamus:
{Variabel, konstanta, tipe buatan lokal}
Algoritma:
{Badan fungsi, Berisi instruksi}
return VALUE {tipenya sama dengan tipe fungsi}
EndFunction
65. Format of Procedure (Pascal Notation)
function NamaFungsi (Parameter jika ada):tipefungsi;
{Variabel, konstanta, tipe buatan}
begin
{Badan Fungsi, Berisi instruksi}
NamaFungsi := VALUE; (tipenya sama dengan tipe fungsi}
end;
67. Example of Function (Algorithm)
1
2
3
4
5
6
7
8
9
Function LuasPersegi(Input sisi:integer) integer
{I.S: Menerima input berupa sisi}
{F.S: Menampilkan luas dan keliling persegi}
Kamus:
Algoritma:
return sisi * sisi
EndFunction
68. Example of Function (Algorithm)
1
2
3
4
5
6
7
8
9
10
11
12
Algoritma PanggilLuasPersegi
{I.S: Diinputkan sisi oleh pengguna}
{F.S: Menampilkan nilai fungsi luas persegi}
Kamus:
sisi,luas:integer
Function LuasPersegi(Input sisi:integer) integer
Algoritma:
input(sisi)
luas LuasPersegi(sisi)
output(luas)
69. Example of Function (Pascal)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
program HitungPersegi;
uses crt;
var
sisi,luas:integer;
function LuasPersegi(sisi:integer):integer;
begin
LuasPersegi := sisi * sisi;
end;
begin
write(‘Masukan sisi persegi= ‘);readln(sisi);
luas := LuasPersegi(sisi); {Pemanggilan Function}
70. Example of Function (Pascal)
15
16
17
18
19
write(‘Luas persegi : ‘,luas);
writeln();
write(‘Tekan sembarang tombol untuk menutup...’);
readkey();
end.