₦airaland Forum

Still available

Still available for sale

Available 08032163323

Save box for sale.

Asking price 100k call or what's app 08032163323

Still available call or what's app 08032163323

Used one available.

C'EAN AND WORKING PERFECTLY FINE
5G NETWORK
12G RAM
256 MEMORY

AVAILABLE FOR SALE AT 420,000

Sold

Still available. Chat me here if you want it 08027411140

Still available

Hello, if you are interested I can be reach here 08032163323 what's app

Available

....

I've got one to sale.

If you are interested chat me

Hello house
Please any one here applying for operation research ? Need the pq to practice and contacts to be more informed. Please hala

Hi guys anyone with Operation Research masters past question please here.
i will appreciate it if you drop it here ibbaba234@gmail.com

...

can i mail you or call you please?

Dekatron:
Yes. I developed a facebook bot from scratch... Also worked/working on a Microsoft bot.

Cool ,may I have your number or email contact please

any one here who have developed bot from scratch?

any one with any experience with machine learning algorithm here

help ?

AVL tree in go programming language *Data structure* ,any one can take this as a challenge and *implement it in python programing language

Any guru here who can attemp this

Tree.go
Package avltree

import (
"errors"
)

type Tree struct {
root *Node
}

func NewTree(comparator func(a, b *Node) int) (*Tree) {
comp = comparator
return &Tree{}
}

func (tree *Tree) Insert(value interface{}) {
n := create(value)
rootNode := tree.root
if rootNode == nil {
n.height = 0
tree.root = n
} else {
rootNode.add(n, tree)
}
}

func (tree *Tree) InOrderTraversal(do func(a *Node)) {
inOrderTraversal(tree.root, do)
}

func (tree *Tree) PreOrderTraversal(do func(a *Node)) {
preOrderTraversal(tree.root, do)
}
func (tree *Tree) PostOrderTraversal(do func(a *Node)) {
postOrderTraversal(tree.root, do)
}

