"The first principle is that you must not fool yourself, and you are the easiest person to fool." Cone of Possibilities Designers use a similar process [2]. Mature designer have a structured way of thinking where he/she
DeepRL based Clinical Decision Support for Sepsis treatment in emergency room
Business processes assist organizations in organizing activities that deliver business value, usually in the form of a product or a service. Over the last few years, some of the focus of BPM research has shifted to supporting knowledge-intensive processes. Such
On Software Engineering
A number of these phenomena have been bundled under the name “Software Engineering”. As economics is known as “The Miserable Science”, software engineering should be known as “The Doomed Discipline”, doomed because it cannot even approach its goal since its
Optimising healthcare treatment careflows with Process Mining
Processes deployed inside and across an enterprise, when executed can leave an operational data footprint in the form of an event logs, which if analyzed can be a valuable source of insights to support the management and improvement of business
Competing in a Data-Driven World
Most of the articles on data analytics would have convinced you by now that companies are capturing only a fraction of the potential value from the available data and that many organizations face challenges in incorporating data-driven insights into day-to-day
Latent Semantic Indexing with Apache Spark ML
In Information retrieval our starting point is often a term-document matrix constructed by converting the raw text of the corpus. Each row represents a term that occurs in the corpus(and values are its weight) and each column represents a
Maze Solver agent in Prolog
Prolog was invented in the early seventies by Alain Colmerauer and others at the University of Marseille. Prolog stands for Programmation en Logique (Programming in Logic). Prolog differs from the most common programming languages because it is a declarative langauge.
Solving Traveling Salesmen with Genetic Algorithms
The traveling salesman problem (TSP) is a typical example of a very hard combinatorial optimization problem. The problem is to find the shortest tour that passes through each vertex in a given graph exactly once. We will be use the