Pratish Thaker's Posts - eOffice

ISDN - A Great Communication Tool

2008-07-16T12:43:21.000Z

ISDN Has emerged as a powerful tool worldwide for provisioning of different services like voice, data and image transmission over the telephone line through the telephone network. ISDN is being viewed as the logical extension of the digitalization of telecommunication network and most developed countries are in different stages of implementing ISDN.

An ISDN subscriber can establish two simultaneous independent calls (except when the terminal equipment is such that it occupies two 'B' channels for one call itself like in video conferencing etc.) on existing pair of wires of the telephone line (Basic rate ISDN) where as only one call is possible at present on the analog line /telephone connection. The two simultaneous calls in ISDN can be of any type like speech, data, image etc. The call setup time for a call between two ISDN subscribers is very short, of the order of 1 to 2 seconds. ISDN also supports a whole new set of additional facilities, called Supplementary Services.

Connectivity:

The ISDN subscriber will have full connectivity, nationally, to other analog telephone subscribers. At present ISDN services are available to and from India for the following countries:

Australia
Austria Belgium
Canada
Denmark
France
Germany
Ireland
Italy
Israel
Japan
Malaysia
Netherland
Norway
Phillipines
Singapore
Switzerland
Thailand
U.A.E
United Kingdom
U.S.A

Services Offered By ISDN:

Normal Telephone & Fax (G3)
Digital Telephone -with a facility to identify the calling subscriber number and other facilities.
G4 Fax
Data Transmission at 64 Kbps with ISDN controller card
Video Conferencing at 128 Kbps
Video Conferencing at 384 Kbps (Possible with 3 ISDN lines)
ATM (Asynchronous Transfer Mode) or PVC (Permanent Virtual Circuit)
List of ISDN stations of BSNL in India
Variety of supplementary Services supported by ISDN.
Calling Line Identification Presentation(CLIP)
Calling Line Identification Restriction(CLIR)
Multiple Subscriber Number(MSN)
Terminal Portability(TP)
Call Hold(CH)
Call Waiting(CW)
User to User Signaling (UUSI)

Types of Accesses:

There are two types of "accesses" (connections) for ISDN.
Basic Rate Access(BRA): 2B+D
2 Channels of 64 Kbps for Speech And Data.
1 Channel of 16 Kbps for Signalling
Primary Rate Access (PRA): 30 B+D
30 Channels of 64 Kbps for speech and data.
1 Channel of 64 Kbps for signalling.

Power of Affiliation

2008-07-16T12:34:59.000Z

Affiliate Internet Marketing is a huge concept that has taken the Web by storm. It is a lucrative and fairly effortless way to participate in the marketing and sale of products and services through the power of collective online marketing. Unfortunately, due to its popularity, affiliate marketing as a business opportunity is also very competitive. You will need to present quality web content to attract customers to buy from you as they check out all of the sites for competitive products and services. There are, however, specific criteria that marketers recommend to be followed when creating a participant website for an affiliate marketing program.

Always adhere to the AIDA principle Attention, Interest, Desire, and Action. This is at the core of many affiliate internet marketing business opportunity web sites. You will want to get the attention of the reader as fast as possible. Get them interested by letting them know the product you are selling is going to assist. Then, convert their interest into a compelling desire and instill actions to buy. ADIA is a simple formula that has proven over time to work. The challenge is to make it work for you.

Next, the headline, if properly constructed, will grab your readers attention. The headline should be unique, compelling and be a direct call to action. Remember that you only have a few seconds to make a memorable impression, so your headline copywriting approach is very important. You might be wondering how to go about copywriting a good headline. A good way to start is to research other content, copywriting and headlines on affiliate sites. Is the copywriting compelling? Does it motivate you to want to respond and act? Is it credible? Eliciting a strong emotional response is always a prime goal of expert headline writers. You must convert curiosity into action by emphasizing benefits at all times. Your call to action is at the core of your direct response pitch. What is it you want the reader to do? If you want the reader to click on a link to a sales page, opt-in to an email list, or click to buy, it must be made clear as to what your intent is. People want clarity when they are being asked to take action, so be sure to give it to them.