func (tree *Tree) Delete(node *Node) error {
if node == nil {
return errors.New("Couldn't found node with the value specified"
}

if node.IsLeave() {
parent := node.parent
parent.detachChild(node)
tree.rebalance(parent)
}

if node.left != nil && node.right == nil {
parent := node.parent
parent.setLeft(node.left)
tree.rebalance(parent)
} else if node.left == nil && node.right != nil {
parent := node.parent
parent.setRight(node.right)
tree.rebalance(parent)
}

if node.left != nil && node.right != nil {
_, successor := tree.Successor(node)
node.Value = successor.Value
tree.Delete(successor)
}

return nil
}

func (tree *Tree) Find(value interface{}) (error, *Node){
n := create(value)
foundNode := tree.compare(n, tree.root)
if foundNode == nil {
return errors.New("Node was not found", nil
}
return nil, foundNode
}

func (tree *Tree) Successor(node *Node) (error, *Node) {
if node.right != nil {
return nil, tree.min(node.right)
} else {
return errors.New("Node has no right child", nil
}
}

func (tree *Tree) min(node *Node) *Node{
if node.left == nil {
return node
}
return tree.min(node.left)
}

func (tree *Tree) compare(node, current *Node) (*Node) {
if current == nil {
return nil
}
comparison := comp(current, node)
if comparison == 0 {
return current
} else if comparison > 0 {
return tree.compare(node, current.right)
} else {
return tree.compare(node, current.left)
}
}

func (tree *Tree) rebalance(node *Node) {
if node != nil {
node.updateHeight()
if !node.IsBalanced() {
bf := balancedFactor(node)
if bf > 0 {
bfNext := balancedFactor(node.left)
if bfNext == 0 || bfNext == 1{
leftLeftRotation(node, tree)
} else {
leftRightRotation(node, tree)
}
} else {
bfNext := balancedFactor(node.right)
if bfNext == 0 || bfNext == 1{
rightRightRotation(node, tree)
} else {
rightLeftRotation(node, tree)
}
}
} else {
tree.rebalance(node.parent)
}
}
}

func inOrderTraversal(node *Node, do func(a *Node)) {
if node != nil {
inOrderTraversal(node.left, do)
do(node)
inOrderTraversal(node.right, do)
}
}

func preOrderTraversal(node *Node, do func(a *Node)) {
if node != nil {
do(node)
preOrderTraversal(node.left, do)
preOrderTraversal(node.right, do)
}
}

func postOrderTraversal(node *Node, do func(a *Node)) {
if node != nil {
postOrderTraversal(node.left, do)
postOrderTraversal(node.right, do)
do(node)
}
}
• Node .go
• package avltree
•
• import (
• "math"
• "errors"
• )
•
• type Node struct {
• parent *Node
• Value interface{}
• left *Node
• right *Node
• height int
• }
•
• var comp func(a, b *Node) int
•
• func create(value interface{}) (node *Node) {
• return &Node{Value:value}
• }
•
• func getHeight(node *Node) int {
• if node != nil {
• return node.height
• }
• return -1
• }
•
• func balancedFactor(node *Node) int {
• left := getHeight(node.left)
• right := getHeight(node.right)
• return left - right
• }
•
• func (n *Node) add(child *Node, tree *Tree) {
• greaterFactor := comp(n, child)
• if greaterFactor > 0 {
• if n.right != nil {
• n.right.add(child, tree)
• } else {
• n.setRight(child)
• }
• } else {
• if n.left != nil {
• n.left.add(child, tree)
• } else {
• n.setLeft(child)
• }
•
• }
•
• n.updateHeight()
• if !n.IsBalanced() {
• rotate(n, tree)
• }
•
• }
•
• func (n *Node) updateHeight() {
• hleft := getHeight(n.left)
• hright := getHeight(n.right)
• n.height = int(math.Max(float64(hleft), float64(hright))) + 1
• }
•
• func (n *Node) Left() (*Node) {
• return n.left
• }
•
• func (n *Node) Right() (*Node) {
• return n.right
• }
•
• func (n *Node) IsLeave() bool {
• return n.right == nil && n.left == nil
• }
•
• func (n *Node) IsBalanced() bool {
• return math.Abs(float64(balancedFactor(n))) < 2
• }
•
• func (n *Node) GetHeight() int {
• return n.height
• }
•
• func (n *Node) GetParent() (*Node) {
• return n.parent
• }
•
• func (n *Node) setLeft(node *Node) {
• n.left = node
• if node != nil {
• node.parent = n
• }
• }
•
• func (n *Node) setRight(node *Node) {
• n.right = node
• if node != nil {
• node.parent = n
• }
• }
•
• func (n *Node) detachChild(node *Node) error {
• if n.left == node {
• n.left = nil
• node.parent = nil
• return nil
• }
•
• if n.right == node {
• n.right = nil
• node.parent = nil
• return nil
• }
•
• return errors.New("Node wasn't found"
• }
•
• func rotate(n *Node, tree *Tree) {
• if !n.IsBalanced() {
• bf := balancedFactor(n)
• if bf > 0 {
• bfNext := balancedFactor(n.left)
• if bfNext > 0 {
• leftLeftRotation(n, tree)
• } else {
• leftRightRotation(n, tree)
• }
• } else {
• bfNext := balancedFactor(n.right)
• if bfNext > 0 {
• rightLeftRotation(n, tree)
• } else {
• rightRightRotation(n, tree)
• }
• }
• }
• }
•
• func leftLeftRotation(pivot *Node, tree *Tree) {
• child := pivot.left
•
• // House keeping
• fixTree(pivot, child, tree)
•
• pivot.setLeft(child.right)
• child.setRight(pivot)
•
• updateChild(child)
•
• }
•
• func leftRightRotation(pivot *Node, tree *Tree) {
• rightRightRotation(pivot.left, tree)
• leftLeftRotation(pivot, tree)
• }
•
• func rightRightRotation(pivot *Node, tree *Tree) {
• child := pivot.right
•
• fixTree(pivot, child, tree)
•
• pivot.setRight(child.left)
• child.setLeft(pivot)
•
• updateChild(child)
• }
•
• func rightLeftRotation(pivot *Node, tree *Tree) {
• leftLeftRotation(pivot.right, tree)
• rightRightRotation(pivot, tree)
• }
•
• func fixTree(pivot, pivotChild *Node, tree *Tree) {
• if tree.root == pivot {
• tree.root = pivotChild
• pivotChild.parent = nil
• } else {
• if pivot.parent.left == pivot {
• pivot.parent.setLeft(pivotChild)
• } else {
• pivot.parent.setRight(pivotChild)
• }
• }
• }
•
• func updateChild(child *Node) {
• if child.left != nil {
• child.left.updateHeight()
• }
•
• if child.right != nil {
• child.right.updateHeight()
• }
• child.updateHeight()
• }

Thank you dekatron for your reply.

I am fairly new to all of this, but I just got done reading/researched on chatbots , I think it’s within the ballpark of what am trying to achieve,solving a problem using machine learning techniques,I just need help(how, what, ,why,best approach, techniques for a novice school project) and detail explanations from experienced hands.

Thank you dekatron for your reply.

I am fairly new to all of this

Dekatron:
You have a few options:

Use AIML to write your Bot. You can build a desktop/android App dor your Bot. I am actually working on it.

Use Microsoft Bot Framework- Its quite fresh (c'mon it was fully started last year. It was announced during Microsoft Build 2016!) and therefore much tutorials might not exist for it. That means to build something reasonable for a project, Your Node js must be roaming and barking mad. lol


Use Facebook Bot Framework- You see those guys on Nairaland that are building chatbots for MTN and co? They use FB bot framework (cant remember the official name). Your Node js must be like the Microsoft bot framework level.


If you are really smart and have time and know Java well, use Google TensorFlow/ Deep Learning libraries/Algorithns/Libraries. nollyj, losprince, dhtml18,SeunLanlege, jidez007 and other bosses, a nigga needs your help here.

Yes I truly do, I think they used chatfuel, pandaroabot and other chatbot platrms.

am not really good in java,just started learning node js ,am not that smart and there is no much time on my side bro.

Well am a learner and i want help in my chatbot project. First of all the aim of my project is developing a customer service chatbot (interacts with the users,providing them with the needed information and solving their problems)

So, what i’m struggling now is how to make it intelligent or in other words make it learn and grow after each conversation. There are many and many ML algorithms that i couldn't decides which one is the best.
So, if any one here can help me either by providing examples, suggestion or a solution to this problem that will be very very helpful.
thank you,

Hey fam. of great platform with great information.
I 'm a bachelors degree student in computer sciences, ,i can to a certain level code in (HTML,CSS,JAVASCRIPT and PHP) with a little moderate level of python.
My project supervisor insist I solve a problem on machine learning, so I have an idea in mind which is which is to develop a conversational customer service bots for telecom industry in my country, to assist users in getting information like data plan,voice migration plans,codes, Internet configuration details e.t.c
This is to simplify getting valid and clear information without doing more of research ,using search engines or Google app and face difficulties in finding right information.
The bot is gonna be a desktop app,with a serious documentation and presentation, because the grading system are going be interested in model, method, algorithm, api, libraries used. and the bot has to read and learn from users input and reply with a response, which has to be a correct information to users specific request and also should allow a bit of conversation features.
FOR the purpose of clarity I need help to make choices through experience developers in this platform.
PLEASE guide and advice me theoretically on how to achieve this and get an A GRADE.
THANK YOU inadvance.m

Hey fam.!
I am new here
I 'm a bachelors degree student in computer sciences, ,i can to a certain level code in (HTML,CSS,JAVASCRIPT and PHP) with a little moderate level of python.
My project supervisor insist I solve a problem on machine learning, so I have an idea in mind which is which is to develop a conversational customer service bots for telecom industry in my country, to assist users in getting information like data plan,voice migration plans,codes, Internet configuration details e.t.c
This is to simplify getting valid and clear information without doing more of research ,using search engines or Google app and face difficulties in finding right information.
The bot is gonna be a desktop app,with a serious documentation and presentation, because the grading system are going be interested in model, method, algorithm, api, libraries used. and the bot has to read and learn from users input and reply with a response, which has to be a correct information to users specific request and also should allow a bit of conversation features.
FOR the purpose of clarity I need help to make choices through experience developers in this platform.
PLEASE guide and advice me theoretically on how to achieve this and get an A GRADE.
THANK YOU inadvance.m

available

65,negociable

Available

available