The document discusses artificial intelligence techniques used in commercial video games. It notes that pathfinding algorithms like A* are still commonly used. For behavior and strategy, games typically use scripting, finite state machines, rule engines, or decision trees to hardcode actions. This results in a lack of flexibility and reasoning. The document suggests that more reusable AI engines based on planning techniques could help, citing examples like GOAP that allow dynamic planning and re-planning to achieve goals. However, such engines still do not support reasoning about why particular actions are taken.
This presentation provides and overview of the paper "Jump-Diffusion Risk-Sensitive Asset Management." The paper proposes a solution to a portfolio optimization problem in which asset prices are represented by SDEs driven by Brownian motion and a Poisson random measure,
with drifts that are functions of an auxiliary diffusion ‘factor’ process.
05 history of cv a machine learning (theory) perspective on computer visionzukun
This document provides an overview of machine learning algorithms used in computer vision from the perspective of a machine learning theorist. It discusses how the theorist got involved in a computer vision project in 2002 and summarizes key algorithms at that time like boosting, support vector machines, and their developments. It also provides historical context and comparisons of algorithms like perceptron and Winnow. The document uses examples to explain concepts like kernels and the kernel trick in support vector machines.
This document discusses heterogeneous agent models without aggregate uncertainty. It introduces a model with a continuum of agents who face idiosyncratic income fluctuations but no aggregate shocks. There is a unique stationary equilibrium with constant interest rates and wages. The document discusses the recursive competitive equilibrium, existence and uniqueness of the stationary equilibrium, transition functions, computation methods, and some qualitative results from calibrating the model.
This chapter discusses representing systems using transfer functions. It covers obtaining the transfer function by taking the Laplace transform of the input-output differential equation. Transfer functions allow representing systems in the frequency domain. Key concepts covered include poles and zeros of a system, frequency response functions, and practical passive filters using resistor-inductor-capacitor components. Transfer functions of interconnected systems are also addressed.
Label propagation - Semisupervised Learning with Applications to NLPDavid Przybilla
Label propagation is a semi-supervised learning algorithm that propagates labels from a small set of labeled data points to unlabeled data points. The algorithm constructs a graph with nodes for each data point and weighted edges representing similarity between points. It then iteratively propagates the labels across the graph from labeled to unlabeled points until convergence, resulting in "soft" probabilistic labels for all points. The algorithm aims to minimize an energy function that encourages points connected by strong edges to receive similar labels. It performs well with limited labeled data by leveraging the graph structure to make predictions for unlabeled points.
The inverse of a function "undoes" the effect of the function. We look at the implications of that property in the derivative, as well as logarithmic functions, which are inverses of exponential functions.
The inverse of a function "undoes" the effect of the function. We look at the implications of that property in the derivative, as well as logarithmic functions, which are inverses of exponential functions.
This presentation provides and overview of the paper "Jump-Diffusion Risk-Sensitive Asset Management." The paper proposes a solution to a portfolio optimization problem in which asset prices are represented by SDEs driven by Brownian motion and a Poisson random measure,
with drifts that are functions of an auxiliary diffusion ‘factor’ process.
05 history of cv a machine learning (theory) perspective on computer visionzukun
This document provides an overview of machine learning algorithms used in computer vision from the perspective of a machine learning theorist. It discusses how the theorist got involved in a computer vision project in 2002 and summarizes key algorithms at that time like boosting, support vector machines, and their developments. It also provides historical context and comparisons of algorithms like perceptron and Winnow. The document uses examples to explain concepts like kernels and the kernel trick in support vector machines.
This document discusses heterogeneous agent models without aggregate uncertainty. It introduces a model with a continuum of agents who face idiosyncratic income fluctuations but no aggregate shocks. There is a unique stationary equilibrium with constant interest rates and wages. The document discusses the recursive competitive equilibrium, existence and uniqueness of the stationary equilibrium, transition functions, computation methods, and some qualitative results from calibrating the model.
This chapter discusses representing systems using transfer functions. It covers obtaining the transfer function by taking the Laplace transform of the input-output differential equation. Transfer functions allow representing systems in the frequency domain. Key concepts covered include poles and zeros of a system, frequency response functions, and practical passive filters using resistor-inductor-capacitor components. Transfer functions of interconnected systems are also addressed.
Label propagation - Semisupervised Learning with Applications to NLPDavid Przybilla
Label propagation is a semi-supervised learning algorithm that propagates labels from a small set of labeled data points to unlabeled data points. The algorithm constructs a graph with nodes for each data point and weighted edges representing similarity between points. It then iteratively propagates the labels across the graph from labeled to unlabeled points until convergence, resulting in "soft" probabilistic labels for all points. The algorithm aims to minimize an energy function that encourages points connected by strong edges to receive similar labels. It performs well with limited labeled data by leveraging the graph structure to make predictions for unlabeled points.
The inverse of a function "undoes" the effect of the function. We look at the implications of that property in the derivative, as well as logarithmic functions, which are inverses of exponential functions.
The inverse of a function "undoes" the effect of the function. We look at the implications of that property in the derivative, as well as logarithmic functions, which are inverses of exponential functions.
Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov –...Beniamino Murgante
This document discusses using kernel methods, specifically support vector machines (SVMs), for environmental and geoscience applications. It provides an overview of SVMs, including how they find the optimal separating hyperplane with the maximum margin to perform classification and regression. It discusses how SVMs can handle nonlinear decision boundaries using the kernel trick. The document gives examples of applying SVMs to problems like porosity mapping, temperature inversion mapping, and landslide susceptibility modeling. It demonstrates how SVMs can extract patterns from high-dimensional environmental data and produce predictive spatial models.
This document summarizes VLFeat, an open source computer vision library. It provides concise summaries of VLFeat's features, including SIFT, MSER, and other covariant detectors. It also compares VLFeat's performance to other libraries like OpenCV. The document highlights how VLFeat achieves state-of-the-art results in tasks like feature detection, description and matching while maintaining a simple MATLAB interface.
This document analyzes how intraguild mutualism, where species within a guild provide benefits to each other, can promote coexistence of consumer species. A general dynamical model is developed and analyzed to show that under certain parameter conditions, mutualism can allow for the stable coexistence of both consumer species. Simulations demonstrate oscillatory coexistence for a specific functional form of mutualism. The findings suggest intraguild mutualism may enhance stability within ecological communities.
Camera calibration involves determining the internal camera parameters like focal length, image center, distortion, and scaling factors that affect the imaging process. These parameters are important for applications like 3D reconstruction and robotics that require understanding the relationship between 3D world points and their 2D projections in an image. The document describes estimating internal parameters by taking images of a calibration target with known 3D positions and solving for the camera projection matrix P that relates 3D scene points to their 2D image coordinates.
Scatter diagrams and correlation and simple linear regresssionAnkit Katiyar
The document discusses scatter diagrams, correlation, and linear regression. It defines key terms like predictor and response variables, positively and negatively associated variables, and the correlation coefficient. It also describes how to calculate the linear correlation coefficient and interpret it. The document shows an example of using least squares regression to fit a line to productivity and experience data. It provides formulas to calculate the slope and intercept of the regression line and how to make predictions with the line. However, predictions should stay within the scope of the observed data used to fit the model.
APEX INSTITUTE was conceptualized in May 2008, keeping in view the dreams of young students by the vision & toil of Er. Shahid Iqbal. We had a very humble beginning as an institute for IIT-JEE / Medical, with a vision to provide an ideal launch pad for serious JEE students . We actually started to make a difference in the way students think and approach problems. We started to develop ways to enhance students IQ. We started to leave an indelible mark on the students who have undergone APEX training. That is why APEX INSTITUTE is very well known of its quality of education
1) This document describes an optimal monetary policy model with 7 endogenous variables and 5 equilibrium conditions, leaving two degrees of freedom.
2) The model maximizes social welfare as the sum of period utilities from consumption and labor, subject to the equilibrium conditions.
3) The first order optimality conditions result in a system of 7 equations that can be solved using log-linearization methods around the non-stochastic steady state, similarly to previous examples.
The document outlines research on developing optimal finite difference grids for solving elliptic and parabolic partial differential equations (PDEs). It introduces the motivation to accurately compute Neumann-to-Dirichlet (NtD) maps. It then summarizes the formulation and discretization of model elliptic and parabolic PDE problems, including deriving the discrete NtD map. It presents results on optimal grid design and the spectral accuracy achieved. Future work is proposed on extending the NtD map approach to non-uniformly spaced boundary data.
The document discusses three examples of nonlinear and non-Gaussian DSGE models. The first example features Epstein-Zin preferences to allow for a separation between risk aversion and the intertemporal elasticity of substitution. The second example models volatility shocks using time-varying variances. The third example aims to distinguish between the effects of stochastic volatility ("fortune") versus parameter drifting ("virtue") in explaining time-varying volatility in macroeconomic variables. The document outlines the motivation, structure, and solution methods for these three nonlinear DSGE models.
A Review of Proximal Methods, with a New OneGabriel Peyré
The document discusses proximal splitting methods for solving optimization problems with composite objectives. It begins by introducing inverse problems regularization and how proximal operators are used to solve problems by splitting them into smooth and non-smooth components. It then presents the forward-backward splitting method, Douglas-Rachford splitting, and the generalized forward-backward splitting method. Examples are provided to illustrate how these methods can be applied to problems like L1 regularization, constrained L1 minimization, and block sparsity regularization.
The document describes a Hamiltonian with terms including Ji,j|ωiωj| and Ei|ωiωi| that depends on parameters ∆/J and ω. It studies the behavior of the system as ∆/J increases from 0 to greater than 6, including plots of the momentum distribution |P(k)|2 that show it spreading out over more values of k/k1. The dependence of the system on other parameters like α, s1, and s2 is also examined through additional plots.
1. The document describes Anchor Graph Hashing (AGH), a method for learning binary codes for approximate nearest neighbor search using graphs.
2. AGH constructs an anchor graph from a set of anchor points and learns binary codes by solving a graph partitioning problem on the anchor graph.
3. AGH has time and space complexities that are sublinear in the number of data points for training and efficient computation for out-of-sample extensions.
Logistic classification is a linear classifier that uses logistic regression to predict class membership probabilities. It minimizes the cross-entropy between the predicted probabilities and true labels using gradient descent. The weights and biases are initialized randomly and updated on each step to reduce the loss, while avoiding overfitting through regularization and separate training/validation datasets to tune hyperparameters. Performance is measured on a held-out test set to fairly evaluate the model.
This document discusses the analysis of statically indeterminate plane frames using the force method. It provides examples of how to: (1) analyze rigid frames by selecting redundant reactions, writing compatibility equations, and solving for member forces; (2) account for support settlements by including the predicted support displacement in the compatibility equation; and (3) calculate joint rotations and displacements to sketch the deformed shape of the frame under loading. The method involves releasing constraints to determine a primary structure, using the unit load method to calculate displacements, and applying the principle of superposition to determine final member forces and deformations.
This document discusses filtering and likelihood inference. It begins by introducing filtering problems in economics, such as evaluating DSGE models. It then presents the state space representation approach, which models the transition and measurement equations with stochastic shocks. The goal of filtering is to compute the conditional densities of states given observed data over time using tools like the Chapman-Kolmogorov equation and Bayes' theorem. Filtering provides a recursive way to make predictions and updates estimates as new data arrives.
Jackknife algorithm for the estimation of logistic regression parametersAlexander Decker
The document proposes a jackknife algorithm for estimating parameters in logistic regression analysis. The jackknife delete-one and delete-d methods are used to provide estimates of logistic regression coefficients. The algorithm leaves out observations one at a time or in groups (delete-d) and re-estimates the logistic regression to obtain jackknife estimates of the coefficients. These estimates are then averaged to provide an overall jackknife estimate. The jackknife standard errors provide estimates of the variability and precision of the estimates. The method is illustrated using real data on gestation period, maternal age, parity and baby's sex. Results are compared to standard logistic regression and show little bias in the jackknife coefficients.
Creative Commons provides copyright licenses that allow creators to choose how their works can be shared and used. The licenses offer options between full copyright and releasing works into the public domain. There are four main conditions that can be selected individually or combined: Attribution, Non-Commercial, No Derivatives, and Share Alike. This allows creators to share their work while maintaining control over how it is distributed and modified.
Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov –...Beniamino Murgante
This document discusses using kernel methods, specifically support vector machines (SVMs), for environmental and geoscience applications. It provides an overview of SVMs, including how they find the optimal separating hyperplane with the maximum margin to perform classification and regression. It discusses how SVMs can handle nonlinear decision boundaries using the kernel trick. The document gives examples of applying SVMs to problems like porosity mapping, temperature inversion mapping, and landslide susceptibility modeling. It demonstrates how SVMs can extract patterns from high-dimensional environmental data and produce predictive spatial models.
This document summarizes VLFeat, an open source computer vision library. It provides concise summaries of VLFeat's features, including SIFT, MSER, and other covariant detectors. It also compares VLFeat's performance to other libraries like OpenCV. The document highlights how VLFeat achieves state-of-the-art results in tasks like feature detection, description and matching while maintaining a simple MATLAB interface.
This document analyzes how intraguild mutualism, where species within a guild provide benefits to each other, can promote coexistence of consumer species. A general dynamical model is developed and analyzed to show that under certain parameter conditions, mutualism can allow for the stable coexistence of both consumer species. Simulations demonstrate oscillatory coexistence for a specific functional form of mutualism. The findings suggest intraguild mutualism may enhance stability within ecological communities.
Camera calibration involves determining the internal camera parameters like focal length, image center, distortion, and scaling factors that affect the imaging process. These parameters are important for applications like 3D reconstruction and robotics that require understanding the relationship between 3D world points and their 2D projections in an image. The document describes estimating internal parameters by taking images of a calibration target with known 3D positions and solving for the camera projection matrix P that relates 3D scene points to their 2D image coordinates.
Scatter diagrams and correlation and simple linear regresssionAnkit Katiyar
The document discusses scatter diagrams, correlation, and linear regression. It defines key terms like predictor and response variables, positively and negatively associated variables, and the correlation coefficient. It also describes how to calculate the linear correlation coefficient and interpret it. The document shows an example of using least squares regression to fit a line to productivity and experience data. It provides formulas to calculate the slope and intercept of the regression line and how to make predictions with the line. However, predictions should stay within the scope of the observed data used to fit the model.
APEX INSTITUTE was conceptualized in May 2008, keeping in view the dreams of young students by the vision & toil of Er. Shahid Iqbal. We had a very humble beginning as an institute for IIT-JEE / Medical, with a vision to provide an ideal launch pad for serious JEE students . We actually started to make a difference in the way students think and approach problems. We started to develop ways to enhance students IQ. We started to leave an indelible mark on the students who have undergone APEX training. That is why APEX INSTITUTE is very well known of its quality of education
1) This document describes an optimal monetary policy model with 7 endogenous variables and 5 equilibrium conditions, leaving two degrees of freedom.
2) The model maximizes social welfare as the sum of period utilities from consumption and labor, subject to the equilibrium conditions.
3) The first order optimality conditions result in a system of 7 equations that can be solved using log-linearization methods around the non-stochastic steady state, similarly to previous examples.
The document outlines research on developing optimal finite difference grids for solving elliptic and parabolic partial differential equations (PDEs). It introduces the motivation to accurately compute Neumann-to-Dirichlet (NtD) maps. It then summarizes the formulation and discretization of model elliptic and parabolic PDE problems, including deriving the discrete NtD map. It presents results on optimal grid design and the spectral accuracy achieved. Future work is proposed on extending the NtD map approach to non-uniformly spaced boundary data.
The document discusses three examples of nonlinear and non-Gaussian DSGE models. The first example features Epstein-Zin preferences to allow for a separation between risk aversion and the intertemporal elasticity of substitution. The second example models volatility shocks using time-varying variances. The third example aims to distinguish between the effects of stochastic volatility ("fortune") versus parameter drifting ("virtue") in explaining time-varying volatility in macroeconomic variables. The document outlines the motivation, structure, and solution methods for these three nonlinear DSGE models.
A Review of Proximal Methods, with a New OneGabriel Peyré
The document discusses proximal splitting methods for solving optimization problems with composite objectives. It begins by introducing inverse problems regularization and how proximal operators are used to solve problems by splitting them into smooth and non-smooth components. It then presents the forward-backward splitting method, Douglas-Rachford splitting, and the generalized forward-backward splitting method. Examples are provided to illustrate how these methods can be applied to problems like L1 regularization, constrained L1 minimization, and block sparsity regularization.
The document describes a Hamiltonian with terms including Ji,j|ωiωj| and Ei|ωiωi| that depends on parameters ∆/J and ω. It studies the behavior of the system as ∆/J increases from 0 to greater than 6, including plots of the momentum distribution |P(k)|2 that show it spreading out over more values of k/k1. The dependence of the system on other parameters like α, s1, and s2 is also examined through additional plots.
1. The document describes Anchor Graph Hashing (AGH), a method for learning binary codes for approximate nearest neighbor search using graphs.
2. AGH constructs an anchor graph from a set of anchor points and learns binary codes by solving a graph partitioning problem on the anchor graph.
3. AGH has time and space complexities that are sublinear in the number of data points for training and efficient computation for out-of-sample extensions.
Logistic classification is a linear classifier that uses logistic regression to predict class membership probabilities. It minimizes the cross-entropy between the predicted probabilities and true labels using gradient descent. The weights and biases are initialized randomly and updated on each step to reduce the loss, while avoiding overfitting through regularization and separate training/validation datasets to tune hyperparameters. Performance is measured on a held-out test set to fairly evaluate the model.
This document discusses the analysis of statically indeterminate plane frames using the force method. It provides examples of how to: (1) analyze rigid frames by selecting redundant reactions, writing compatibility equations, and solving for member forces; (2) account for support settlements by including the predicted support displacement in the compatibility equation; and (3) calculate joint rotations and displacements to sketch the deformed shape of the frame under loading. The method involves releasing constraints to determine a primary structure, using the unit load method to calculate displacements, and applying the principle of superposition to determine final member forces and deformations.
This document discusses filtering and likelihood inference. It begins by introducing filtering problems in economics, such as evaluating DSGE models. It then presents the state space representation approach, which models the transition and measurement equations with stochastic shocks. The goal of filtering is to compute the conditional densities of states given observed data over time using tools like the Chapman-Kolmogorov equation and Bayes' theorem. Filtering provides a recursive way to make predictions and updates estimates as new data arrives.
Jackknife algorithm for the estimation of logistic regression parametersAlexander Decker
The document proposes a jackknife algorithm for estimating parameters in logistic regression analysis. The jackknife delete-one and delete-d methods are used to provide estimates of logistic regression coefficients. The algorithm leaves out observations one at a time or in groups (delete-d) and re-estimates the logistic regression to obtain jackknife estimates of the coefficients. These estimates are then averaged to provide an overall jackknife estimate. The jackknife standard errors provide estimates of the variability and precision of the estimates. The method is illustrated using real data on gestation period, maternal age, parity and baby's sex. Results are compared to standard logistic regression and show little bias in the jackknife coefficients.
Creative Commons provides copyright licenses that allow creators to choose how their works can be shared and used. The licenses offer options between full copyright and releasing works into the public domain. There are four main conditions that can be selected individually or combined: Attribution, Non-Commercial, No Derivatives, and Share Alike. This allows creators to share their work while maintaining control over how it is distributed and modified.
The document discusses norms and electronic institutions for regulating behavior in distributed systems, particularly for applications in e-contracting environments. It introduces a language for representing norms, discusses how norms can guide the behavior of normative agents, and how electronic institutions can provide safe environments for enforcing norms and coordinating agent interaction through the definition and enforcement of norms. It also discusses how contract-based approaches can provide governance in service-oriented architectures.
In systems based on organisational specifications a reoccur- ring problem remains to be solved in the disparity between the level of abstractness of the organisational concepts and the concepts used in the implementation. Organisational specifications (deliberately) abstract from general practice, which creates a need to relate the abstract con- cepts used in the specification to concrete ones used in the practice. The prevailing solution for this problem is the use of counts-as statements. However, current implementations of counts-as view the relations ex- pressed in this notion as static ontological classifications, which presents problems in dynamic environments where the meaning of abstract con- cepts can change over time. This limitation has already been solved in complex formal theoretical investigations, but the results of that study are far too complex to make a practical implementation. This paper in- vestigates the limitations of current implementations of counts-as, and proposes a more flexible implementation based on the use of inheritance relations.
Forms are used to collect information from users. They contain form controls like text fields, checkboxes, menus. Forms submit data to a server-side script via the action attribute. The method attribute specifies how data is sent, either via GET which appends data to the URL, or POST which hides data. Labels associate text with form controls for accessibility. Fieldsets group related controls with a legend caption. Common form controls include text & textarea fields, submit/reset buttons, radio buttons, checkboxes, and select menus.
The document discusses normative monitoring, including semantics and implementation. It provides definitions for key concepts like norms, counts-as rules, institutions, and normative monitors. The norm lifecycle and labelled transition system for normative monitors are also defined. The goal is to formally define the semantics and provide a direct translation from norms to rules for implementation in rule-based systems.
The document discusses a project that developed methods for engineering verifiable cross-organizational networked business applications using contracts. The project created a formal contract framework, a contracting language to specify interactions, a contract execution environment for web services, and verification/monitoring tools. It aimed to allow predicting application behavior without full source code access by using contracts to represent obligations between parties.
La gente produce y consume información de las redes sociales. El contenido de estos mensajes puede ayudar a modelar el comportamiento de una ciudad. Éste modelo puede identificar anormalidades y entonces eventos disruptivos.
The document proposes studying how social institutions and individual behaviors interact in the tragedy of the commons problem. It discusses prior work on collective action dilemmas and models of individualistic vs communal agents. The hypothesis is that communal agents may optimize resource provision while individualistic agents optimize resource appropriation. An agent-based model is proposed to analyze the effects of different behavioral patterns and institutional changes on avoiding the tragedy of the commons.
Macros are functions that are supplied with Clojure and defined by users. Argument forms are passed as data to the macro function, which returns a new data structure as a replacement for the macro call. Many things that are built-in to other languages are implemented as macros in Clojure.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive function. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
The ALIVE project aimed to develop techniques for engineering flexible and adaptive service-oriented applications. It involved designing organizational, coordination, and service models to describe distributed systems. Tools were created to specify coordination patterns and organizational rules to govern service interactions. The goal was to close the gap between theoretical approaches and existing web services technologies by bringing together ideas from coordination technology, organizational theory, and model-driven design.
Las técnicas de IA usadas en los juegos comerciales son en la mayoría de los casos predecibles, rígidas y poco adaptativas, causando una pérdida en el realismo de cara al jugador. En esta charla mostraremos cómo hemos conectado varios juegos (GTA IV, Warcraft 3, y otros) al framework ALIVE, basado en teorías organizacionales. El objetivo de nuestro trabajo es dotar al desarrollador de IA para juegos de una metodología y herramientas que permitan modelar escenarios de juego usando estructuras sociales.
This document discusses the ALIVE project, which aims to organize web services to develop dynamic, flexible, distributed systems. It provides an overview of the ALIVE approach, which involves modeling systems at an organizational level, coordination level, and service level. At the organizational level, roles, norms, and objectives are defined. At the coordination level, tasks and plans are allocated to actors. And at the service level, semantic web services are described, matched, and composed. The document presents examples and discusses how the multi-level modeling approach enables adaptation and traceability across levels.
This document discusses computational mechanisms for norm enforcement in service-oriented architectures. It introduces concepts like behavior monitoring and enforcement in SOA, and proposes a norm enforcement mechanism. Key topics covered include applying concepts from artificial intelligence research to SOAs, challenges like semantic verification of service behavior and higher-level behavioral control, and how norms and institutions can provide rules to help govern service interactions and reduce risks.
More from Knowledge Engineering and Machine Learning Group (8)
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Pushing the limits of ePRTC: 100ns holdover for 100 days
cOnscienS: social and organizational framework for gaming AI
1. 23/12/2011 | 1 IA
cOncienS
Sergio
Alvarez
Sergio
Alvarez-‐Napagao(1)GIómez Gómez-‐SebasCà
(1),
Ignasi
,
gnasi
Javier
Vázquez-‐Salceda
(1)
Javier
Vázquez
João
dfasdf
(1)
{salvarez,igomez,jvazquez}@lsi.upc.edu
Universitat
Politècnica
de
Catalunya
ALIVE EU FUNDED PROJECT
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
2. 23/12/2011 IA
Commercial
games
AI
• Main
objecCve...
to
deliver
the
illusion
of
intelligence
• Categories:
– Movement
(pathfinding,
collision,
visibility)
– Individual
Behaviour
(NPCs)
– CollecCve
Strategy
(NPCs
groups)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
3. 23/12/2011 IA
Pathfinding
• A*
(Dijkstra
1959;
Hart,
Nilsson,
Raphael
1968)
– SCll
improving,
sCll
used
in
the
industry
– Aligned
with
academic
AI:
D*,
IDA*,
GAA*,
...
– Example:
StarcraV
2
(A*
+
Queueing)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
5. 23/12/2011 IA
So
what
about
behavior
and
strategy?
In commercial games, not much...
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
6. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Scripting
private function UpgradeEx takes nothing returns nothing
local unit u = GetTriggerUnit()
local integer id = GetUnitTypeId(u)
call DisableTrigger(trg_upgrade)
call IssueImmediateOrderById(u, 851976)
endfunction
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
7. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Hash Tables
std::map< int, CB > hashTable;
hashTable[ 1 ] = UpgradeEx;
...
hashTable[ 40000 ] = AttackUnit;
(*(hashTable[ a ]))();
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
8. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Finite State Machines
a=1
doSomething1()
a=2
doSomething2()
a=3
a=3
doSomething4000()
a = 4000
...
a=N
doSomething3()
a=3
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
9. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Rule Engines
(defrule
! (goal 16 0)
! (can-research-with-escrow ri-ballistics)
=>
! (release-escrow wood)
! (release-escrow food)
! (release-escrow gold)
! (release-escrow stone)
! (research ri-ballistics)
)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
10. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Decision Trees
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
11. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Where is the reasoning?
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
12. 23/12/2011 IA
So
what
about
behavior
and
strategy?
Where is the reasoning?
IT’S GIVEN/HARDCODED BY THE DEVELOPER AT DESIGN TIME!
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
13. 23/12/2011 IA
What
is
usually
seen
in
commercial
games?
• Blind
specificaCons:
HOW
to
act,
not
WHY
Lack
of
flexibility
and
adapCveness
Strange,
predictable
behaviour
Low
reusability
Having
more
reusable
AI
engines
would
make
companies
invest
more
in
developing
be_er
AI
engines?
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
14. 23/12/2011 IA
What
is
usually
seen
in
commercial
games?
• Blind
specificaCons:
HOW
to
act,
not
WHY
– Lack
of
flexibility
and
adapCveness
– Strange,
predictable
behavior
Low
reusability
Having
more
reusable
AI
engines
would
make
companies
invest
more
in
developing
be_er
AI
engines?
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
15. • Blind specifications: HOW to act, not WHY
• Lack of flexibility and adaptiveness
• Strange, predictable behaviour
Low reusability
Having more reusable AI engines would make
companies invest more in developing better
AI engines?
martes 3 de enero de 12
16. • Blind specifications: HOW to act, not WHY
• Lack of flexibility and adaptiveness
• Strange, predictable behaviour
Low reusability
Having more reusable AI engines would make
companies invest more in developing better
AI engines?
martes 3 de enero de 12
17. 23/12/2011 IA
What
is
usually
seen
in
commercial
games?
• Blind
specificaCons:
HOW
to
act,
not
WHY
– Lack
of
flexibility
and
adapCveness
– Strange,
predictable
behavior
• Low
reusability
Having
more
reusable
AI
engines
would
make
companies
invest
more
in
developing
be_er
AI
engines?
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
18. 23/12/2011 IA
Example:
RTS
scripEng
private function UpgradeEx takes nothing returns nothing
WarcraV
3 local unit u = GetTriggerUnit()
(JASS) local integer id = GetUnitTypeId(u)
call DisableTrigger(trg_upgrade)
call IssueImmediateOrderById(u, 851976)
endfunction
rule getNextGathererUpgrade {
Age
of
int upgradeTechID=kbTechTreeGetCheapestUnitUpgrade(gathererTypeID,
Mythology
cUpgradeTypeWorkRate, -1, dropSiteFilterID, false, affectedUnitType);
(XSScript) int planID=aiPlanCreate("nextGathererUpgrade - "+id, cPlanProgression);
aiPlanSetVariableInt(planID, cProgressionPlanGoalTechID, 0, upgradeTechID);
aiPlanSetDesiredPriority(planID, 25);
aiPlanSetEscrowID(planID, cEconomyEscrowID);
aiPlanSetActive(planID);
}
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
19. 23/12/2011 IA
Example:
RTS
scripEng
wait_build 2 forge
StarcraV
upgrade 1 p_ground_weapon 70
(Broodwar
AI) upgrade 1 p_plasma_shield 70
wait 2700
wait_build 1 cybernetics_core
upgrade 1 p_armor 70
upgrade 2 p_plasma_shield 70
wait 3600
(defrule
Age
of
(goal 16 0)
Empires
II
-‐
(can-research-with-escrow ri-ballistics)
AOK
=>
(release-escrow wood)
(ScriptED) (release-escrow food)
(release-escrow gold)
(release-escrow stone)
(research ri-ballistics)
)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
20. 23/12/2011 IA
Example:
RTS
scripEng
WarcraV
III StarcraV AoM AoK
Common
concepts:
unit,
building,
a_ack,
defend,
group,
patrol,
train,
research,
resource...
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
21. 23/12/2011 IA
What
is
usually
seen
in
commercial
games?
Having
more
reusable
(higher-‐level)
AI
engines
would
make
companies
invest
more
in
developing
be_er
AI
engines?
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
22. 23/12/2011 IA
There
is
some
hope
• Planning:
reasoning
to
achieve
goals
with
ac2ons
• HTN
(Hierarchical
Task
Networks)
• GOAP
(Goal-‐Oriented
AcOon
Planning,
Orkin
2005)
– F.E.A.R,
Condemned,
Fallout
3,
Empire:
Total
War,
Deus
Ex
3,
Just
Cause
2,
...
– This
idea
has
been
slowly
adapted
into
other
engines
• AI
engines
are
starOng
to
be
reused
in
a
consistent
basis
– Radiant
AI,
gamebyro
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
23. 23/12/2011 IA
Goal-‐Oriented
AcEon
Planning
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
24. 23/12/2011 IA
Goal-‐Oriented
AcEon
Planning
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
25. 23/12/2011 IA
Goal-‐Oriented
AcEon
Planning
(Condition + Priority) (Condition + Priority)
AttackFromCover Patrol
(Goal state description) (Goal state description)
(Condition + Priority)
(Condition + Priority) Investigate
Search (Goal state description)
(Goal state description)
“STRIPS-like” planner
Semantically annotated actions
(pre- and post-conditions)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
28. 23/12/2011 IA
Goal-‐Oriented
AcEon
Planning
• Dynamic
planning
and
re-‐planning
– Outperforms
FSMs!
• Allows
to
reason
about
WHAT
to
do
– BUT
sCll
not
about
WHY
• Plans
only
cannot
properly
model
social
behavior
– Need
for
organizaEonal
structures
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
29. 23/12/2011 IA
Our
proposal:
going
even
higher
• It
is
possible
to
elaborate
soluCons
for
the
issues
of
– behaviour
control
– strategy
techniques
• ...
by
integraCng
models
based
on
OrganisaEonal
TheoreEcal
methods
• Expected
outcomes
– Methodology
and
tools
for
Game
AI
developers
– to
model
gaming
scenarios
using
social
structures
• Case
studies:
commercial
games
– Cheaper,
faster,
more
visible
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
30. 23/12/2011 IA
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
31. 23/12/2011 IA
HOW?
(available services)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
32. 23/12/2011 IA
WHAT?
(possible actions, plans)
HOW?
(available services)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
33. 23/12/2011 IA
WHY?
(motivations)
WHAT?
(possible actions, plans)
HOW?
(available services)
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
34. 23/12/2011 IA
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
35. 23/12/2011 IA
What
could
ALIVE
provide?
• High-‐level
schemas
to
reason
and
jusEfy
acCons
taken
by
NPCs
– Roles,
objecCves,
norms,
plans...
• Clearly
decouple
implementaCon
and
design
– Reusable
designs
· Minimal
changes
(e.g.
vocabulary)
· Lower
adaptaCon
cost
– Dynamic
re-‐organizaCon
techniques
• Not
a
replacement!
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
36. 23/12/2011 IA
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
37. 23/12/2011 IA
GAME
ENGINE
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
38. 23/12/2011 IA
Case
studies
• We
have
connected
ALIVE
to
several
games
– Sandbox
game:
GTA
IV
– Real-‐Time
Strategy:
WarcraV
III,
Lincity,
StarcraV
– Turn-‐Based
Strategy:
CivilizaCon
IV
– MMORPG:
WoW
– Other:
Sims
3
• EvaluaCon
of
proposal
– Realism,
flexibility,
adaptability
• Use
games
as
inputs
for
OrganisaConal
Research
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
39. 23/12/2011 IA
How
to
connect
with
games?
• ScripCng
languages
with
I/O
support
(e.g.
LUA)
• DLL
InjecCon
• Source
code
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
40. 23/12/2011 IA
How
to
connect
with
games?
• ScripCng
languages
with
I/O
support
(e.g.
LUA)
• DLL
InjecCon
• Source
code
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
41. 23/12/2011 IA
WarcraP
III
• Design
of
an
organizaEonal
model
• ImplementaCon
of
ALIVE-‐aware
agents
(pure
Java)
• ConnecCon:
DLL
InjecCon
+
sockets
• RTS
games
are
interesCng
for
us:
– Armies
in
RTS
are
directly
translatable
into
ALIVE
models
– These
models
can
be
shared
through
games
– ReorganizaEon
techniques
can
be
applied
– Visual
interface
for
real-‐Cme
simulaEon
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
42. 23/12/2011 IA
WarcraP
III:
Models
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
43. 23/12/2011 IA
WarcraP
III:
Agent
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
44. 23/12/2011 IA
WarcraP
III:
Agent
ALIVE
project
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
45. 23/12/2011 IA
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
46. 23/12/2011 IA
WarcraP
III:
Agent
• The
ALIVE
framework
provides
the
mechanisms
for:
– Perceiving
a
“state
of
the
world”
by
the
interpretaEon
of
events
– Reasoning
about
the
acEons
declared
in
the
CoordinaCon
Level
– Taking
into
account
the
organizaEonal
structures:
roles,
plans,
norms
· Following
them
if
the
organizaConal
constraints
are
self-‐beneficial!
– Enact
acEons
in
the
game,
through
the
patched
Service
Level
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
47. 23/12/2011 IA
World
of
WarcraP
• Emergent
narra2ve
use-‐case
• The
objecCve
is
to
break
the
concepEon
of
linear
narraEve
as
the
only
way
for
humans
to
author
a
story
• Basic
idea:
– To
balance
character
models,
events
sequences
and
narraCve
landmarks
to
create
a
more
open
narraEve
• Main
challenge:
– Virtual
environments
(games)
and
narraCves
exist
on
different
ontological
levels
– Difficult
to
treat
them
jointly
– Emergent
narraCve
is
a
direct
result
of
the
acEons
of
characters
– To
give
an
illusion
of
personality
to
both
players
and
non-‐players
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
48. 23/12/2011 IA
World
of
WarcraP:
architecture
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
49. 23/12/2011 IA
World
of
WarcraP:
player
classificaEon
• Play
styles
taxonomy
based
on
interacCon
between
players
– Achievers,
Explorers,
Socializers,
Killers
[Bartle]
• During
gameplay,
players’
behaviours
are
monitored
and
analized
to
classify
them
into
play
styles
– AcCons,
chat
logs,
achievements,
staCsCcs
• AcCons
and
states
are
tagged
at
design
Cme
in
terms
of
play
styles
– achiever
:
distractGatekeeper
– killer
:
killGatekeeper
• These
tags
are
used
by
Character
Agents
when
selecCng
the
acCons
to
reach
a
landmark
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
50. 23/12/2011 IA
World
of
WarcraP:
plot
generaEon
and
modificaEon
• InteracOvity
is
achieved
by
giving
enough
choices
to
the
player
to
give
an
illusion
of
free
will
• The
Plot
Agent
parCally
influences
the
player
via
missions
• If
the
player
gets
too
far
from
the
storyline,
its
Character
Agent
can
negoEate
changes
in
the
environment
to
keep
acCon
within
boundaries
– Problem:
the
plot
counted
on
the
player
to
kill
a
dragon
to
get
the
gem,
but
the
player
doesn’t
kill
it
– SoluCon:
infer
an
alternaCve
way
to
bring
the
gem
to
the
player
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
56. 23/12/2011 IA
Where
are
we
in
literature?
• OrganizaConal
modeling
has
been
explored
for
serious
games
• AdapCveness
in
games
is
not
new...
– ...but
we
propose
to
introduce
another
level
of
abstracCon
• GOAP
is
an
example
of
a
higher-‐level
mechanism
being
successful
• Opportunity
to
tackle
the
upcoming
real
challenges
of
industry
gaming
AI
[Jonathan
Schaeffer
@IJCAI’11]:
– RealisCc
NPC
behaviour
– Emergent
narraCve
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
57. 23/12/2011 IA
Conclusions
• Main
advantage:
specify
behavior
in
terms
of
why
to
do
something
• ObjecCve:
to
provide
a
methodology
and
tools
for
Game
AI
developers
– Release
game
enactors
as
open-‐source
• We
prioriCze
behaviour
improvement
over
performance
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12
58. 23/12/2011 IA
What
are
we
doing
right
now?
• Emergent
narraCve
in
MMORPGs:
– Player
personality
analysis
· Data
mining
techniques
over
public
data
+
voluntary
surveys
– Missions,
quests
will
adapt
to
the
player’s
gaming
style
· Killer,
Socializer,
Achiever,
Explorer
[Bartle]
– Socially-‐aware
· NPCs
are
aware
of
their
social
role
· Roles
can
be
changed,
society
can
evolve
• CreaCng
more
complex
models
for
improved
realism
• Finding
metrics
for
correct
evaluaCon
of
our
proposal
– Ba_le
ALIVE
vs
ALIVE
with
organizaConal
adaptaCon
• h_p://kemlg.github.com/consciens
ALIVE EU FUNDED PROJECT
martes 3 de enero de 12