They also need reassurance and encouragement to overcome the last vestiges of doubt and resistance. Once you have accomplished all of this, your job is to get them interested from the balance of your content. You will want to maintain the excitement that you initially generated, and continue the process wherein they overcome sales resistance and purchase your product or service. Copywriting a web page requires skill, knowledge and perseverance. You might have to work at developing the writing skills needed for success. Another option is to hire a professional copywriter. Either way, one of the great benefits of affiliate Internet marketing is that you can start by referring readers to a product sales page that is more factual and informational, than direct-response oriented from a copywriting standpoint. Meanwhile, as you continue to develop and expand the site, you can learn these skills further, or hopefully at that point, you will have enough initial income generated to hire professional copywriting help.

Another benefit of affiliate Internet marketing is viewing other web sites. There are some excellent sites you can view as part of this process. Be sure to learn from them. You will also discover useful techniques that will prove to be valuable in your online marketing efforts.

General Problem Solver Program

2008-07-16T12:27:47.000Z

This program is a simplified version of the General Problem Solver, loosely designed paradigms of Artificial Intelligence Programming and, even more loosely, from Alan Newell and Herbert A. Simon's GPS, a program that simulates human thought''.

The GPS procedure takes as arguments an initial state, a list of goals to be reached, and a list of operations that can be performed to transform the state in the course of a solution. If the specified goals can be attained from the given initial state, the GPS procedure displays the sequence of operations that will achieve them; otherwise, it reports that it is unable to find a solution.

(define GPS
(lambda (initial-state goals operations)
(let ((result (achieve-all goals initial-state operations)))
(if result
(display-steps (cdr result))
(writeln "GPS was unable to find a solution.")))))
Given a list of goals, an initial state, and a list of state-transforming operations, the achieve-all procedure attempts to achieve each of the goals successively, using the final state reached during the achievement of a goal as the initial state for the achievement of the next. If it is successful, it returns a pair in which the first component is the state reached at the end of the entire process and the second component is a list of the operations by which the result was achieved. If it is unsuccessful in achieving any one of the goals, the achieve-all procedure returns #f.

