Creating first Application in Appian BPM

Appian is well-equipped with Business Process Management (BPM) and Case Management capabilities. From a viewpoint it’s also pretty efficient like its counter parts such as Pegasystems, TIBCO, INFOR etc.

We will be going through a series of features, tips and the practices which may be helpful in giving a better insight.

To Kick off, let’s have a look on how to kick off an application in Appian within seconds.

Now In Appian there are 3 ways you can create an application.
1. From Scratch
2. Using Application Builder (Basic)
3. Using Application Builder (Full)

When we create from Scratch then we need to give “Name” and “Description”. It’s like Appian will just create a placeholder to create and build related objects.

When using builder we need to give “Data Source” beforehand.

In addition to process model and interfaces, this full application option will also create objects related to reporting documentation and task etc.

It has created around 79 objects. All folders:-

1. Groups
2. Constants
3. Record Type
4. Expression Rules
5. Data Types
6. Folders
7. Site
8. Basic Process Models
9. Data Store
10. Interfaces
11. Process Reports
12. Feed
13. Reports

It will also publish the application and create an action as well.

Creating all might take a while for the developer. Thanks to the #Appian creators, it’s just a click now. And below are some of the great resources to go in depth.

Sources:
Appian Documentation
Appian Community

Comments

Solution Python QnA #1

Solution for Python QnA for November 14, 2018. # OUTPUT****************************************** >>> x = input () 12 >>> y = int ( input ( 'Please enter a number' )) Please enter a number45 >>> x + y Traceback (most recent call last): File "<stdin>" , line 1 , in < module > TypeError : must be str , not int >>> y + y 90 >>> x + x '1212' In this (x+y); addition of integer and string is not allowed. hence we get the TypeError.

Picking the structure!!

Use of arrays, rather sorted arrays or a linked list is somewhat difficult because both have their pros and cons. Arrays excel when we have to perform a binary search while it’s faster to add and remove elements from linked lists. A tree is one structure where there is ONLY ONE path to reach to a node. This can be explained further as “Nodes cannot be in closed loop” . Also there is a hierarchical relationship of parent and child. The average complexity varies from logarithmic to linear time. Now coming further to a data structure BSTs aka Binary Search Trees . Points to be remembered here:- Maximum two children. Left child is smaller than parent. Right one is greater than parent. Traversals :- In order Traversal Ascending Sort; left subtree + root+ right subtree. So the above tree will look like: 4, 12, 16, 25, 28, 32 Pre order Traversal Root + left subtree + right subtree recursively. Eg: 25, 12, 4, 16, 32, 28 Post Order Traversal

Kick starting with Raspberry Pi

To start any machine first it has to be assembled. Though this is a very old, simple and well answered/documented question but still it’s being asked so many times that I have decided to write a post. There are 2 versions that we can get running:- 1. Using NOOBS (New Out Of the Box Software) 2. Using Raspbian Noobs essentially contains Raspbian with same selection menu. Raspbian can be installed with NOOBS or downloaded as a separate image (.img file) and then burnt onto an SD card. Raspbian comes pre-installed with plenty of software for education, programming and general use. It has Python, Scratch, Sonic Pi, Java, Mathematica and more. General steps to perform for NOOBS:- 1. Download NOOBS.zip from here . 2. Use SD Card formatter to quick format the SD card. 3. Copy the contents of ZIP file to the SD Card. 4. Now you can directly use this SD card into your RPi. General steps to perform for Raspbian:- 1. Download Raspbian Jessie .zip. The zip file he

meld 'n' weld

Search This Blog