(define achieve-all
(lambda (goals initial-state operations)
(if (null? goals)
(cons initial-state '())
(let ((first-part (achieve (car goals) initial-state operations)))
(and first-part
(let ((rest-part
(achieve-all (cdr goals) (car first-part) operations)))
(and rest-part
(cons (car rest-part)
(append (cdr first-part) (cdr rest-part))))))))))

Given a single goal, an initial state, and a list of state-transforming operations, the achieve procedure tries to find a way to achieve the goal starting from the initial state. If the goal is already met in the initial state, the problem is trivial; otherwise, achieve searches for an appropriate operation -- one that would result in the addition of the goal to the current state -- and attempts to achieve all of the preconditions for that goal. If it succeeds, the achieve procedure returns a pair in which the first component is the state reached at the end of the process and the second component is a list of the operations by which the result was achieved. If it is unsuccessful, the achieve procedure returns #f.

(define achieve
(lambda (goal initial-state operations)
(if (member? goal initial-state)
(cons initial-state '())
(try (lambda (possible)
(let ((result (achieve-all (preconditions possible)
initial-state
operations)))
(and result
(cons (apply-operation (car result) possible)
(attach-at-end possible (cdr result))))))
(filter (lambda (op)
(member? goal (products op)))
operations)))))

The member? procedure determines whether a given value occurs as an element of a given list.

(define member?
(lambda (val li)
(cond ((null? li) #f)
((equal? val (car li)) #t)
(else (member? val (cdr li))))))

The try procedure takes a procedure and a list of potential arguments to that procedure. It applies the procedure to successive elements of the list until either the list is exhausted (in which case it returns #f) or the procedure returns a value other than #f (in which case the try procedure returns that value).

(define try
(lambda (proc li)
(if (null? li)
#f
(or (proc (car li))
(try proc (cdr li))))))

The filter operation takes a predicate and a list and returns a list containing the elements from the given list that satisfy the predicate.

(define filter
(lambda (pred li)
(letrec ((helper
(lambda (rest so-far)
(if (null? rest)
(reverse so-far)
(helper (cdr rest)
(let ((first (car rest)))
(if (pred first)
(cons first so-far)
so-far)))))))
(helper li '()))))

Given a value and a list, the attach-at-end procedure constructs and returns a new list, containing the same elements as the given list except that the given value has been added as the last element.

(define attach-at-end
(lambda (val li)
(if (null? li)
(cons val '())
(cons (car li) (attach-at-end val (cdr li))))))

To apply an operation to the current state, remove the conditions that the operation consumes or falsifies and add those that it produces.
(define apply-operation
(lambda (state operation)
(union (products operation)
(set-difference state (sumpta operation)))))

Given two lists, the union operation forms a list containing exactly those values that appear on one or both of the given lists.

(define union
(lambda (set-1 set-2)
(letrec ((helper
(lambda (set so-far)
(if (null? set)
so-far
(helper (cdr set)
(let ((first (car set)))
(if (member first set-2)
so-far
(cons first so-far))))))))
(helper set-1 set-2))))

Given two lists, the set-difference operation forms a list containing exactly those values that appear in the first of the given lists and not in the second.

(define set-difference
(lambda (set-1 set-2)
(letrec ((helper
(lambda (set so-far)
(if (null? set)
so-far
(helper (cdr set)
(let ((first (car set)))
(if (member first set-2)
so-far
(cons first so-far))))))))
(helper set-1 '()))))

An operation is a list of four elements: a string indicating what the operation does, a list of the preconditions for the operation, a list of the conditions that the operation produces, and a list of the conditions that it consumes or falsifies.
The make-op operation constructs such a list from its components.

(define make-op
(lambda (action preconditions products sumpta)
(list action preconditions products sumpta)))

The following operations recover the respective fields of an operation.
(define action car)
(define preconditions cadr)
(define products caddr)
(define sumpta cadddr)

The writeln procedure writes out its arguments in order, immediately adjacent to one another, and then starts a new line.

(define writeln
(lambda args
(for-each display args)
(newline)))

The display-steps procedure prints out the ``action'' field of each operation in a sequence, one operation to a line.

(define display-steps
(lambda (operation-sequence)
(for-each (lambda (operation)
(writeln (action operation)))
operation-sequence)))

Here is the setting for one kind of problem that this simple version of GPS can solve: a collection of six operations from the daily life of a parent.

(define *school-ops*
(list

;; If your son is at home and your car works, it is possible to drive
;; him to school. (Then he'll be at school and will no longer be at
;; home.)

(make-op "drive son to school"
'(son-at-home car-works)
'(son-at-school)
'(son-at-home))

;; If your car needs a new battery, and the mechanic knows the problem
;; and has been paid, it is possible him to install the new battery.
;; Then the car will work.

(make-op "have the mechanic install a new battery"
'(car-needs-battery mechanic-knows-problem
mechanic-has-money)
'(car-works)
'(car-needs-battery))

;; If you can communicate with the mechanic, you can tell him about the
;; problem with your car, and then he'll know what it is.

(make-op "tell the mechanic what the problem is"
'(in-communication-with-mechanic)
'(mechanic-knows-problem)
'())

;; If you know the mechanic's telephone number, you can call him, and
;; then you'll be able to communicate with him.

(make-op "telephone the mechanic"
'(know-phone-number)
'(in-communication-with-mechanic)
'())

;; If you have a telephone book, you can look up the mechanic's number,
;; and then you'll know what it is.

(make-op "look up the telephone number"
'(have-phone-book)
'(know-phone-number)
'())

;; If you have money, then you can pay the mechanic. Then he'll have
;; the money and you won't.

(make-op "pay the mechanic"
'(have-money)
'(mechanic-has-money)
'(have-money))))

Here, then, are a couple of problems that GPS can solve, using these operations:
> (GPS '(son-at-home car-works) '(son-at-school) *school-ops*)
drive son to school

> (GPS '(son-at-home car-needs-battery have-phone-book have-money)
'(son-at-school)
*school-ops*)
look up the telephone number
telephone the mechanic
tell the mechanic what the problem is
pay the mechanic
have the mechanic install a new battery
drive son to school

On the other hand:
> (GPS '(son-at-home car-needs-battery have-phone-book)
'(son-at-school)
*school-ops*)
GPS was unable to find a solution.