vanisudheer

emmunAkkaaaaaaaaaaa

2008-12-11T21:16:00.000-08:00

Emunnadakko ooo emunnadakkaaa…
Potta perigipoi..juttu ralipoi…vunna paruvu poi..
ee industry lo nakinka
emunnadi akko.. emunnadi akko emunnadi akka..

B.Tech chesi naaka (saami)
Hyderabad cherukunnaa(saami)
Experience adugutunteeeee aa aaaa aaaav
Experience adugunte, enta kaavali ante anta petti, job kottina, join ayyina banchaaaaaaan

(Emunnadi akko..)

Training lu ivvaka paye (saami)
Client interaction annadu (saami)
Communication baledu ante a aaa aaaa
Communication baledu ante, kumili kumili edichina, hindu paper veyinchinaa banchaaaaaan

(Emunnadi akko..)

Project ichundu vaadu(saami)
Payslip kuda vachindi(saami)
Payslip chupinchiiii. a a a a a a aaaaaaaaaaaa
Payslip chupinchina, credit card teesukunna, avasaram lenivi anni konna appula palu ainaaa banchhaann…

(Emunnadi akko..)

Project aipoindiii(saami)
Kottadi vastadi annadu (saami)
Bench lo pettundu aaaaa a aa aaaaaaa
Bench lo pettinaaka subject marichipoina, o roju na HR pilusundu poi kalisina banchaann….

(Emunnadi akko..)

Boom taggindi annadu (saami)
Cost cutting annadu (saami)..
Benchlo vunna ani cheppiii aaaaaa a a a a aaaaa

Bench lo vunna ani cheppi bayatiki tosundu kompa kulchundu banchaaannn…

(Emunnadi akko..)

By
R.NarayanaMurthy,
Dreaming to be Infy NarayanaMurthy

2008-12-04T21:49:00.000-08:00

Teacher: 'What is your name?'.
Student: 'Mera naam Suraj Prakash hai.'
Teacher: 'When I ask a question in English, answer it in english.'
Student: 'My name is Sunlight .

Teacher: What happened in 1869?
Student: Gandhi ji was born.
Teacher: What happened in 1873?
Student: Gandhiji was four years old.

Question: What is the fullform of maths.
Answer: Mentally affected teachers harassing students

Hai

2008-11-21T22:04:00.000-08:00

The Beauty of Life does not depend on how happy you are…

But how happy others can be…Because of You!!!

good morning chirala

2008-11-17T21:26:00.001-08:00

When something happens to you Good or Bad,

Consider what it means .....
There's a purpose to life's events ,

to teach you how to laugh more or
not to cry too hard …

…Have a Nice Day …

best poetry

2008-11-13T01:24:00.000-08:00

spandinche prati saari tanalo nimpukunna ninnu talchukune na hrudayam
thana adrustaniki maimarachipotunte,teravagane ninnu choodalani
na kallu thamanu thaamu nindinchukuntunayi
ninu choodalani kanulu nidra nu swagatiste aa nidra lo swapnam la ninnu
kallaku choopalani manaSU tapistundi......................
neevu kanapade madura swapnam kosam nidrinche kallu asalu melukuve rani nidra nu
korukuntanayi

tirupathi balaji

2008-11-13T01:19:00.000-08:00

2008-11-13T01:13:00.000-08:00

2008-11-13T01:09:00.000-08:00

18 rules to live

2008-11-13T01:04:00.000-08:00

2008-11-13T01:01:00.000-08:00

2008-11-13T01:00:00.000-08:00

2008-11-13T00:55:00.000-08:00

i would like to stitch

2008-10-16T01:49:00.000-07:00

Employment to Physically handicaps

2008-09-24T21:54:00.000-07:00

One of the MNC company(Tetra Soft Pvt. Ltd.,) in Hyderabad is offering an employment for Physical Handicaps on the event of their annual day.

Eligibility: Any graduation-Passed out in 2007-2008.

If you know any buddy, Please convey them and send the resume yugandhar_poola@rediffmail.com or shazari@capgemini.com by 24/09/08.

Lets us help them to get in to IT industry.

Regards,

Yugandhar Poola

GID 54324|HCU Mainframe|Bangalore, India

Mobile: 91-9886660485

Satyam Computer Services

mc database

2008-09-17T00:22:00.000-07:00

B. Mobile Databases
The conventional database model is changing fast [1][3].
Mobile devices are now capable of complex processing tasks
and have significant storage capability. As a result a new
approach of storing databases on every single machine, part of
a network is gaining significance. The concept of one central
autonomous database is thus fading fast, with the new notion of
local databases at each machine gaining prominence. Mobile
Hosts can now become machines for data processing and native
storage. Thus the physical location of databases is changing.
Frequent disconnection in mobile devices results in two
approaches. The first one believes that a MH will be offline for
only a very short period as it changes regions, while the other
supports the fact that a mobile user may be offline for a long
time and only comes online briefly. This can be a major design
consideration for any application designed for such devices.
The fundamental notion here is that a mobile user must be able
to work with his own local copy of the database even if his or
her connection to the network is broken. It is essential to handle
both cases maintaining user transparency at all times. For
example we may initially have a permanent connection to the
network, however as battery power runs low we can switch to
the other approach where the MH comes online only
intermittently for very brief periods only when needed or more
generally to perform an amalgam of network related tasks
simultaneously. Thus of significant concern is the limited use
of broadcasts or any other connectivity resource in-order to
make optimum use of available battery power.
Identification of a particular MH(the source of the database
under consideration) is also difficult. How does one locate the
MH in question? This is further complicated by the fact that
MHs move all the time, showing up intermittently in various
places, to further complicate things service areas(BH regions)
are not always contiguous [2][5] and may even be overlapping,
figure 2. Moreover a MH may not always move in a straight
line. As soon as an MH enters a new region the new region
manager(BH of the new region) detects a foreign entity and
asks it to identify itself. Upon receiving details the new BH
contacts the home BH or old BH of the MH and asks it whether
or not the mobile entity is what it claims to be(though this is
time consuming it is important from the safety point of view).
After credentials are established the MH may now work in its
new region, moreover the old BH may also transfer any
transactions started by the particular MH to the new BH. It
however may only return results(if the transactions are not
location dependent) to the new BH. One of the approaches is
chosen depending upon context.
Another, more severe problem is how does an MH find out
which BH it has to communicate with. Consider the case shown
in figure 2, when the MH moves it may come into an
overlapped region, how does the MH now decide what BH to
communicate with. This problem may be solved with a flurry of
messages between the concerned BHs and MH. This problem is
generally another major design consideration however it still is
a key aspect of research in this area.
As with all new approaches, significant problems and
complications result in such a system. Apart from conventional
difficulties a mobile database system may suffer from other
problems. Some of them are –
• Failure of sites
• Loss of messages
• Failure of communication links
• Network partition
Moreover the process of executing queries and supporting
concurrent execution of transactions becomes extremely
complex. Further, distributed (mobile) databases may be
categorized as either heterogeneous or homogeneous databases
depending upon the schema type they support. It is not
uncommon to have whole distributed systems designed with
only fixed schema sets, significantly more interesting(and
complex) is designing distributed systems that allow different
schema sets in the underlying databases at different sites on the
network. We tackle several of these issues in the following
sections.
C. Multidatabase System
A multidatabase system [6] is the term used to refer to a
collection of physically separated, but logically integrated
group of databases. That is, it is an approach wherein different
databases are combined together by an application software
layer to give the illusion of one integrated database to the user.
The additional layer is thus completely portable and pluggable
[7]. These different databases, called local databases generally
have different hardware and software implementations. In fact
it is generally economically viable to maintain local database
schema (also the hardware and software) and hence the need to
maintain local autonomy. MDASs are multidatabase systems
capable of large-scale operation over a wireless medium.
D. Transactions and Concurrency
The fundamental notion governing all database activity is a set
of four properties known commonly as the ACID properties
[8]. These properties take a whole new meaning in the
distributed sense. Mobile transactions are completely different
from conventional flat transactions. Mobile transactions must
be defined adequately as they are often unable to follow the
ACID model(sometimes a more complex strategy like a
modeling based on trees is adopted). Properties of transactions
and hosts on the move must be considered at all points giving
due consideration to an excellent recovery approach(generally
detailed logs). In this effect a proper requirement analysis is a
must[1]. The difficulties and security concerns with mobile
transactions must be well understood. Also search costs and
overhead to locate the correct MH is another important
parameter. Transactions thus take a lot longer to complete in
mobile environments, where a transaction may be defined as a
collection of queries geographically distributed, and arranged
so as to obtain location specific results. Thus there is a need to
temporarily deviate from the ACID properties when it comes to
mobile transactions. A general transaction may be of the
following type-
begin_transaction( ) {
if(lock_table_success) {
//statements of the transaction
select * from table_account;
…
//do some work
…
transaction_successful = true;
//transaction code ends
}
if (transaction_successful)
commit_work( );
else
rollback_work( );
Concurrency related to transactions demonstrates the fact
that more that one transaction can execute simultaneously such
that none of them is aware of the presence of others. Moreover
the database(s) must remain in a consistent state when these
transactions finish, however temporary inconsistency may be
allowed for a transaction to complete its work. Concurrency of
transactions increases design complexity however, performance
benefit realized as a result is enormous. Mobile and Distributed
systems however represent even higher levels of complexity.
Transactions become long lived and concurrency becomes
harder to achieve. A number of approaches to solve these
problems in massively heterogeneous systems have been
devised. These range from relatively simple locking and graph
based protocols to complex distributed algorithms [8][9].
Transactions take a lot longer to finish in mobile systems; apart
from this communication failures etc. may cause problems
[2][10][11][12]. A detailed approach to handling transactions in
a massively distributed system is discussed in a subsequent
section.
E. Deadlocks
The problem of deadlocks though of important consequence is
generally ignored by centralized systems as such. This is
generally because deadlocks are a rare occurrence in these
systems and the overhead associated with handling deadlocks
can be significant. The situation in the distributed context is
different though. As an analogy consider a peer-to-peer
database system, where each node can generate queries that are
both local and global. A system of simply 200 nodes with 10
queries per node can create a significant number of
transactions. As is obvious competition for resources is
immense and the problem of deadlocks takes center stage.
Theory calls for a formal definition of deadlocks, this section
talks about it. A system is in a deadlock state if there exists a
set of transactions {T0,T1,…..,Tn} such that every transaction in
the set is waiting for another transaction in the set[8]. In a
multiprogramming environment, analogous to the mobile
database model, several processes may compete for a finite
number of resources. Such a situation can lead to a deadlock
where processes or transactions are blocked, waiting
indefinitely for a resource that is held by another blocked
process. Deadlock detection and avoidance forms an important
part of any distributed system. Techniques for deadlock
management are essential to see the efficient working of any
such system. A number of algorithms to handle deadlocks are
available [8][13][14][15], both in the distributed and
centralized sense.
II. System Architecture
We have devised a system that is capable of operation in large
scale distributed(mobile) environments. The approach
considers all aspects of such a system, problems faced by the
various aspects and implementations after rigorous
performance testing. Our main focus was to design a system
capable of extending commercially available centralized
databases to operate safely under the rigors imposed by largescale
distribution. We have opted for the mobile database
model where in each node or machine has its own local copy of
a database. Databases present may even have different schema.
Each node is capable of submitting queries or transactions to
any other node currently registered. The approach is fully
distributed with only an initial registration with a MainServer
needed. For this purpose any host may act as a server after
being chosen by a simple election algorithm (when the system
is started initially). We have thus eliminated the need for
central transaction managers, resource managers, etc, which
(we feel) only act as centralized bottlenecks when such a large
system is to be considered. All nodes have their own
concurrency control and log maintenance for effective
restoration from failure. A fully distributed approach is thus
maintained. A host after initial registration with the acting
server is capable of complete autonomous operation. It simply
needs to import a list of current hosts which can be easily done
with the button. It is then possible to address and
communicate (work with the database of) any host currently on
the network. Even the central MainServer is expendable and is
only implemented as we need some mechanism to have node
details. In this effect a simple distribution list may be cycled
through the network to provide the hosts with necessary
information. We have however opted for the server based
approach. The architecture of this system is shown below in
figure 3.
The presented model is in fact similar to a multidatabase
system[6], like most multidatabase systems, local autonomy is
maintained even after joining the global system with the
fundamental difference lying in the fact that our approach is
fully distributed and there is no global layer to control the
systems’ working.
File Handler
Stable Storage
Transaction Processing System
User Interface
System Manager
Connections Manager
Run-Time Storage
Log Files
Local
Database
and
Database
Software
Transaction and Query
Manager (local)
Transaction Coordinator
Concurrency Manager
Lock Manager
Deadlock Handler
Recovery Manager
Transaction
Submitter
Update Manager
Figure 3. System Structure
Complete local autonomy also brings with it a surcharge, the
fact that a global transaction may starve if a local user does not
give it time to run. The user may do this inadvertently as most
user based transactions are long lived. For this purpose a
option is provided and the user is encouraged to
commit her work periodically thus creating what amounts to
sagas, where the user’s work is committed and global
transactions are given a chance to spawn from that point. Longlived
global transactions may also have explicit commit points
to provide effective scheduling of transactions.
A. Local Database and stable storage
The proposed model is built upon the bottom up strategy, i.e.
databases are already present and are not modified in anyway to
join the system. This approach is necessary as most
organizations and people already have data base management
systems of their choice installed and configured. These
databases are stored on disk and more often than not have
different schema, policies and data structures, usually
signifying the many different commercially available databases.
Log files [8] are maintained for all operations to effectively
resume operation after a failure has occurred. It is assumed that
all writes to disk are persistent and survive failures. Every node
upon initial startup checks whether this is the first time on the
network, if not the recovery manager routine is called taking a
due look at previous transactions and system shutdown. A
typical log file has the following contents.
!#LOG_FILE$4522#!
!#INFILE$172.16.4.3$1111transactionList.txt#!
!#COMMIT_POINTS$5#!
!#COMMIT_1$done#!
!#COMMIT_2$done#!
!#COMMIT_3$done#!
!#COMMIT_4$done#!
!#COMMIT_5$fail#!
!#LOG_FILE$END#!
The above log file is for transaction id 4522 at this node. The
second line shows the name of the file in which the transaction
list is stored, this is made to match the submitter id and the
transaction id at that node. This approach gives us an efficient
name scheme and a method to submit back transaction results
to the corresponding nodes along with support for transaction
status queries. The transactions branch into sub transactions at
commit points and the status of each sub transaction is stored.
This gives a means to speed up recovery. For example in the
above case the transaction manager is called by the recovery
manager and it is able to go to the last(5th ) part of the particular
transaction straight away. Moreover a master(summary) log file
is also maintained to speed up the recovery process and only go
into details of the necessary transactions(for example, the ones
that were not completed).
!#LOG_FILE$MASTER#!
!#
<4522>$<172.16.4.3>$<172.16.5.34>
~~STATUS~~
fail
#!
!#
<4523>$<172.16.5.34>$<172.16.5.34>
~~STATUS~~
done
#!
!#LOG_FILE$END#!
The above master file shows two transactions, the first is a
global submitted transaction, the second is a local
transaction(note the two ids are the same). The first transaction
has not completed. The recovery manager calls the
corresponding file(the one shown previously), here the control
is transferred to the transaction manager sending it straight to
the last(5th )part of transaction 4522. Thus an efficient
mechanism for keeping the transactions and their sub
transactions running has been put in place.
B. Network Connections
LAN(including wireless) communication hardware typically
offers non reliable multicasts and unicasts. Other problems
arise due to packet loss or packet overtaking inside switches
and network cards. The presented model is implemented
completely with UDP and supports timeouts and
retransmissions as and when necessary. Unique threads are
created for each communication session and each host to create
a safe and efficient network environment. Threads are further
grouped into Thread Pools to logically integrate and simplify
thread monitoring and to provide the best possible performance.
UDP was chosen simply because it entails the least overhead.
Since wireless communication is susceptible to
eavesdropping (as radio signals can move through walls)
security is given prime concern. All communication is
encrypted with a unique key hard coded into the
application(this of course can be changed to add key based
security features).
C. User Interface
The GUI is simple to use with onscreen help. Users may
submit, through it local and global transactions. Global
transactions can also be spread over more than one site.
Effective monitoring of all activity is done and visible on
screen. The user may also initiate status detection if she feels
her transactions’ results are long overdue. Working in the
background is the update manager (which may be disabled).
This is responsible for keeping up to date information about
nodes on the network and may be modified for use as a means
of background message passing between hosts thus leaving
scope for improvement and addition of(in the near future)
automatic handling of tasks by nodes.
D. Transaction Processing System
In the mobile database environment it is essential for users at
various sites to be able to access databases at others sites. In
effect, a database stored at one host has to cater to simultaneous
needs of many other hosts, while maintaining its autonomy.
This approach is of extreme importance in applications such as
banking. This is, in fact one of the key growth areas for MCommerce.
The real time fast access of databases has several
advantages of improved efficiency, better application
performance(lesser waiting time for users), etc. It however,
also comes with a host of new problems.
A number of security issues arise pertaining to simultaneous
data access and database modification by more than one
transaction at a time. In fact most transactions in these cases
span over multiple sites and need sub transaction management
(sagas and nested sagas). Another issue is local autonomy of a
site. Whether or not, to allow global entities to control
transaction processing is another issue. If allowed local
autonomy is often jeopardized, if not then external transactions
may have to wait for a long time before being executed. This
leads to indefinite delays, unnecessary aborts and hidden
deadlocks[6]. In fact tradeoffs of some kind must be made,
generally a proper transaction-processing scheme is
implemented and maintained across all sites to make sure the
ACID properties are always satisfied.
It is a design consideration in our model and fundamental to
its operation that a host does not treat a global transaction as if
it were special. Once submitted a transaction is totally
dependent on the host for its completion. This approach is
consistent with our decision of maintaining local autonomy.
Once completed, results are sent back to the originating host.
To maintain the ACID properties transactions must be
completed as a whole or aborted with compensating
transactions whenever needed. Moreover, before a successful
commit, the changes made by a transaction are visible only to
itself. This approach prevents cascading rollbacks incase the
transaction aborts. However, to speed up operation, since most
transactions are long lived, explicit commit points may be
specified so as to generate sagas, and handle many transaction
operations in parallel. The submitter of the transaction must
specify explicit commit points and the transaction effectively
branches at this point to have its partial work committed.
Global transactions however may not give immediate results; in
fact the transactions are stored locally and only when
completed are they submitted to the desired host(s). This
approach is consistent with minimum communication usage so
as to provide optimum usage of battery power for mobile hosts.
Once the transaction is processed the results are sent back to the
submitter.
Transactions are moved around using a fixed format. Strings
of data(queries) are stored as files mapped as trees logically,
where the root node is always a string of the form:
!#$$#!
This string enables us to distinguish transactions from one
another, recover from failures and handle re-submissions in
case of network loss or delay. The remaining nodes contain
strings of the query statements that make up the transaction.
Consider the transaction fragment given below.
select * from table_1;
insert into table_1 values(23, “rookie”);
commit;
select * from table_1;
select * from 172.16.3.2#table_45;
insert into 172.16.3.2#table_45 values (34, 34,
“veteran”);
commit;
This amounts to the following(logically), figure 4.
!#<4522>$<172.16.4.3>$<172.16.5.34>#!
select * from table_1;
insert into table_1
values(23, “rookie”);
commit;
select * from table_1;
select * from
172.16.3.2#table_45;
insert into
172.16.3.2#table_45 values
(34, 34, “veteran”);
commit;
Transaction subpart
Transaction subpart
Figure 4. Nested Transactions
Thus as can be seen from the figure above the transactions
divide themselves at commit points specified by users thus
amounting to sagas. This approach is extremely efficient in
increasing system throughput as global transactions or other
submitted transactions’ parts are given a chance to run, as the
previous work has been committed. The sub-transactions are
often executed independently from one another and parts of
transactions may be restored or rolled back depending upon
context. Moreover it is also possible to send of sub-transactions
to other hosts in an efficient manner. Such conventions and
corresponding naming methods are adopted for results to be
sent back to the designated hosts as well.
When a transaction has completed its work it must be made
permanent. Local transactions are committed at user discretion.
Global transaction queries are committed at the sites they are
sent to and any results generated are stored as a file and
forwarded to the respective submitter. Under this scheme, the
transactions are executed independently at each site. Logs are
maintained to implement this regardless of failures. However in
case of a failure of a transaction at one site it becomes the
responsibility of a manual operator to make sure that the
required work is done at that site, particularly since partial
commits are allowed and sub-transactions may have been
committed at other sites. Transactions once committed cannot
be rolled back. If possible a compensating transaction may be
generated otherwise manual intervention is needed. The
‘OPTIMISM’ model however guarantees delivery of the
necessary alerts and messages to the concerned hosts. Incase of
failure before a commit the work of a transaction is rolled back
automatically. Local transactions may also be rolled back at
user discretion. When a transaction is rolled back no other
transaction is effected since the work done by a transaction is
visible only to itself before a commit.
A unique feature of this model is the fact that heterogeneous
databases and schema are supported. Different databases
having different relations(tables) may be used remotely to
generate transactions and submit results. A user at a particular
site simply needs to specify the name of the concerned site
where the database is located and she is provided all the details
of that sites schema. This may then be kept in mind to generate
transactions as required. Caching is used along with this form
of explicit querying in order to maximize performance. Apart
from explicit queries a thesaurus [16] is also maintained at the
MainServer(shown in figure 5). This is updated periodically
and also by explicit messages from hosts regarding their
schema changes. The central thesaurus is however a central
point of failure and this hinders our distributed approach.
However it is possible to replicate the thesaurus at various
hosts, moreover the additional feature of explicit queries
eradicates the central point of failure. The thesaurus can be
used when a transaction is to span numerous sites and by a
single message to the thesaurus it is possible to get information
about the different schema present on the entire system. This
can be extremely effective in decreasing the network
congestion and transaction generation time and eventually its
round trip execution time.
Apart from transactions the mobile hosts also move around
the network. The result of which is that the MH may show up
anywhere on the network under any BH. It is the responsibility
of the BH to recognize this MH and register it by contacting its
previous region’s BH[17]. When a mobile entity moves to a
new region, it must be assigned a new IP[18]. In fact any
change in the attachment point of a MH should be completely
transparent to the protocols and applications running on the
stationary hosts. Any mobile communication framework can
handle this mobility of a client. We have used the PMADE [17]
framework for this purpose. The ‘OPTIMISM” model
effectively deals with movement both of the MH and
transactions. It is possible for an MH on the move to generate
transactions that need to be distributed at other nodes in other
regions. A unique naming scheme based on Figure 4 is used to
identify the transactions and results coming in from other nodes
effectively. The PMADE framework ensures delivery of
messages to the designated MHs even if they move to other
regions by suitably maintaining system state information and
adding appropriate message headers for re-routing of message
packets.
Frequent disconnection is also effectively handled (the
problem arises since wireless networks are at best sporadic).
The user may continue to work on the local copy of the
database, while global transactions to be submitted or results of
previous global transactions are simply queued and sent of to
their respective destinations as soon a network connection is
available. Thus work queues are maintained and due
consideration is also given to make minimum use of broadcasts
to save battery power.
D.1 Transaction Coordinator
The transaction coordinator is responsible for managing the
various transactions on a node. It is designed to distinguish the
sub-transactions from one another and sort out the incoming
results. It often adds or retracts the necessary information
to/from the outgoing/incoming message stream to effectively
manage the various global and local transactions.
D.2 Transaction and Query Manager
This part of the transaction processing system is responsible for
the actual execution of queries at a node. It is in effect the
interface to the underlying database. It deals with the execution
of a scheduler-selected transaction.
MH
MH
GLOBAL THESAURUS
maintains
universal
schema sets
Local
Database
Thesaurus
queries or
automatic
updates
Thesaurus reply:
172.16.3.2
!#
@table_44$varchar$
integer@
@table_45$integer$
integer$
varchar@
#!
Cache
TPS
Local
Database
TPS
Cache
Direct query
to node
Schema Query Reply:
!#
@Account_Info$varchar$
integer$integer@
#!
Figure 5. Managing Heterogeneity of Databases, support for different
schema sets
D.3 Concurrency Manager
Probably the most essential part of the design is the
concurrency manager. It is the main arm responsible for
transaction concurrency while maintaining isolation and
consistency. It is designed with deadlock prevention (soon to be
integrated with a full fledged detection and resolution
algorithm) in mind and keeps the system in a safe state so as to
avoid degradation of system performance. Stable storage logs
and database information is also controlled through the
concurrency manager. All information is subject to locks and
may only be accessed on a rotational basis.
The resource that all transactions compete for is the
underlying database. The concurrency manager resolves the
simultaneous work of many transactions by keeping in mind a
number of factors particularly kind of transaction, etc.
maintaining queues and executing transactions in parallel.
Local transactions are however given preference over global
transactions; this again is consistent with the notion of local
autonomy.

Love soldier

2008-09-14T22:00:00.000-07:00

Melinda looked at her self in the mirror and she could not recognize the person she saw. A frail woman with deep sunken eyes, too petite for her long oversized clothes with tiny sprouts of prickly hair, stared back at her. Tears welled up in her eyes and started their usual course down her bony cheek.

Her thoughts darted back to the gorgeous woman who used to look back at her and greet her with a million dollar smile, every time she looked into the mirror. The Mirror woman, she knew, was a college beauty queen, full of confidence and exuberance. Her lovely face with golden curls dangling on her rosy cheeks caused many a heart to flutter. That was when she first met Alex, the man of her dreams. They have been a couple ever since and now they dreamed of growing old together.

As Alex came to her mind, Melinda felt an excruciating pain stab her heart.

‘I can’t do this to Alex! He deserves better. I can’t let him waste away his life because of me’ she thought.

Alex was a man any girl would dream of having as her husband.Charming, elegant and successful, he stood by Melinda all through the ordeal...The ordeal of having Mastectomy and then the Six weeks of Chemotherapy that she had to undergo. The last One year was emotionally draining for Melinda. She still remembers the day when she went to the Cancer Hospital with Alex for the Biopsy report of the lump that she accidentally found in her breast. Their fears came true and she was diagnosed with Breast cancer that was eating away into the tissues and the doctors told her that she needed to undergo the entire breast removal or Mastectomy.

Melinda sat their petrified in the doctor’s chambers. All her dreams came shattering down like a pack of cards .Alex gave her a hug and told her that he would be there for her and that they would fight Cancer together.

The Mastectomy left a scar across her chest and the grueling chemotherapy of six weeks that followed the surgery left her hairless, weak and the gloomy fear that she might not be able to become a mother ever as the Chemotherapy causes fertility issues and early onset of menopause.

As her worrying thoughts engulfed her, Alex stepped into the room with his usual sunshine smile and a bouquet of fresh flowers and his shining completely bald head, which he sported to support Melinda.

‘How is my beautiful princess doing today?’ he asked giving her a kiss.

‘Alex, don’t call me beautiful! I am not whom you fell in love with!’ said Melinda with pain.

Alex stood there disturbed looking at Melinda.

‘I can’t do this to you Alex! I think we should break our relationship. You know what cancer has done to me...dont you? You deserve someone gorgeous...some one who will raise a family with you…You deserve the best Alex!’ said Melinda controlling her tears...

‘No!…Don’t you ever say this to me!!’ said Alex looking aghast.

Melinda exposed her uneven chest with a large scar on it and said, “now ...tell me...Do I still look beautiful to you?…Like the Gorgeous Melinda you fell in love with?’

Tears welled up in Alex’s eyes as he came up to her and covered her with his embrace.

‘You know, what that scar reminds me of? The scar reminds me of how hard you fought cancer for our love. How hard you fought this battle for US and our dream of growing old together…You are my LOVE SOLDIER. And you won the battle. And you know what? You not only the most beautiful woman in the world but also the bravest!’ said Alex in a choked voice with tears now coursing down his cheeks.

‘Now, Will you marry me my beautiful Love soldier?’ Alex asked with a smile.

Melinda stood transfixed and was unable to speak. Bursting into a cascade of tears she embraced Alex saying,’ with you by my side in the journey of life, I know I can fight any number of battles and come out victorious! I’m Your Love soldier till death do us part!!!’

Grandma's magic potions

2008-09-14T21:54:00.000-07:00

Grandma's magic potions

My sweet granny was an enthusiastic lady.Married early, in the long gone days of Child marriages,she could study only up to the 5th grade but her zeal to acquire knowledge,be financially independent like a today’s woman and help others like her grandpa drove her to make ‘magic potions’As a young girl she often saw her grandpa make potions that healed many and quickly learnt how to recognize forest herbs and from then on till her last days she made remarkable curatives.Be it a medicine for a tummy ache or herbal oil to make your hair grow lustrous and long,she made them all.Granny had great memory and would often go to the nearby woods taking me along and got me acquainted to the world of herbs.

"Look!! that’s a brahmi..good for the hair and brain

That’s the neela herb!!…this is Naga bala and this is vidarikanda.for strength and skin glow"..she pointed them out to me.

She meticulously collected the exotic herbs and grew some in our garden too .Some she would buy from the local Herb store and then add,mix,boil,strain..she would make her magic potions and oils.These potions actually worked wonders and she soon had a good number of people buying her granny hair oil though it failed to grow hair on baldies
I remember once when a centipede bit me on my leg ‘ouch’in the middle of the night .With no docs available at that time,my granny came to the rescue.She mixed and boiled some ‘magic potion’ and uttered a few mantras into it.she then made me drink it.After that she brought a candle near the bite and made it feel the warmth of the candle…continuously uttering the divine mantras…and lo presto!!! I could see some liquid bubbling out of the bite…
That’s the poison..its come out and now you will be ok’,she said…and yes I was!!

Sometimes her remedies made me roll in laughter like the one in which a lady came to her complaining of her flat chest and she told granny that she wanted a bootylicious figure,

Well…granny never says NO to anyone..so she got to work peering through her ancient herbal books ,collecting herbs…mix,boil and then the ‘magic potion’ was ready…of course it didn’t work but atleast she tried!

Be it stories about the Bharadwaj bird that supposedly has the sanjeevani booti of youth in her nest or the leaves that help turn metal into gold..she told them with such conviction that I actually believed them..may be they really exist…

The Flower that taught me-never lose HOPE.

2008-09-14T21:52:00.000-07:00

One day I noticed a tiny plant that was feeding on the moist walls of a deep dark well. An iron mesh covered the mouth of the well and the plant was trapped and I felt pity for it.

A few days later I noticed that the plant bloomed a lovely yellow flower and felt even more bad for it as the flower was a part of a covered well and it would never feel the entire warmth of the sun or the kiss of a butterfly….it’s beauty trapped and it’s existence unknown to the beautiful world outside….a hopeless condition....one of nature’s lovely creations that was wasting away in a deep well..
A few days later I was stunned to see the tiny plant emerge out of the deep dark well...out of the mesh and bloom it’s lovely yellow flower for the nature to see.

It smiled at me and seemed to tell me,

‘I made it...You were wrong!!!’

That day the Spirit of the tiny flower taught me that-

Even if you are in the deepest and darkest conditions of your life and things look hopeless,never lose HOPE.

Even if the world says you won’t make it...don’t listen.

Even if obstacles and meshes block your progress, never stop…Keep growing till you reach your goal…You will find your way out eventually!

If so much will and strength is hidden in a tiny flower,what can you say about the colossal Human spirit?

So Friends, Never Give up and Keep growing…You will be surprised at the enormous potential that is sequestrated in you...Awaken your Human spirit!!!

Clever Maths

2008-09-12T23:29:00.000-07:00

Clever Maths

Long ago, a mathematician used to cheat people. Once
he borrowed
Rs.4000/- from a rich man. After a few days, he
borrowed Rs.2000/- from the same man.

Many days passed, the mathematician did not return the
money to the rich man. The rich man went to the
mathematician and asked to return the money.

But to his great surprise, the mathematician replied
that there is no
need to pay the debt.

"See here, friend" said the mathematician " the sum of
4000 and 2000 is equal to
zero, so I do not have any balance to pay".

The rich man took the matter to the court. When the
judge came to know
this, he was astonished. He asked the mathematician to
prove that sum of 4000 and 2000 is zero, and not 6000.

The Clever mathematician agreed. He said:

let a == 4000, b == 2000 and

a + b == c

Multiply both sides by a + b

(a + b) (a + b ) == c (a + b)

a*a + ab + ba + b*b == ca + cb

a*a + ab - ca == cb - b*b - ba

a( a + b -c) == -b(b + a - c)

so a == - b

a + b == 0

Hence 4000 + 2000 = 0........... .

coincidence

2008-09-12T23:23:00.000-07:00

Scary coincidence or careful planning

This is actually really freaky!! (Mainly the end part, but read it all first)

1) New York City has 11 letters
2) Afghanistan has 11 letters.
3) Ramsin Yuseb (The terrorist who threatened to destroy the Twin Towers in 1993) has 11 letters.
4) George W Bush has 11 letters.

This could be a mere coincidence, but this gets more interesting:
1) New York is the 11th state.
2) The first plane crashing against the Twin Towers was flight number 11.
3) Flight 11 was carrying 92 passengers. 9 + 2 = 11
4) Flight 77 which also hit Twin Towers, was carrying 65 passengers. 6+5 = 11
5) The tragedy was on September 11, or 9/11 as it is now known. 9 + 1+ 1 = 11
6) The date is equal to the US emergency services telephone number 911. 9 +1 + 1 = 11

Sheer coincidence..?! Read on and make up your own mind:
1) The total number of victims inside all the hi-jacked planes was 254. 2 + 5 + 4 = 11.
2) September 11 is day number 254 of the calendar year. Again 2 + 5 + 4 = 11.
3) The Madrid bombing took place on 3/11/2004. 3 + 1 + 1 + 2 + 4 = 11.
4) The tragedy of Madrid happened 911 days after the Twin Towers incident.

Now this is where things get totally eerie:
The most recognized symbol for the US, after the Stars & Stripes, is the Eagle. The following verse is taken from the Quran, the Islamic holy book:
"For it is written that a son of Arabia would awaken a fearsome Eagle. The wrath of the Eagle would be felt throughout the lands of Allah while some of the people trembled in despair still more rejoiced: for the wrath of the Eagle cleansed the lands of Allah and there was peace."
That verse is number 9.11 of the Quran.
Unconvinced about all of this still ..?!
Try this and see how you feel
afterwards, it made my hair stand on end:
Open Microsoft Word and do the following:
1. Type in capitals Q33 NY. This is the flight number of the first plane to hit one of the Twin Towers.
*
2. Highlight the Q33 NY.
3. Change the font size to 48.
4. Change the actual font to the WINGDINGS

The Mechanics of love- Why do we love those we do?

2008-09-12T23:19:00.000-07:00

For eons this illusive emotion called love has held the human race spell bound with its magical charm. The thinkers among us have long tried to find the answers to why we love the people we do, with varying degrees of success. However, the one thing that we are absolutely sure about is that it is not Cupid’s doing. Unless of course he has kept abreast of the latest medical research and decided to dip his arrows in phenyl ethylamine before shooting them.

Scientists have also done extensive research on love. They have discovered what they describe as a love map in the human brain. According to them it is these “love maps” that determine our choice of partners and also the kind of relationship we have.

The foundation for this map is laid down in early childhood, as the human brain records in great detail an individuals experiences and preferences. You will be surprised to know that the most minute (and sometimes considered insignificant) details are stored. For instance the kinds of details stored are information like hair colour, physique, gait, eye colour, personality type. We are attracted to people who fit into this mental image. It is believed that a human child has a clear idea of the kind of mate he would desire by the time he is eight years old.

Since our parents were the first loves of our lives, our relationship with them is the first influence on our love map. The mother’s relationship with her children has greater impact on the child’s love map as she spends a lot of time with them. This is especially true in the case of a male child as, his relationship with his mother will determine his ideas about and relationship with women. If the relationship is warm and friendly, the boy will grow up to be a caring and responsible partner. Instability in the mother son relationship results in a feeling of insecurity. This in turn can get manifested as a permanent fear of commitment, low self-esteem and a persistent feeling of not being appreciated enough.

Similarly, a father’s relationship with his daughter influences her general feelings about men and to some extent about herself. A loving and caring father gives his daughter the gift of unquestionable self-worth. On the other hand a cold and critical father or the absence of a father adversely impacts the self confidence of the child.

One look at the matrimonial column gives an impression that the looks of a person is of the first things that is taken into consideration when trying to find a mate (by either sexes). The science of falling in love however negates this. According to research findings intelligence and kindness play a very important role in our choices , with the latter gaining priority over the former.

When looking for a marriage partner our choices are guided by two factors- social similarities and complementary needs. For instance a very conservative person is attracted to a person with a more liberal mentality from a similar social background.

The love map also influences the physical choice of the person. Now the question may arise that if every person is equipped with this all seemingly flawless choice enabler known as the love map, the why do people have to deal with painful situations such as divorce and separation. Well, there are a couple of logical reason for this. Firstly, besides the love map our choice of mate is guided by other factors such as social and financial status. Secondly, love needs to be nurtured even when the best choices are made. The minute it is taken for granted weeds begin to grow around it. So, take care of love and watch it blossom!

Note: This is not my original piece. This nice article was available on net which I am sharing with you all.

Hanuman Chalisa

2008-09-12T23:16:00.001-07:00

Hanuman Chalisa

JAI HANUMAN GYAN GUN SAGAR JAI KAPISH TUHI LOK UJAGAR"

Shree Guru Charan Saroj Raj, Nij Man Mukar Sudhari,
Barnau Raghuvar Bimal Jasu, Jo dayaku Phal Chari

With the dust of Guru's Lotus feet, I clean the mirror of my mind and then
narrate the sacred glory of Sri Ram Chandra, The Supereme among the Raghu
dynasty. The giver of the four attainments of life.

Budhi heen Tanu Janike, Sumirow, Pavan Kumar,
Bal Buddhi Vidya Dehu Mohi, Harahu Kalesh Bikaar

Knowing myself to be ignorent, I urge you, O Hanuman, The son of Pavan! O
Lord! kindly Bestow on me strength, wisdom and knowledge, removing all my
miseries and blemishes.

Jai Hanuman Gyan Guna Sagar
Jai Kipis Tihun Lok Ujgaar

Victory of Thee, O Hanuman, Ocean of wisdom and virtue, victory to the Lord of
monkeys who is well known in all the three worlds

Ramdoot Atulit Bal Dhamaa,
Anjani Putra Pavansut naamaa.

You, the Divine messager of Ram and repository of immeasurable strength, are also
known as Anjaniputra and known as the son of the wind - Pavanputra.

Mahebeer Bikram Bajrangi,
Kumati Nivaar Sumati Ke Sangi.

Oh Hanumanji! You are valiant and brave, with a body like lightening. You are the
dispeller of darkness of evil thoughts and companion of good sense and wisdom.

Kanchan Baran Biraaj Subesaa,
Kanan kundal kunchit kesa.

Shri Hanumanji's physique is golden coloured. His dress is pretty, wearing
'Kundals' ear-rings and his hairs are long and curly.

Hath Bajra Aur Dhvaja Birjai,
Kandhe Moonj Janeu saage.

Shri Hanumanji is holding in one hand a lighting bolt and in the other a banner
with sacred thread across his shoulder.

Shankar Suvna Kesari Nandan,
Tej Pratap Maha Jag Vandan.

Oh Hanumanji! You are the emanation of 'SHIVA' and you delight Shri Keshri.
Being ever effulgent, you and hold vast sway over the universe. The entire
world proptiates. You are adorable of all.

Vidyavaan Guni Ati Chatur,
Ram Kaj Karibe Ko Atur

Oh! Shri Hanumanji! You are the repository learning, virtuous, very wise and
highly keen to do the work of Shri Ram,
Prabhu Charittra Sunibe Ko Rasiya,
Ram Lakhan Sita man basyia.

You are intensely greedy for listening to the naration of Lord Ram's lifestory and
revel on its enjoyment. You ever dwell in the hearts of Shri Ram-Sita and Shri
Lakshman.
Sukshma roop Dhari Siyahi Dikhwana,
Bikat roop Dhari Lank Jarawa

You appeared beofre Sita in a diminutive form and spoke to her, while you
assumed an awesome form and struck terror by setting Lanka on fire.

Bhim roop Dhari Asur Sanhare,
Ramchandra Ke kaaj Savare.

He, with his terrible form, killed demons in Lanka and performed all acts of Shri
Ram.
Laye Sajivan Lakhan Jiyaye,
Shri Raghubir harashi ur laye.

When Hanumanji made Lakshman alive after bringing 'Sanjivni herb' Shri Ram
took him in his deep embrace, his heart full of joy.

Raghupati Kinhi Bahut Badaai,
Tum Mama Priya Bharat Sam Bahi.

Shri Ram lustily extolled Hanumanji's excellence and remarked, "you are as dear
to me as my own brother Bharat"

Sahastra Badan Tumharo Jas Gaave,
Asa kahi Shripati Kanth Laagave.

Shri Ram embraced Hanumanji saying:
"Let the thousand - tongued sheshnaag sing your glories"

Sankadik Brahmadi Muneesa,
Narad Sarad Sahit Aheesa

Sanak and the sages, saints. Lord Brahma, the great hermits Narad and
Goddess Saraswati along with Sheshnag the cosmic serpent, fail to sing the
glories of Hanumanji exactly

Jam Kuber Digpal Jahan Te,
Kabi Kabid Kahin Sake Kahan Te

What to talk of denizens of the earth like poets and scholars ones etc even Gods
like Yamraj, Kuber, and Digpal fail to narrate Hanman's greatness in toto.

Tum Upkar Sugrivahi Keenha,
Ram Miali Rajpad Deenha

Hanumanji! You rendered a great service for Sugriva, It were you who united
him with SHRI RAM and installed him on the Royal Throne.

Tumharo Mantro Bibhishan Maana,
Lankeshwar Bhaye Sab Jag Jaana.

By heeding your advice. Vibhushan became Lord of Lanka, which is known all
over the universe.

Juug Sahastra Jojan Par Bhaanu,
Leelyo Taahi Madhur Phal Jaanu

Hanumanji gulped, the SUN at distance of sixteen thousand miles considering
it to be a sweet fruit.

Prabhu Mudrika Meli Mukha Maaheen,
Jaladhi Langhi Gaye Acharaj Naheen.

Carrying the Lord's ring in his mouth, he went across the ocean. There is no
wonder in that.

Durgam Kaaj Jagat Ke Jeete,
Sugam Anugrah Tumhre Te Te.

Oh Hanumanji! all the difficult tasks in the world are rendered easiest by your
grace.
Ram Duware Tum Rakhavare,
Hot Na Aagya Bin Paisare.

Oh Hanumanji! You are the sentinel at the door of Ram's mercy mansion or His
divine abode. No one may enter without your permission.

Sab Sukh Lahen Tumhari Sarna,
Tum Rakshak Kaahu Ko Darnaa.

By your grace one can enjoy all happiness and one need not have any fear under
your protection.

Aapan Tej Samharo Aapei,
Tanau Lok Hank Te Kanpei

When you roar all the three worlds tremble and only you can control your might.

Bhoot Pisaach Nikat Nahi Avei,
Mahabir Jab Naam Sunavei.

Great Brave on. Hanumanji's name keeps all the Ghosts, Demons & evils spirits
away from his devotees.

Nasei Rog Hare Sab Peera,
Japat Niranter Hanumant Beera

On reciting Hanumanji's holy name regularly all the maladies perish the entire
pain disappears.

Sankat Te Hanuman Chhudavei,
Man Kram Bachan Dhyan Jo Lavei.

Those who rembember Hanumanji in thought, word and deed are well guarded
against their odds in life.

Sub Par Ram Tapasvee Raaja,
Tinke Kaaj Sakal Tum Saaja

Oh Hanumanji! You are the caretaker of even Lord Rama, who has been hailed as
the Supreme Lord and the Monarch of all those devoted in penances.

Aur Manorath Jo Koi Lave,
Soi Amit Jivan Phal Pave.

Oh Hanumanji! You fulfill the desires of those who come to you and bestow
the eternal nectar the highest fruit of life.

Charo Juung Partap = Tumhara,
Hai Parsiddha Jagat Ujiyara.

Oh Hanumanji! You magnificent glory is acclaimed far and wide all through the
four ages and your fame is radianlty noted all over the cosmos.

Sadho Sant Ke Tum Rakhvare,
Asur Nikandan Ram Dulare.

Oh Hanumanji! You are the saviour and the guardian angel of saints and sages
and destroy all the Demons, you are the seraphic darling of Shri Ram.

Ashta Siddhi Nau Nidhi Ke Data,
Asa Bar Din Janki Mata.

Hanumanji has been blessed with mother Janki to grant to any one any YOGIC
power of eight Sidhis and Nava Nidhis as per choice.

Ram Rasayan Tumhare Pasa,
Sadaa Raho Raghupati Ke Dasa.

Oh Hanumanji! You hold the essence of devotion to RAM, always remaining His
Servant.

Tumhare Bhajan Ramko Pavei.
Janam Janam Ke Dukh Bisravei.

Oh Hanumanji! through devotion to you, one comes to RAM and becames free
from suffering of several lives.

Anta Kaal Raghubar Pur Jai,
Jahan Janma Hari Bhakta Kahai.

After death he enters the eternal abode of Sri Ram and remains a devotee of
him, whenever, taking new birth on earth.

Aur Devata Chitt Na Dharai,
Hanumant Sei Sarva Sukh Karai

You need not hold any other demigod in mind. Hanumanji alone will give all
happiness.

Sankat Kate Mitey Sab Peera,
Jo Sumirei Hanumant Balbeera

Oh Powerful Hanumanji! You end the sufferings and remove all the pain from
those who remember you.

Jai Jai Jai Hanuman Gosai
Kripa Karahu Gurudev Ki Naiee

Hail-Hail-Hail-Lord Hanumanji! I beseech you Honour to bless me in the
capacity of my supreme 'GURU' (teacher).

Jo Sat Baar Paath Kar Koi,
Chhutahi Bandi Maha Sukh Hoi.

One who recites this Hanuman Chalisa one hundred times daily for one hundred
days becames free from the bondage of life and death and ejoys the highest
bliss at last.

Jo Yah Padhe Hanuman Chalisa,
Hoy Siddhi Sakhi Gaurisa

As Lord Shankar witnesses, all those who recite Hanuman Chalisa regularly are
sure to be benedicted

Tulsidas Sada Hari Chera,
Keeje Nath Hriday Mah Dera.

Tulsidas always the servant of Lord prays. "Oh my Lord! You enshrine within my
heart.!

Chopai

Pavan Tanay Sankat Haran, Mangal Murti Roop.
Ram Lakhan Sita Sahit, Hriday Basahu Sur Bhoop.

O Shri Hanuman, The Son of Pavan, Saviour The Embodiment of
blessings, reside in my heart together with Shri Ram, Laxman and Sita

Once upon a time....

2008-09-12T23:06:00.000-07:00

Once upon a time....

There was a rich King who had 4 wives.
He loved the 4th wife the most and adorned her with rich robes and treated her to the finest of delicacies. He gave her nothing but the best.

He also loved the 3rd wife very much and was always showing her off to neighboring kingdoms. However, he feared that one day she would leave him for another.

He also loved his 2nd wife. She was his confidante and was always kind, considerate and patient with him. Whenever the King faced a problem, he could confide in her to help him get through the difficult times
The King's 1st wife was a very loyal partner and had made great contributions in maintaining his wealth and kingdom. However, he did not love the first wife and although she loved him deeply, he hardly took notice of her.

One day, the King fell ill and he knew his time was short.
He thought of his luxurious life and pondered, "I now have 4 wives with me, but when I die, I'll be all alone.

Thus, he asked the 4th wife, "I have loved you the most, endowed you with the finest clothing and showered great care over you. Now that I'm dying, will you follow me and keep me company?"

"No way!" replied the 4th wife and she walked away without another word.

Her answer cut like a sharp knife right into his heart.

The sad King then asked the 3rd wife, "I have loved you all my life. Now that I'm dying, will you follow me and keep me company?"

"No!" replied the 3rd wife. "Life is too good!
When you die, I'm going to remarry!"

His heart sank and turned cold.

He then asked the 2nd wife, "I have always turned to you for help and you've always been there for me. When I die, will you follow me? And keep me company?"

"I'm sorry, I can't help you out this time!" replied the 2nd wife. "At the very most, I can only send you to your grave."

Her answer came like a bolt of thunder and the King was devastated.

Then a voice called out:

"I'll leave with you and follow you no matter where you go." The King looked up and there was his first wife. She was so skinny, she suffered from malnutrition.

Greatly grieved, the King said, "I should have taken much better care of you when I had the chance!"

In Truth, we all have 4 wives in our lives ...

Our 4th wife is our body. No matter how much time and effort we lavish in making it look good, it'll leave us when we die.

Our 3rd wife is our possessions, status and wealth.
When we die, it will all go to others.

Our 2nd wife is ourfriends. No matter how much they have been there for us, the furthest they can stay by us is up to the grave.

And our 1st wife is our Parents,

Often neglected in pursuit of wealth, power and pleasures of the ego. However, our Parents are the only thing that will follow us and guide wherever we go.

So Love them at our best ..... They need and Love you most!!!
You are their greatest gift

Let them Smile and cherish...

ICE

2008-09-12T23:05:00.000-07:00

ICE

Recently, the concept of "ICE" is catching up quickly. It is simple, yet an important method of contact during emergency situations.

As cell phones are carried by majority of the population, all you need to do is store the number of a contact person or persons who should be contacted at during emergency as "ICE" (meaning In Case of Emergency).

The idea was thought up by a paramedic who found that when they went to the scenes of accidents, there were always mobile phones with patients, but they didn't know which numbers to call.

He therefore thought that it would be a good idea if there was a nationally recognized name for this purpose.

Following a disaster in London, the East Anglican Ambulance Service has launched a national "In case of Emergency (ICE)" campaign.

In an emergency situation, Emergency Services personnel and hospital staff would then be able to quickly contact your next of kin, by simply dialing the number stored as "ICE".

Please forward this. It won't take too many "forwards" before everybody will know about this.

It really could save your life, or put a loved one's mind at rest.

For more than one contact name simply enter ICE1, ICE2 and ICE3 etc. A great idea that will make a difference !

CELLPHONE COULD DO

2008-09-12T23:02:00.002-07:00

THINGS YOU NEVER KNEW YOUR CELLPHONE COULD DO

There are a few things that can be done in times of grave emergencies.

Your mobile phone can actually be a life saver or an emergency tool for

survival. Check out the things that you can do with it: -

1

EMERGENCY

* The Emergency Number worldwide for **Mobile** is 112 ...* If you find

yourself out of coverage area of your mobile network and there is an

emergency, dial 112 and the mobile will search any existing network to

establish the emergency number for you, and interestingly this number 112

can be dialed even if the keypad is locked. **Try it out.**

2

Have you locked your keys in the car? Does you car have remote keysThis may come in handy someday. Good reason to own a cell phone:

If you lock your keys in the car and the spare keys are at home, call

someone at home on their cell phone from your cell phone.

Hold your cell phone about a foot from your car door and have the person

at your home press the unlock button, holding it near the mobile phone on

their end. Your car will unlock. Saves someone from having to drive your

keys to you. Distance is no object. You could be hundreds of miles away,

and if you can reach someone who has the other "remote" for your car, you

can unlock the doors (or the trunk).

Editor's Note: *It works fine! We tried it out and it unlocked our car over a cell phone!"*
3

Hidden Battery power
Imagine your cell battery is very low , you are expecting an important call

and you don't have a charger. Nokia instrument comes with a reserve

battery. To activate, press the keys *3370# Your cell will restart with

this reserve and the instrument will show a 50% increase in battery. This

reserve will get charged when you charge your cell next time.

AND

4

How to disable a STOLEN mobile phone?

To check your Mobile phone's serial number, key in the following digits on your phone:

* # 0 6 #

A 15 digit code will appear on the screen. This number is unique to your

handset. Write it down and keep it somewhere safe. when your phone get

stolen, you can phone your service provider and give them this code. They

will then be able to block your handset so even if the thief changes the

SIM card, your phone will be totally useless.

You probably won't get your phone back, but at least you know that whoever stole it can't use/sell it either.

If everybody does this, there would be no point in people stealing mobile phones.

HOPE YOU ENJOY USING YOUR MOBILE

rearrange the letters:

2008-09-12T23:02:00.001-07:00

DILIP VENGSARKAR
When you rearrange the letters:
SPARKLING DRIVE

BARA THEDA
When you rearrange the letters:
ARAB DEATH

PRINCESS DIANA
When you rearrange the letters:
END IS A CAR SPIN

MONICA LEWINSKY
When you rearrange the letters:
NICE SILKY WOMAN

DORMITORY:
When you rearrange the letters:
DIRTY ROOM

PRESBYTERIAN:
When you rearrange the letters:
BEST IN PRAYER

ASTRONOMER:
When you rearrange the letters:
MOON STARER

DESPERATION: When you rearrange the letters:
A ROPE ENDS IT

THE EYES:
When you rearrange the letters:
THEY SEE

GEORGE BUSH:
When you rearrange the letters:
HE BUGS GORE

THE MORSE CODE :
When you rearrange the letters:
HERE COME DOTS

SLOT MACHINES:
When you rearrange the letters:
CASH LOST IN ME

ANIMOSITY:
When you rearrange the letters:
IS NO AMITY

ELECTION RESULTS:
When you rearrange the letters:
LIES - LET'S RECOUNT

SNOOZE ALARMS:
When you rearrange the letters:
ALAS! NO MORE Z 'S

A DECIMAL POINT:
When you rearrange the letters:
IM A DOT IN PLACE

THE EARTHQUAKES:
When you rearrange the letters:
THAT QUEER SHAKE

ELEVEN PLUS TWO:
When you rearrange the letters:
TWELVE PLUS ONE

AND FOR THE GRAND FINALE:

MOTHER-IN-LAW:
When you rearrange the letters:
WOMAN HITLER

arrays in java

2008-09-12T02:07:00.000-07:00

Arrays
An array is a group of like-typed variables that are referred to by a common name. Arrays
of any type can be created and may have one or more dimensions. A specific element in
an array is accessed by its index. Arrays offer a convenient means of grouping related
information.
Note If you are familiar with C/C++, be careful. Arrays in Java work differently than
they do in those languages.
One-Dimensional Arrays
A one-dimensional array is, essentially, a list of like-typed variables. To create an array,
you first must create an array variable of the desired type. The general form of a onedimensional
array declaration is
type var-name[ ];
Here, type declares the base type of the array. The base type determines the data type of
each element that comprises the array. Thus, the base type for the array determines
what type of data the array will hold. For example, the following declares an array named
month_days with the type "array of int":
int month_days[];
Although this declaration establishes the fact that month_days is an array variable, no
array actually exists. In fact, the value of month_days is set to null, which represents an
array with no value. To link month_days with an actual, physical array of integers, you
must allocate one using new and assign it to month_days. new is a special operator that
allocates memory.
You will look more closely at new in a later chapter, but you need to use it now to allocate
memory for arrays. The general form of new as it applies to one-dimensional arrays
appears as follows:
array-var = new type[size];
Here, type specifies the type of data being allocated, size specifies the number of
elements in the array, and array-var is the array variable that is linked to the array. That
is, to use new to allocate an array, you must specify the type and number of elements to
allocate. The elements in the array allocated by new will automatically be initialized to
zero. This example allocates a 12-element array of integers and links them to
month_days.
month_days = new int[12];
After this statement executes, month_days will refer to an array of 12 integers. Further,
all elements in the array will be initialized to zero.
Let's review: Obtaining an array is a two-step process. First, you must declare a variable
of the desired array type. Second, you must allocate the memory that will hold the array,
using new, and assign it to the array variable. Thus, in Java all arrays are dynamically
allocated. If the concept of dynamic allocation is unfamiliar to you, don't worry. It will be
described at length later in this book.
Once you have allocated an array, you can access a specific element in the array by
specifying its index within square brackets. All array indexes start at zero. For example,
this statement assigns the value 28 to the second element of month_days.
month_days[1] = 28;
The next line displays the value stored at index 3.
System.out.println(month_days[3]);
Putting together all the pieces, here is a program that creates an array of the number of
days in each month.
// Demonstrate a one-dimensional array.
class Array {
public static void main(String args[]) {
int month_days[];
month_days = new int[12];
month_days[0] = 31;
month_days[1] = 28;
month_days[2] = 31;
month_days[3] = 30;
month_days[4] = 31;
month_days[5] = 30;
month_days[6] = 31;
month_days[7] = 31;
month_days[8] = 30;
month_days[9] = 31;
month_days[10] = 30;
month_days[11] = 31;
System.out.println("April has " + month_days[3] + " days.");
}
}
When you run this program, it prints the number of days in April. As mentioned, Java
array indexes start with zero, so the number of days in April is month_days[3] or 30.
It is possible to combine the declaration of the array variable with the allocation of the
array itself, as shown here:
int month_days[] = new int[12];
This is the way that you will normally see it done in professionally written Java programs.
Arrays can be initialized when they are declared. The process is much the same as that
used to initialize the simple types. An array initializer is a list of comma-separated
expressions surrounded by curly braces. The commas separate the values of the array
elements. The array will automatically be created large enough to hold the number of
elements you specify in the array initializer. There is no need to use new. For example, to
store the number of days in each month, the following code creates an initialized array of
integers:
// An improved version of the previous program.
class AutoArray {
public static void main(String args[]) {
int month_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,
30, 31 };
System.out.println("April has " + month_days[3] + " days.");
}
}
When you run this program, you see the same output as that generated by the previous
version.
Java strictly checks to make sure you do not accidentally try to store or reference values
outside of the range of the array. The Java run-time system will check to be sure that all
array indexes are in the correct range. (In this regard, Java is fundamentally different
from C/C++, which provide no run-time boundary checks.) For example, the run-time
system will check the value of each index into month_days to make sure that it is
between 0 and 11 inclusive. If you try to access elements outside the range of the array
(negative numbers or numbers greater than the length of the array), you will cause a runtime
error.
Here is one more example that uses a one-dimensional array. It finds the average of a
set of numbers.
// Average an array of values.
fclass Average {
public static void main(String args[]) {
double nums[] = {10.1, 11.2, 12.3, 13.4, 14.5};
double result = 0;
int i;
for(i=0; i<5; i++)
result = result + nums[i];
System.out.println("Average is " + result / 5);
}
}
Multidimensional Arrays
In Java, multidimensional arrays are actually arrays of arrays. These, as you might
expect, look and act like regular multidimensional arrays. However, as you will see, there
are a couple of subtle differences. To declare a multidimensional array variable, specify
each additional index using another set of square brackets. For example, the following
declares a two-dimensional array variable called twoD.
int twoD[][] = new int[4][5];
This allocates a 4 by 5 array and assigns it to twoD. Internally this matrix is implemented
as an array of arrays of int. Conceptually, this array will look like the one shown in Figure
The following program numbers each element in the array from left to right, top to bottom,
and then displays these values:
// Demonstrate a two-dimensional array.
class TwoDArray {
public static void main(String args[]) {
int twoD[][]= new int[4][5];
int i, j, k = 0;
for(i=0; i<4; i++)
for(j=0; j<5; j++) {
twoD[i][j] = k;
k++;
}
for(i=0; i<4; i++) {
for(j=0; j<5; j++)
System.out.print(twoD[i][j] + " ");
System.out.println();
}
}
}
This program generates the following output:
0 1 2 3 4
5 6 7 8 9
10 11 12 13 14
15 16 17 18 19
When you allocate memory for a multidimensional array, you need only specify the
memory for the first (leftmost) dimension. You can allocate the remaining dimensions
separately. For example, this following code allocates memory for the first dimension of
twoD when it is declared. It allocates the second dimension manually.
int twoD[][] = new int[4][];
twoD[0] = new int[5];
twoD[1] = new int[5];
twoD[2] = new int[5];
twoD[3] = new int[5];
While there is no advantage to individually allocating the second dimension arrays in this
situation, there may be in others. For example, when you allocate dimensions manually,
you do not need to allocate the same number of elements for each dimension. As stated
earlier, since multidimensional arrays are actually arrays of arrays, the length of each
array is under your control. For example, the following program creates a twodimensional
array in which the sizes of the second dimension are unequal.
// Manually allocate differing size second dimensions.
class TwoDAgain {
public static void main(String args[]) {
int twoD[][] = new int[4][];
twoD[0] = new int[1];
twoD[1] = new int[2];
twoD[2] = new int[3];
twoD[3] = new int[4];
int i, j, k = 0;
for(i=0; i<4; i++)
for(j=0; jtwoD[i][j] = k;
k++;
}
for(i=0; i<4; i++) {
for(j=0; jSystem.out.print(twoD[i][j] + " ");
System.out.println();
}
}
}
This program generates the following output:
0
1 2
3 4 5
6 7 8 9
The array created by this program looks like this:
The use of uneven (or, irregular) multidimensional arrays is not recommended for most
applications, because it runs contrary to what people expect to find when a
multidimensional array is encountered. However, it can be used effectively in some
situations. For example, if you need a very large two-dimensional array that is sparsely
populated (that is, one in which not all of the elements will be used), then an irregular
array might be a perfect solution.
It is possible to initialize multidimensional arrays. To do so, simply enclose each
dimension's initializer within its own set of curly braces. The following program creates a
matrix where each element contains the product of the row and column indexes. Also
notice that you can use expressions as well as literal values inside of array initializers.
// Initialize a two-dimensional array.
class Matrix {
public static void main(String args[]) {
double m[][] = {
{ 0*0, 1*0, 2*0, 3*0 },
{ 0*1, 1*1, 2*1, 3*1 },
{ 0*2, 1*2, 2*2, 3*2 },
{ 0*3, 1*3, 2*3, 3*3 }
};
int i, j;
for(i=0; i<4; i++) {
for(j=0; j<4; j++)
System.out.print(m[i][j] + " ");
System.out.println();
}
}
}
When you run this program, you will get the following output:
0.0 0.0 0.0 0.0
0.0 1.0 2.0 3.0
0.0 2.0 4.0 6.0
0.0 3.0 6.0 9.0
As you can see, each row in the array is initialized as specified in the initialization lists.
Let's look at one more example that uses a multidimensional array. The following
program creates a 3 by 4 by 5, three-dimensional array. It then loads each element with
the product of its indexes. Finally, it displays these products.
// Demonstrate a three-dimensional array.
class threeDMatrix {
public static void main(String args[]) {
int threeD[][][] = new int[3][4][5];
int i, j, k;
for(i=0; i<3; i++)
for(j=0; j<4; j++)
for(k=0; k<5; k++)
threeD[i][j][k] = i * j * k;
for(i=0; i<3; i++) {
for(j=0; j<4; j++) {
for(k=0; k<5; k++)
System.out.print(threeD[i][j][k] + " ");
System.out.println();
}
System.out.println();
}
}
}
This program generates the following output:
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 1 2 3 4
0 2 4 6 8
0 3 6 9 12
0 0 0 0 0
0 2 4 6 8
0 4 8 12 16
0 6 12 18 24
Alternative Array Declaration Syntax
There is a second form that may be used to declare an array:
type[ ] var-name;
Here, the square brackets follow the type specifier, and not the name of the array
variable. For example, the following two declarations are equivalent:
int al[] = new int[3];
int[] a2 = new int[3];
The following declarations are also equivalent:
char twod1[][] = new char[3][4];
char[][] twod2 = new char[3][4];
This alternative declaration form is included mostly as a convenience.
A Few Words About Strings
As you may have noticed, in the preceding discussion of data types and arrays there has
been no mention of strings or a string data type. This is not because Java does not
support such a type—it does. It is just that Java's string type, called String, is not a
simple type. Nor is it simply an array of characters (as are strings in C/C++). Rather,
String defines an object, and a full description of it requires an understanding of several
object-related features. As such, it will be covered later in this book, after objects are
described. However, so that you can use simple strings in example programs, the
following brief introduction is in order.
The String type is used to declare string variables. You can also declare arrays of
strings. A quoted string constant can be assigned to a String variable. A variable of type
String can be assigned to another variable of type String. You can use an object of type
String as an argument to println( ). For example, consider the following fragment:
String str = "this is a test";
System.out.println(str);
Here, str is an object of type String. It is assigned the string "this is a test". This string is
displayed by the println( ) statement.
As you will see later, String objects have many special features and attributes that make
them quite powerful and easy to use. However, for the next few chapters, you will be using
them only in their simplest form.
A Note to C/C++ Programmers About Pointers
If you are an experienced C/C++ programmer, then you know that these languages provide
support for pointers. However, no mention of pointers has been made in this chapter. The
reason for this is simple: Java does not support or allow pointers. (Or more properly, Java
does not support pointers that can be accessed and/or modified by the programmer.) Java
cannot allow pointers, because doing so would allow Java applets to breach the firewall
between the Java execution environment and the host computer. (Remember, a pointer
can be given any address in memory—even addresses that might be outside the Java runtime
system.) Since C/C++ make extensive use of pointers, you might be thinking that their
loss is a significant disadvantage to Java. However, this is not true. Java is designed in
such a way that as long as you stay within the confines of the execution environment, you
will never need to use a pointer, nor would there be any benefit in using one. For tips on
converting C/C++ code to Java, including pointers, see Chapter 28.
The operands of the arithmetic operators must be of a numeric type. You cannot use
them on boolean types, but you can use them on char types, since the char type in Java
is, essentially, a subset of int.

java I unit

2008-09-06T03:10:00.000-07:00

Object-Oriented Programming
Object-oriented programming is at the core of Java. In fact, all Java programs are objectoriented
—this isn't an option the way that it is in C++, for example. OOP is so integral to
Java that you must understand its basic principles before you can write even simple Java
programs. Therefore, this chapter begins with a discussion of the theoretical aspects of
OOP.
Two Paradigms
As you know, all computer programs consist of two elements: code and data.
Furthermore, a program can be conceptually organized around its code or around its
data. That is, some programs are written around "what is happening" and others are
written around "who is being affected." These are the two paradigms that govern how a
program is constructed. The first way is called the process-oriented model. This approach
characterizes a program as a series of linear steps (that is, code). The process-oriented
model can be thought of as code acting on data. Procedural languages such as C employ
this model to considerable success. However, as mentioned in Chapter 1, problems with
this approach appear as programs grow larger and more complex.
To manage increasing complexity, the second approach, called object-oriented
programming, was conceived. Object-oriented programming organizes a program around
its data (that is, objects) and a set of well-defined interfaces to that data. An objectoriented
program can be characterized as data controlling access to code. As you will
see, by switching the controlling entity to data, you can achieve several organizational
benefits.
Abstraction
An essential element of object-oriented programming is abstraction. Humans manage
complexity through abstraction. For example, people do not think of a car as a set of tens
of thousands of individual parts. They think of it as a well-defined object with its own
unique behavior. This abstraction allows people to use a car to drive to the grocery store
without being overwhelmed by the complexity of the parts that form the car. They can
ignore the details of how the engine, transmission, and braking systems work. Instead
they are free to utilize the object as a whole.
A powerful way to manage abstraction is through the use of hierarchical classifications.
This allows you to layer the semantics of complex systems, breaking them into more
manageable pieces. From the outside, the car is a single object. Once inside, you see
that the car consists of several subsystems: steering, brakes, sound system, seat belts,
heating, cellular phone, and so on. In turn, each of these subsystems is made up of more
specialized units. For instance, the sound system consists of a radio, a CD player, and/or
a tape player. The point is that you manage the complexity of the car (or any other
complex system) through the use of hierarchical abstractions.
Hierarchical abstractions of complex systems can also be applied to computer programs.
The data from a traditional process-oriented program can be transformed by abstraction
into its component objects. A sequence of process steps can become a collection of
messages between these objects. Thus, each of these objects describes its own unique
behavior. You can treat these objects as concrete entities that respond to messages
telling them to do something. This is the essence of object-oriented programming.
Object-oriented concepts form the heart of Java just as they form the basis for human
understanding. It is important that you understand how these concepts translate into
programs. As you will see, object-oriented programming is a powerful and natural
paradigm for creating programs that survive the inevitable changes accompanying the life
cycle of any major software project, including conception, growth, and aging. For
example, once you have well-defined objects and clean, reliable interfaces to those
objects, you can gracefully decommission or replace parts of an older system without
fear.
The Three OOP Principles
All object-oriented programming languages provide mechanisms that help you implement
the object-oriented model. They are encapsulation, inheritance, and polymorphism. Let's
take a look at these concepts now.
Encapsulation
Encapsulation is the mechanism that binds together code and the data it manipulates,
and keeps both safe from outside interference and misuse. One way to think about
encapsulation is as a protective wrapper that prevents the code and data from being
arbitrarily accessed by other code defined outside the wrapper. Access to the code and
data inside the wrapper is tightly controlled through a well-defined interface. To relate this
to the real world, consider the automatic transmission on an automobile. It encapsulates
hundreds of bits of information about your engine, such as how much you are
accelerating, the pitch of the surface you are on, and the position of the shift lever. You,
as the user, have only one method of affecting this complex encapsulation: by moving the
gear-shift lever. You can't affect the transmission by using the turn signal or windshield
wipers, for example. Thus, the gear-shift lever is a well-defined (indeed, unique) interface
to the transmission. Further, what occurs inside the transmission does not affect objects
outside the transmission. For example, shifting gears does not turn on the headlights!
Because an automatic transmission is encapsulated, dozens of car manufacturers can
implement one in any way they please. However, from the driver's point of view, they all
work the same. This same idea can be applied to programming. The power of
encapsulated code is that everyone knows how to access it and thus can use it
regardless of the implementation details—and without fear of unexpected side effects.
In Java the basis of encapsulation is the class. Although the class will be examined in
great detail later in this book, the following brief discussion will be helpful now. A class
defines the structure and behavior (data and code) that will be shared by a set of objects.
Each object of a given class contains the structure and behavior defined by the class, as
if it were stamped out by a mold in the shape of the class. For this reason, objects are
sometimes referred to as instances of a class. Thus, a class is a logical construct; an
object has physical reality.
When you create a class, you will specify the code and data that constitute that class.
Collectively, these elements are called members of the class. Specifically, the data
defined by the class are referred to as member variables or instance variables. The code
that operates on that data is referred to as member methods or just methods. (If you are
familiar with C/C++, it may help to know that what a Java programmer calls a method, a
C/C++ programmer calls a function.) In properly written Java programs, the methods
define how the member variables can be used. This means that the behavior and
interface of a class are defined by the methods that operate on its instance data.
Since the purpose of a class is to encapsulate complexity, there are mechanisms for
hiding the complexity of the implementation inside the class. Each method or variable in a
class may be marked private or public. The public interface of a class represents
everything that external users of the class need to know, or may know. The private
methods and data can only be accessed by code that is a member of the class.
Therefore, any other code that is not a member of the class cannot access a private
method or variable. Since the private members of a class may only be accessed by other
parts of your program through the class' public methods, you can ensure that no
improper actions take place. Of course, this means that the public interface should be
carefully designed not to expose too much of the inner workings of a class (see Figure 2-
1).
Inheritance
Inheritance is the process by which one object acquires the properties of another object.
This is important because it supports the concept of hierarchical classification. As
mentioned earlier, most knowledge is made manageable by hierarchical (that is, topdown)
classifications. For example, a Golden Retriever is part of the classification dog,
which in turn is part of the mammal class, which is under the larger class animal. Without
the use of hierarchies, each object would need to define all of its characteristics explicitly.
However, by use of inheritance, an object need only define those qualities that make it
unique within its class. It can inherit its general attributes from its parent. Thus, it is the
inheritance mechanism that makes it possible for one object to be a specific instance of a
more general case. Let's take a closer look at this process.
Most people naturally view the world as made up of objects that are related to each other
in a hierarchical way, such as animals, mammals, and dogs. If you wanted to describe
animals in an abstract way, you would say they have some attributes, such as size,
intelligence, and type of skeletal system. Animals also have certain behavioral aspects;
they eat, breathe, and sleep. This description of attributes and behavior is the class
definition for animals.
If you wanted to describe a more specific class of animals, such as mammals, they would
have more specific attributes, such as type of teeth, and mammary glands. This is known
as a subclass of animals, where animals are referred to as mammals' superclass.
Since mammals are simply more precisely specified animals, they inherit all of the
attributes from animals. A deeply inherited subclass inherits all of the attributes from each
of its ancestors in the class hierarchy.
Inheritance interacts with encapsulation as well. If a given class encapsulates some
attributes, then any subclass will have the same attributes plus any that it adds as part of
its specialization (see Figure 2-2). This is a key concept which lets object-oriented
programs grow in complexity linearly rather than geometrically. A new subclass inherits
all of the attributes of all of its ancestors. It does not have unpredictable interactions with
the majority of the rest of the code in the system.
Polymorphism
Polymorphism (from the Greek, meaning "many forms") is a feature that allows one
interface to be used for a general class of actions. The specific action is determined by
the exact nature of the situation. Consider a stack (which is a last-in, first-out list). You
might have a program that requires three types of stacks. One stack is used for integer
values, one for floating-point values, and one for characters. The algorithm that
implements each stack is the same, even though the data being stored differs. In a non–
object-oriented language, you would be required to create three different sets of stack
routines, with each set using different names. However, because of polymorphism, in
Java you can specify a general set of stack routines that all share the same names.
More generally, the concept of polymorphism is often expressed by the phrase "one
interface, multiple methods." This means that it is possible to design a generic interface
to a group of related activities. This helps reduce complexity by allowing the same
interface to be used to specify a general class of action. It is the compiler's job to select
the specific action (that is, method) as it applies to each situation. You, the programmer,
do not need to make this selection manually. You need only remember and utilize the
general interface.
Extending the dog analogy, a dog's sense of smell is polymorphic. If the dog smells a cat,
it will bark and run after it. If the dog smells its food, it will salivate and run to its bowl. The
same sense of smell is at work in both situations. The difference is what is being smelled,
that is, the type of data being operated upon by the dog's nose! This same general
concept can be implemented in Java as it applies to methods within a Java program.
Polymorphism, Encapsulation, and Inheritance Work Together
When properly applied, polymorphism, encapsulation, and inheritance combine to
produce a programming environment that supports the development of far more robust
and scaleable programs than does the process-oriented model. A well-designed
hierarchy of classes is the basis for reusing the code in which you have invested time and
effort developing and testing. Encapsulation allows you to migrate your implementations
over time without breaking the code that depends on the public interface of your classes.
Polymorphism allows you to create clean, sensible, readable, and resilient code.
Of the two real-world examples, the automobile more completely illustrates the power of
object-oriented design. Dogs are fun to think about from an inheritance standpoint, but
cars are more like programs. All drivers rely on inheritance to drive different types
(subclasses) of vehicles. Whether the vehicle is a school bus, a Mercedes sedan, a
Porsche, or the family minivan, drivers can all more or less find and operate the steering
wheel, the brakes, and the accelerator. After a bit of gear grinding, most people can even
manage the difference between a stick shift and an automatic, because they
fundamentally understand their common superclass, the transmission.
People interface with encapsulated features on cars all the time. The brake and gas
pedals hide an incredible array of complexity with an interface so simple you can operate
them with your feet! The implementation of the engine, the style of brakes, and the size of
the tires have no effect on how you interface with the class definition of the pedals.
The final attribute, polymorphism, is clearly reflected in the ability of car manufacturers to
offer a wide array of options on basically the same vehicle. For example, you can get an
antilock braking system or traditional brakes, power or rack-and-pinion steering, 4-, 6-, or
8-cylinder engines. Either way, you will still press the break pedal to stop, turn the
steering wheel to change direction, and press the accelerator when you want to move.
The same interface can be used to control a number of different implementations.
As you can see, it is through the application of encapsulation, inheritance, and
polymorphism that the individual parts are transformed into the object known as a car.
The same is also true of computer programs. By the application of object-oriented
principles, the various parts of a complex program can be brought together to form a
cohesive, robust, maintainable whole.
As mentioned at the start of this section, every Java program is object-oriented. Or, put
more precisely, every Java program involves encapsulation, inheritance, and
polymorphism. Although the short example programs shown in the rest of this chapter and
in the next few chapters may not seem to exhibit all of these features, they are
nevertheless present. As you will see, many of the features supplied by Java are part of its
built-in class libraries, which do make extensive use of encapsulation, inheritance, and
polymorphism.
A First Simple Program
Now that the basic object-oriented underpinning of Java has been discussed, let's look at
some actual Java programs. Let's start by compiling and running the short sample
program shown here. As you will see, this involves a little more work than you might
imagine.
/*
This is a simple Java program.
Call this file "Example.java".
*/
class Example {
// Your program begins with a call to main().
public static void main(String args[]) {
System.out.println("This is a simple Java program.");
}
}
Note
The descriptions that follow use the standard JDK (Java Developer's Kit),
which is available from Sun Microsystems. If you are using a different Java
development environment, then you may need to follow a different procedure
for compiling and executing Java programs. In this case, consult your
compiler's user manuals for details.
Entering the Program
For most computer languages, the name of the file that holds the source code to a
program is arbitrary. However, this is not the case with Java. The first thing that you must
learn about Java is that the name you give to a source file is very important. For this
example, the name of the source file should be Example.java. Let's see why.
In Java, a source file is officially called a compilation unit. It is a text file that contains one
or more class definitions. The Java compiler requires that a source file use the .java
filename extension. Notice that the file extension is four characters long. As you might
guess, your operating system must be capable of supporting long filenames. This means
that DOS and Windows 3.1 are not capable of supporting Java (at least at this time).
However, Windows 95/98 and Windows NT work just fine.
As you can see by looking at the program, the name of the class defined by the program
is also Example. This is not a coincidence. In Java, all code must reside inside a class.
By convention, the name of that class should match the name of the file that holds the
program. You should also make sure that the capitalization of the filename matches the
class name. The reason for this is that Java is case-sensitive. At this point, the
convention that filenames correspond to class names may seem arbitrary. However, this
convention makes it easier to maintain and organize your programs.
Compiling the Program
To compile the Example program, execute the compiler, javac, specifying the name of
the source file on the command line, as shown here:
C:\\>javac Example.java
The javac compiler creates a file called Example.class that contains the bytecode
version of the program. As discussed earlier, the Java bytecode is the intermediate
representation of your program that contains instructions the Java interpreter will
execute. Thus, the output of javac is not code that can be directly executed.
To actually run the program, you must use the Java interpreter, called java. To do so,
pass the class name Example as a command-line argument, as shown here:
C:\\>java Example
When the program is run, the following output is displayed:
This is a simple Java program.
When Java source code is compiled, each individual class is put into its own output file
named after the class and using the .class extension. This is why it is a good idea to give
your Java source files the same name as the class they contain—the name of the source
file will match the name of the .class file. When you execute the Java interpreter as just
shown, you are actually specifying the name of the class that you want the interpreter to
execute. It will automatically search for a file by that name that has the .class extension.
If it finds the file, it will execute the code contained in the specified class.
A Closer Look at the First Sample Program
Although Example.java is quite short, it includes several key features which are common
to all Java programs. Let's closely examine each part of the program.
The program begins with the following lines:
/*
This is a simple Java program.
Call this file "Example.java".
*/
This is a comment. Like most other programming languages, Java lets you enter a
remark into a program's source file. The contents of a comment are ignored by the
compiler. Instead, a comment describes or explains the operation of the program to
anyone who is reading its source code. In this case, the comment describes the program
and reminds you that the source file should be called Example.java. Of course, in real
applications, comments generally explain how some part of the program works or what a
specific feature does.
Java supports three styles of comments. The one shown at the top of the program is
called a multiline comment. This type of comment must begin with /* and end with */.
Anything between these two comment symbols is ignored by the compiler. As the name
suggests, a multiline comment may be several lines long.
The next line of code in the program is shown here:
class Example {
This line uses the keyword class to declare that a new class is being defined. Example
is an identifier that is the name of the class. The entire class definition, including all of its
members, will be between the opening curly brace ({) and the closing curly brace (}). The
use of the curly braces in Java is identical to the way they are used in C and C++. For the
moment, don't worry too much about the details of a class except to note that in Java, all
program activity occurs within one. This is one reason why all Java programs are (at least
a little bit) object-oriented.
The next line in the program is the single-line comment, shown here:
// Your program begins with a call to main().
This is the second type of comment supported by Java. A single-line comment begins
with a // and ends at the end of the line. As a general rule, programmers use multiline
comments for longer remarks and single-line comments for brief, line-by-line descriptions.
The next line of code is shown here:
public static void main(String args[]) {
This line begins the main( ) method. As the comment preceding it suggests, this is the
line at which the program will begin executing. All Java applications begin execution by
calling main( ). (This is just like C/C++.) The exact meaning of each part of this line
cannot be given now, since it involves a detailed understanding of Java's approach to
encapsulation. However, since most of the examples in the first part of this book will use
this line of code, let's take a brief look at each part now.
The public keyword is an access specifier, which allows the programmer to control the
visibility of class members. When a class member is preceded by public, then that
member may be accessed by code outside the class in which it is declared. (The
opposite of public is private, which prevents a member from being used by code defined
outside of its class.) In this case, main( ) must be declared as public, since it must be
called by code outside of its class when the program is started. The keyword static
allows main( ) to be called without having to instantiate a particular instance of the class.
This is necessary since main( ) is called by the Java interpreter before any objects are
made. The keyword void simply tells the compiler that main( ) does not return a value.
As you will see, methods may also return values. If all this seems a bit confusing, don't
worry. All of these concepts will be discussed in detail in subsequent chapters.
As stated, main( ) is the method called when a Java application begins. Keep in mind
that Java is case-sensitive. Thus, Main is different from main. It is important to
understand that the Java compiler will compile classes that do not contain a main( )
method. But the Java interpreter has no way to run these classes. So, if you had typed
Main instead of main, the compiler would still compile your program. However, the Java
interpreter would report an error because it would be unable to find the main( ) method.
Any information that you need to pass to a method is received by variables specified
within the set of parentheses that follow the name of the method. These variables are
called parameters. If there are no parameters required for a given method, you still need
to include the empty parentheses. In main( ), there is only one parameter, albeit a
complicated one. String args[ ] declares a parameter named args, which is an array of
instances of the class String. (Arrays are collections of similar objects.) Objects of type
String store character strings. In this case, args receives any command-line arguments
present when the program is executed. This program does not make use of this
information, but other programs shown later in this book will.
The last character on the line is the {. This signals the start of main( )'s body. All of the
code that comprises a method will occur between the method's opening curly brace and
its closing curly brace.
One other point: main( ) is simply a starting place for the interpreter. A complex program
will have dozens of classes, only one of which will need to have a main( ) method to get
things started. When you begin creating applets—Java programs that are embedded in
Web browsers—you won't use main( ) at all, since the Web browser uses a different
means of starting the execution of applets.
The next line of code is shown here. Notice that it occurs inside main( ).
System.out.println("This is a simple Java program.");
This line outputs the string "This is a simple Java program." followed by a new line on the
screen. Output is actually accomplished by the built-in println( ) method. In this case,
println( ) displays the string which is passed to it. As you will see, println( ) can be used
to display other types of information, too. The line begins with System.out. While too
complicated to explain in detail at this time, briefly, System is a predefined class that
provides access to the system, and out is the output stream that is connected to the
console.
As you have probably guessed, console output (and input) is not used frequently in real
Java programs and applets. Since most modern computing environments are windowed
and graphical in nature, console I/O is used mostly for simple, utility programs and for
demonstration programs. Later in this book, you will learn other ways to generate output
using Java. But for now, we will continue to use the console I/O methods.
Notice that the println( ) statement ends with a semicolon. All statements in Java end
with a semicolon. The reason that the other lines in the program do not end in a
semicolon is that they are not, technically, statements.
The first } in the program ends main( ), and the last } ends the Example class definition.

Exceptions are the customary way in Java to indicate to a calling method that an abnormal condition has occurred. This article is a companion piece to this month's Design Techniques installment, which discusses how to use exceptions appropriately in your programs and designs. Look to this companion article for a tutorial on the nuts and bolts of what exceptions are and how they work in the Java language and virtual machine.
When a method encounters an abnormal condition (an exception condition) that it can't handle itself, it may throw an exception. Throwing an exception is like throwing a beeping, flashing red ball to indicate there is a problem that can't be handled where it occurred. Somewhere, you hope, this ball will be caught and the problem will be dealt with. Exceptions are caught by handlers positioned along the thread's method invocation stack. If the calling method isn't prepared to catch the exception, it throws the exception up to its calling method, and so on. If one of the threads of your program throws an exception that isn't caught by any method along the method invocation stack, that thread will expire. When you program in Java, you must position catchers (the exception handlers) strategically, so your program will catch and handle all exceptions from which you want your program to recover.
Exception classes
In Java, exceptions are objects. When you throw an exception, you throw an object. You can't throw just any object as an exception, however -- only those objects whose classes descend from Throwable. Throwable serves as the base class for an entire family of classes, declared in java.lang, that your program can instantiate and throw. A small part of this family is shown in Figure 1.
As you can see in Figure 1, Throwable has two direct subclasses, Exception and Error. Exceptions (members of the Exception family) are thrown to signal abnormal conditions that can often be handled by some catcher, though it's possible they may not be caught and therefore could result in a dead thread. Errors (members of the Error family) are usually thrown for more serious problems, such as OutOfMemoryError, that may not be so easy to handle. In general, code you write should throw only exceptions, not errors. Errors are usually thrown by the methods of the Java API, or by the Java virtual machine itself.
Figure 1. A partial view of the Throwable family
In addition to throwing objects whose classes are declared in java.lang, you can throw objects of your own design. To create your own class of throwable objects, you need only declare it as a subclass of some member of the Throwable family. In general, however, the throwable classes you define should extend class Exception. They should be "exceptions." The reasoning behind this rule will be explained later in this article.
Whether you use an existing exception class from java.lang or create one of your own depends upon the situation. In some cases, a class from java.lang will do just fine. For example, if one of your methods is invoked with an invalid argument, you could throw IllegalArgumentException, a subclass of RuntimeException in java.lang.
·

fashion designing

2008-09-02T02:17:00.000-07:00

ashok chakra

2008-09-02T01:46:00.000-07:00

infix to postfix

2008-09-02T01:45:00.000-07:00

/*
Postfix.java - this program coverts an infix expression to a postfix expression, and evaluates it. Infix expressions must be typed with spaces between all numbers and operators.
Name: Alexis Dekle
Course: CPSC 215
Date: March 3, 2005
*/
import java.io.*;
import java.util.*;
public class Postfix
{
private static Stack operators = new Stack();
private static Stack operands = new Stack();

public static void main(String argv[]) throws IOException
{
String infix;

//create an input stream object
BufferedReader keyboard = new BufferedReader (new InputStreamReader(System.in));

//get input from user
System.out.print("\nEnter the algebraic expression in infix: ");
infix = keyboard.readLine();

//output as postfix
System.out.println("The expression in postfix is:" + toPostfix(infix));

//get answer
System.out.println("The answer to the equation is: " + evaluate(toPostfix(infix)) + "\n");
}

private static String toPostfix(String infix)
//converts an infix expression to postfix
{
StringTokenizer s = new StringTokenizer(infix);
//divides the input into tokens
String symbol, postfix = "";
while (s.hasMoreTokens())
//while there is input to be read
{
symbol = s.nextToken();
//if it's a number, add it to the string
if (Character.isDigit(symbol.charAt(0)))
postfix = postfix + " " + (Integer.parseInt(symbol));
else if (symbol.equals("("))
//push (
{
Character operator = new Character('(');
operators.push(operator);
}
else if (symbol.equals(")"))
//push everything back to (
{
while (((Character)operators.peek()).charValue() != '(')
{
postfix = postfix + " " + operators.pop();
}
operators.pop();
}
else
//print operators occurring before it that have greater precedence
{
while (!operators.empty() && !(operators.peek()).equals("(") && prec(symbol.charAt(0)) <= prec(((Character)operators.peek()).charValue()))
postfix = postfix + " " + operators.pop();
Character operator = new Character(symbol.charAt(0));
operators.push(operator);
}
}
while (!operators.empty())
postfix = postfix + " " + operators.pop();
return postfix;
}

private static int evaluate(String postfix)
{
StringTokenizer s = new StringTokenizer(postfix);
//divides the input into tokens
int value;
String symbol;
while (s.hasMoreTokens())
{
symbol = s.nextToken();
if (Character.isDigit(symbol.charAt(0)))
//if it's a number, push it
{
Integer operand = new Integer(Integer.parseInt(symbol));
operands.push(operand);
}
else //if it's an operator, operate on the previous two operands
{
int op2 = ((Integer)operands.pop()).intValue();
int op1 = ((Integer)operands.pop()).intValue();
int result = 0;
switch(symbol.charAt(0))
{
case '*': {result = op1 * op2; break;}
case '+': {result = op1 + op2; break;}
case '-': {result = op1 - op2; break;}
case '/': {result = op1 / op2; break;}
case '%': {result = op1 % op2; break;}
}
Integer operand = new Integer(result);
operands.push(operand);
}
}
value = ((Integer)operands.pop()).intValue();
return value;
}

private static int prec(char x)
{
if (x == '+' x == '-')
return 1;
if (x == '*' x == '/' x == '%')
return 2;
return 0;
}
}

previous question paper mobile computing

2008-09-01T02:01:00.001-07:00

Code No: R6-48-MCA R6
M.C.A. IV Semester Regular Examinations, Apr/May 2008
MOBILE COMPUTING
- - - -
Time: 3 hours Max Marks: 60
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) What limits the data rates that can be achieved with GPRS and HSCSD using
real devices?
(b) How much of the original GSM network does GPRS needed? Which elements
of the network perform the data transfer?
2. Explain in detail about SDMA and CDMA.
3. (a) Explain optimizations in mobile IP.
(b) Explain the reverse tunneling procedure.
4. What is slow start and congestion avoidance? How fast retransmit/fast recovery
are improved over slow start and congestion avoidance.
5. Explain the issues in ensuring QOS in Mobile environment.
6. Explain how push-based data delivery works. Give one example application of
push-based data delivery.
7. Distinguish between proactive and reactive routing protocols. Discuss the suitability
of these protocols in mobile adhoc networks.
8. What are the primary goals of WAP? Explain the protocol architecture of WAP.

108 names of lord ganesha

2008-09-01T01:58:00.000-07:00

Ganesha

1 Akhurath - One who has Mouse as His Charioteer

2 Alampata - Ever Eternal Lord

3 Amit - Incomparable Lord

4 Anantachidrupamayam - Infinite and Consciousness Personified

5 Avaneesh - Lord of the whole World

6 Avighna - Remover of Obstacles

7 Balaganapati - Beloved and Lovable Child

8 Bhalchandra - Moon-Crested Lord

9 Bheema - Huge and Gigantic

10 Bhupati - Lord of the Gods

11 Bhuvanpati - God of the Gods

12 Buddhinath - God of Wisdom

13 Buddhipriya - Knowledge Bestower

14 Buddhividhata - God of Knowledge

15 Chaturbhuj - One who has Four Arms

16 Devadeva - Lord of All Lords

17 Devantakanashakarin - Destroyer of Evils And Asuras

18 Devavrata - One who accepts all Penances

19 Devendrashika - Protector of All Gods

20 Dharmik - One who gives Charity

21 Dhoomravarna - Smoke-Hued Lord

22 Durja - Invincible Lord

23 Dvaimatura - One who has two Mothers

24 Ekaakshara - He of the Single Syllable

25 Ekadanta - Single-Tusked Lord

26 Ekadrishta - Single-Tusked Lord

27 Eshanputra - Lord Shiva's Son

28 Gadadhara - One who has The Mace as His Weapon

29 Gajakarna - One who has Eyes like an Elephant

30 Gajanana - Elephant-Faced Lord

31 Gajananeti - Elephant-Faced Lord

32 Gajavakra - Trunk of The Elephant

33 Gajavaktra - One who has Mouth like An Elephant

34 Ganadhakshya - Lord of All Ganas (Gods)

35 Ganadhyakshina - Leader of All The Celestial Bodies

36 Ganapati - Lord of All Ganas (Gods)

37 Gaurisuta - The Son of Gauri (Parvati)

38 Gunina - One who is The Master of All Virtues

39 Haridra - One who is Golden Coloured

40 Heramba - Mother's Beloved Son

41 Kapila - Yellowish-Brown Coloured

42 Kaveesha - Master of Poets

43 Krti - Lord of Music

44 Kripalu - Merciful Lord

45 Krishapingaksha - Yellowish-Brown Eyed

46 Kshamakaram - The Place of Forgiveness

47 Kshipra - One who is easy to Appease

48 Lambakarna - Large-Eared Lord

49 Lambodara - The Huge Bellied Lord

50 Mahabala - Enormously Strong Lord

51 Mahaganapati - Omnipotent and Supreme Lord

52 Maheshwaram - Lord of The Universe

53 Mangalamurti - All Auspicious Lord

54 Manomay - Winner of Hearts

55 Mrityuanjaya - Conqueror of Death

56 Mundakarama - Abode of Happiness

57 Muktidaya - Bestower of Eternal Bliss

58 Musikvahana - One who has mouse As charioteer

59 Nadapratithishta - One who Appreciates And Loves Music

60 Namasthetu - Vanquisher of All Evils & Vices & Sins

61 Nandana - Lord Shiva's Son

62 Nideeshwaram - Giver of Wealth and Treasures

63 Omkara - One who has the Form Of OM

64 Pitambara - One who has Yellow-Coloured Body

65 Pramoda - Lord of All Abodes

66 Prathameshwara - First Among All

67 Purush - The Omnipotent Personality

68 Rakta - One who has Red-Coloured Body

69 Rudrapriya - Beloved Of Lord Shiva

70 Sarvadevatman - Acceptor of All Celestial Offerings

71 Sarvasiddhanta - Bestower of Skills And Wisdom

72 Sarvatman - Protector of The Universe

73 Shambhavi - The Son of Parvati

74 Shashivarnam - One who has a Moon Like Complexion

75 Shoorpakarna - Large-Eared Lord

76 Shuban - All Auspicious Lord

77 Shubhagunakanan - One who is The Master of All Virtues

78 Shweta - One who is as Pure as the White Colour

79 Siddhidhata - Bestower of Success & Accomplishments

80 Siddhipriya - Bestower of Wishes and Boons

81 Siddhivinayaka - Bestower of Success

82 Skandapurvaja - Elder Brother of Skand (Lord Kartik)

83 Sumukha - Auspicious Face

84 Sureshwaram - Lord of All Lords

85 Swaroop - Lover of Beauty

86 Tarun Ageless

87 Uddanda - Nemesis of Evils and Vices

88 Umaputra - The Son of Goddess Uma (Parvati)

89 Vakratunda - Curved Trunk Lord

90 Varaganapati - Bestower of Boons

91 Varaprada - Granter of Wishes and Boons

92 Varadavinayaka - Bestower of Success

93 Veeraganapati - Heroic Lord

94 Vidyavaridhi - God of Wisdom

95 Vighnahara - Remover of Obstacles

96 Vignaharta - Demolisher of Obstacles

97 Vighnaraja - Lord of All Hindrances

98 Vighnarajendra - Lord of All Obstacles

99 Vighnavinashanaya - Destroyer of All Obstacles & Impediments

100 Vigneshwara - Lord of All Obstacles

101 Vikat - Huge and Gigantic

102 Vinayaka - Lord of All

103 Vishwamukha - Master of The Universe

104 Vishwaraja - King of The World

105 Yagnakaya - Acceptor of All Sacred & Sacrficial Offerings

106 Yashaskaram - Bestower of Fame and Fortune

107 Yashvasin - Beloved and Ever Popular Lord

108 Yogadhipa - The Lord of Meditation

*

QOS in mobile computing

2008-09-01T01:25:00.000-07:00

Although there are already many fixed networked computers around the world, we will see several orders of magnitude more wireless and mobile devices connected to the Internet in the future. Each car, truck, aircraft, but also many people will carry a plethora of different devices for computing and communication. However, all mobile and wireless systems have in common that the quality of their connectivity may change rapidly over time. Still, users want to get the best quality possible or the quality they pay for respectively. Furthermore, people want to use well-known services and applications from fixed networks.Mobility is a key characteristic of today's society as also the tremendous growth rates in mobile communication systems show. Already today over 500, million people use mobile technology, far more than the (still mostly fixed) Internet. History shows that there is not one single networking technology covering all aspects of communication, the future will bring even more technologies. Examples are broadband infrastructures based on ATM or IP over Sonet, LANs based on Ethernet, wireless LANs according to IEEE 802.11, infrared access, mobile and cordless phone systems.New technologies include Personal Area Networks using, e.g., Bluetooth [1], scalable QoS provisioning in the Internet with Differentiated Services, and advanced protocol stacks for wireless and mobile communication (e.g., Wireless Application Protocol, WAP [2]). A single technology can never cover all aspects of communication. While in wired communication we could think of an ideal world with fiber to the desktop and powerful communication systems, the wireless and mobile domain puts several limitations on communication systems. Portability of devices restricts the performance, mobility imposes new requirements on QoS support, and wireless access limits the bandwidth. Particularly in mobile and wireless environments, several network technologies coexist, such as IrDA (Infrared Data Association), DECT (Digital Enhanced Cordless Telecommunications), GSM (Global System for Mobile communications), DAB (Digital Audio Broadcasting), or wireless LANs (e.g., IEEE 802.11) [3, 4].Depending on the current location, the user or mobile device can choose one (or more) of the available transmission links for communication with other mobile devices or for getting connected to the Internet. However, when looking at Quality of Service (QoS) one should keep in mind that in the end only the QoS perceived by a user really matters. While evolving at high speed, mobile computing and communication systems still suffer from low bandwidth, low performance due to battery limitations, but also consistency problems of distributed applications or security problems.First steps towards higher overall performance and thus higher QoS for users can be recognized: future mobile systems will not only have higher bandwidth (e.g., within the ITU IMT-2000 program [5]), but they will also combine different wireless technologies, such as high performance local wireless networks and wide area networks to offer good coverage and high bandwidth at certain hot spots. As it is currently happening for fixed networks, we will also see a strong convergence of telephone and Internet technology in wireless networks [6, 7, 8]. All third generation systems combine IP-traffic with traditional voice traffic [9].Furthermore, gateways to inter-connect telephone signaling with Internet signaling protocols are being developed. Still a big problem is the use of distributed applications that nowadays often assume permanent connectivity. In this case, the use of special middleware proxies and the extension of the widespread standard CORBA can offer a solution. Finally, no mobile and wireless scenarion can be developed without security in mind. While several architectures already offer partial security solutions, a common framework is still missing

Maintaining data consistency in mobile database broadcasts

2008-09-01T01:12:00.000-07:00

Abstract
The broadcast-based data dissemination in wireless environments poses new challenging issues on data consistency of transaction processing. Due to concurrent execution of update transactions and broadcast of data items, mobile transactions generated by mobile clients may observe inconsistency of data values. Among the concurrency control techniques providing data consistency in broadcast environments, Update First with Order (UFO) algorithm has been shown to be more efficient and has minimal impact on server, client and the broadcast schedule. In this paper, we propose a mobile database system that uses a modified UFO algorithm utilizing rule-based approach for concurrency control among mobile and update transactions in the broadcast environment. We use Event-Condition-Action (ECA) rules to make decisions on broadcasting without conflicting. Moreover, this system has an inference engine that makes deduction using forward chaining control flow to provide effective consistency checking during updates. The system discussed in this paper, provides site autonomy between the mobile clients and the server with minimum upstream communication and data consistency that are desirable features to the scalability of applications, which are running in broadcast environments.

Introduction
The increasing ability to interconnect computers through internetworking, wireless networks, high bandwidth satellite, and cable networks has spawned a new class of information centered applications based on data dissemination. In contrast to traditional, where data are delivered from servers to clients on demand, a wide range of emerging database applications benefit from a broadcast mode for data dissemination. In such applications, the server repetitively broadcasts data to a client population without a specific request. Clients monitor the broadcast channel and retrieve the data items they need as they arrive on the broadcast channel. Such applications typically involve a small number of servers and a much larger number of clients with similar interests. Examples include weather information systems, electronic commerce applications, such as auction and electronic tendering, and traffic control information systems. With data broadcast, mobile transactions do not need to inform the broadcast server before accessing a data item and can get it from the “air” while it is being broadcast.

As data dissemination systems continue to evolve, more and more sophisticated client applications will require reading current and consistent data despite updates at the server. Since many data items in mobile computing systems are used to record the real-time information such as current traffic conditions of the roads, current weather conditions of the cities, and news updates, their values will be highly dynamic and sensitive. The updates capture the most current information for the system and refresh the values of the data items in the database [9][10]. Accessing out-dated data items is undesirable and will significantly affect the usefulness of the information to mobile clients [2]. Thus allowing the execution of updates while it is being broadcast is important in maintaining the validity and freshness of the data items. However, if concurrent execution of updates and data broadcast is allowed, the problem of concurrency control must be addressed. Given the limited amount of bandwidth available for clients to communicate with the broadcast server, achieving data consistency efficiently is a challenging research issue.

Unfortunately, conventional concurrency protocols, such as two phase locking, optimistic method and timestamp ordering [1] are not suitable for mobile computing systems as the overhead for setting locks and detecting data conflicts in a mobile environment can be very heavy [8].

In this paper, we study the problem of disseminating consistent data items to mobile transactions while allowing updates to be executed concurrently at the database server. An efficient and pioneering method is by broadcasting multiple versions of data items [18]. Consistent data items are provided to mobile transactions by requiring the mobile transactions to read data items committed at the same point of time. The basic multi-version broadcast method is extended in [16,17] for systems with client caches where multiple versions of data items are maintained. By reading cached data items, which are committed at the same time, the data access delay can be much reduced and at the same time data consistency is ensured. Another efficient method for concurrency control between mobile transactions and update transactions is a data re-broadcast scheme called Update First with Ordering (UFO) [3]. Although UFO can provide the most updated values of data items to mobile transactions and at the same time maintain the serializability of the execution between update and mobile transactions, it is designed for read-only mobile transactions in which operations are unordered. In this paper, we extend the UFO protocol for read-write mobile transactions, which uses rule-based approach.

Figure 1: Architecture of Mobile Database System

The following are the contributions of the paper
UFO algorithm is extended based on rule-base approach for mobile transactions in which read-write operations can be done.
Enhancements based on an invalidation scheme are done for accessing consistent data.
The organization of the remaining parts of the paper is as follows. Section 2 reviews related work on broadcasting consistent data items. Section 3 describes the system architectural model. In Section 4, we describe the correctness of transactions in broadcast environments. Section 5 discusses the problem of data inconsistency in data broadcast using examples. Section 6 introduces the modified UFO algorithm with a detailed discussion on its correctness and properties. The paper concludes in Section 7.

Related works
Data management in broadcast environments receives a lot of attention in these few years. However, there are only a few studies on transaction processing [8]. In [11], Datacycle architecture is introduced for high throughput database systems. The entire contents of the database are repetitively broadcast to the hosts over a high bandwidth network. It could be very expensive to use the serializability as the correctness criterion in the Datacycle architecture [8].

In [8], a new correctness criterion is proposed to allow read-only transactions to read current and consistent data in broadcast environments without contacting the server. However, the serializability is not maintained in their protocol. Two different read-only transactions may perceive the effects of update transactions in different serial orders. It may be hazardous to certain applications such as mobile stock trading where a buy/sell trade will be triggered to exploit the temporary pricing relationships among stocks. From the trader’s perspective, the inability of database management system to maintain the serializability may have important financial consequences [12]. For instance, if the users who submitted multiple read-only transactions communicate and compare their query results, they may be confused [13]. In [8], they proposed two protocols, F-Matrix and R-Matrix. Although the F-Matrix shows better performance, it suffers from high overheads in terms of expensive computation and high bandwidth requirement for additional control information.

In [4,6], multi-version data broadcast approaches are suggested to resolve the problem of reading inconsistent data values. In addition to the most updated version, all the previous versions within a time frame need to be broadcast as well. Another method to detect the non-serializability problem is to broadcast serialization graphs [4,6]. Each client maintains its local serialization graph to ensure that the schedules of all the committed transactions are serializable. The first drawback of this method is also the heavy overhead in broadcasting the serialization graphs since every data conflict at the database server has to be broadcast. Secondly, each client must listen to the transmission channel to maintain and update its serialization graph [5]. This leads to another serious problem, which can affect the correctness of this approach: the need to maintain the serialization graphs at the client mobile even when it is disconnected. The mobile network is unreliable and disconnection is frequent. When disconnection occurs, the mobile client cannot obtain new serialization information about its transaction, making it virtually impossible to ensure serializability of transaction execution.

In [3], UFO algorithm can maintain the serializability of update transactions at the database server and the read-only mobile transactions. This algorithm has been shown to be more efficient and has minimal impact on server, client and the broadcast schedule. However, update operations of mobile clients have not been taken into account. In this paper, we propose a mobile database system that uses a modified UFO algorithm, utilizes a rule-based approach for concurrency control among mobile and update transactions in the broadcast environment. Moreover, this system has an inference engine that makes deduction using forward chaining control flow to provide effective consistency checking during updates.

System architecture model
Figure 1 presents a general architecture of the mobile database system similar to that described in [14,15]. Architecture model consists of stationary and mobile components. Mobile component is the mobile client, which can connect fixed network via a wireless link. Stationary components could be fixed host or base stations. Fixed Host in a fixed network does not have capable of connecting to a mobile unit. Base stations are augmented with wireless interface to communicate with mobile computers, called Mobile Support Station (MSS). In the above architecture model, database servers residing on fixed host and MSS compose a distributed database system. Every database server possesses site autonomy and supports local transaction processing through Two-Phase Locking mechanism. As a part of the distributed database system, each MSS can also function as a mobile transaction coordinator, which receives transaction operations from mobile clients and coordinates their execution. A mobile client can move arbitrarily at any moment within a wireless cell or among different cells. When it is connected with the fixed network, it always communicates with the MSS supporting the cell where it is currently located. In addition, it can disconnect from the fixed network at any time. When it reconnects with the fixed network, it fetches back the results of previous operations and sends subsequent operations.

An important property of the data items in a mobile computing system is that their values can be highly dynamic and sensitive as they are used to maintain the useful information such as weather, highway conditions, traffic directions, news, stock quotes and the location of a moving object [10]. To maintain the freshness and validity of the data items, data items should be updated often by the generation of update transactions. It is assumed that the updates are generated by means of some external environment such as capture devices, and sensors. The broadcast server disseminates all the data items periodically in each broadcast cycle. The duration of a broadcast cycle may be fixed or variable depending on the adopted broadcast scheduling algorithm, which is also used for selecting data items to broadcast.

Update transactions consist of one to several write operations and its arrival rate can be very high. It is assumed that a well-formed concurrency control protocol, such as two phase locking [3], is used for concurrency control amongst the update transactions at the database server. Mobile clients issue mobile transactions to access data items at the database. It is assumed that each mobile transaction consists of a sequence of read operations and defined with a deadline. Moreover mobile transaction will become totally useless after its deadline and has to be aborted or restarted.

In our model, the broadcast process is modeled as a long read-only transaction, called broadcast transaction. The length of a broadcast transaction is defined based on the life span of a mobile transaction that is equal to the time required to broadcast its data items. Thus, the data item set of a broadcast transaction includes all the data items, which are broadcast during the period from (current time - life-span of a mobile transaction) to current time. The reason of choosing the life span of a mobile transaction to define the length of a broadcast transaction is that for normal cases a mobile transaction will be finished within its life span. Note that the broadcast transaction actually does not possess any characteristics of a transaction.

The following are the assumptions of the system model are summarized below:
All update transactions are processed at the database servers.
The arrival rate of update transactions is high and random.
All mobile transactions are read-write.
Each mobile transaction has a deadline, i.e., arrival time + life span. It is important to complete a mobile transaction before its deadline. Otherwise, it should be restarted.
The broadcast process is modeled as a broadcast transaction.
Correctness of transactions in broadcast environments
Dissemination of data items to mobile transactions may be performed concurrently with the execution of update transactions. So it is possible that mobile transactions may read inconsistent data values due to uncontrolled interleaving of update and mobile transactions. Moreover, Mobile transaction should access updated value of data items. Thus, there are two fundamental requirements for disseminating data items to mobile transactions: Mutual consistency and Currency. Mutual consistency ensures that (a) the server maintains mutually consistent data and (b) clients can read mutually consistent data. Currency ensures that clients can access data that is current.

Mutual Consistency
Concurrency control amongst update transactions are to be done by a well-formed concurrency control protocol such as Two-Phase Locking [1], we have to consider the inconsistent problem of data conflicts between mobile transactions and update transactions. Our proposed protocol will concentrate on resolving this type of data conflicts to ensure that all mobile transactions will read consistent data values. In this paper, we adopt serializability as the correctness criterion of database consistency as it is widely accepted in the database community. If the serialization graph of a set of transactions is acyclic, then the schedule is serializable.

Currency
The Important characteristic of the mobile database systems is that the values of the data items are highly dynamic and the arrival rates of the updates can be very high. While data items are being broadcast from the database server to the mobile clients, updates of data items are being installed into the database. In such a dynamic environment, it is difficult to maintain a strict consistency between the external environment and the corresponding values of the data items in the database. This is especially true in the case of distributed database system. For example, in a weather monitoring system, updates are generated at the weather monitoring place database server. For most cases, stale information is much less useful to mobile clients. In order to minimize the staleness of the information, the system has to process update transactions as soon as possible and broadcast the most up-to-second information, e.g., the latest committed value of a data item. Since providing the most updated values of data items in a mobile network can be very expensive, an alternative is to bound the degree of “staleness” of the data items within a pre-defined bound. For some data items, e.g., weather information, the data values will be totally useless if they are “older” than a certain pre-defined time bound [7].

Data inconsistency in dissemination
In this section, we briefly discuss the inconsistency problem in data dissemination [3] using some examples.

Case1: Data Conflict between mobile and update transaction

Suppose the update transaction updates the weather for cities ‘Chennai’ and then ‘Mumbai’ and mobile clients wants to access the value of weather for cities ‘Mumbai’ and then ‘Chennai’.

If the execution history is:
Broadcasts weather value for ‘Mumbai’
Mobile transaction reads weather value for ‘Mumbai’
Update transaction updates weather value for ‘Chennai’
Update transaction updates weather value for ‘Mumbai’
Broadcasts weather value for ‘Chennai’
Mobile transaction reads weather value for ‘Chennai’
The mobile transaction may observe inconsistent data values. The reason is that mobile transaction reads the weather value for ‘Mumbai’, which is in conflict with update transaction, before update.

The serialization graph is cyclic because of MT U MT. Thus, it is non-serializable.

Case2: Mobile transaction may conflict with two or more update transaction

Suppose there are two update transactions U1 and U2 such that U1 updates weather value for ‘Chennai’ and then ‘Bangalore’, and U2 updates weather value for ‘Bangalore’ and then ‘Mumbai’.

If the execution history is:
Broadcasts weather value for ‘Chennai’
Mobile transaction reads weather value for ‘Chennai’
Update transaction1 updates weather value for ‘Chennai’
Update transaction1 updates weather value for ‘Bangalore’
Update transaction2 updates weather value for ‘Bangalore’
Update transaction2 updates weather value for ‘Mumbai’
Broadcasts weather value for ‘Mumbai’
Mobile transaction reads weather value for ‘Mumbai’
The serialization graph is cyclic because of U2 MT U1 U2.

Thus, it is non-serializable.

Case3: Involving two or more broadcast transaction

A mobile transaction may not able to find all its required data items in a single broadcast cycle. Non-serlializability may occur over more than one broadcast transaction.

If the execution history is:
Broadcasts weather value for ‘Chennai’
Mobile transaction reads weather value for ‘Chennai’
End of Broadcast Cycle1
Update transaction updates weather value for ‘Mumbai’
Update transaction updates weather value for ‘Chennai’
Broadcast transaction2 broadcasts weather value for ‘Mumbai’
Mobile transaction reads weather value for ‘Mumbai’
The serialization graph is cyclic because of MT U MT. Thus, it is non-serializable.

Note that we ignore the broadcast transaction as they don’t have any real effect on the database consistency and their function is only to provide mobile transaction to read.

Modified Ufo
In [3], Update First with Order (UFO) protocol is proposed for broadcasting consistent data items to mobile transactions with unordered read operations, i.e. each mobile transaction consists of a set of read operations and the operations can be executed in any order. In this paper, we propose a modified UFO algorithm, for read-write mobile transactions, which uses the rule-based approach. The issues of accessing consistent data items and processing operations under disconnection will also be addressed.

The basic principle of the modified UFO algorithm is to ensure that if a data conflict occurs between a broadcast transaction (BT) and an update transaction (U), the serialization order between them will always be U ® BT. Since mobile transactions (MT) read data items from broadcast transactions, the serialization order between broadcast transactions and mobile transactions is always BT ® MT. Thus, the serialization order between update transactions and mobile transactions will always be U ® MT and the schedules will be serializable.

Basically, the OUFO protocol consists of two parts:
Execution of update transactions
Conflict resolution between update and broadcast transactions
Execution of Update Transactions
The execution of an update transaction is divided into two phases: the execution phase and the commit phase. During the execution phase, the operations of an update transaction are executed and data conflicts with other update transactions are resolved using a conventional concurrency control protocol such as 2PL. The new values from the write operations of a transaction are written in a private workspace of the transaction instead into the database immediately. When all the operations of the update transaction have been completed, it enters the commit phase in which permanent updates of the database will be performed by copying the new values from its private workspace into the database. Data conflict with the broadcast transaction will be checked in the commit phase, which is performed in a critical section. So, we can see that the update transactions adopt 2PL for resolving data conflicts with other update transactions and use an optimistic approach to detect conflicts with the broadcast transaction. There are two important advantages in dividing the execution of the update transactions into two phases. Firstly, it can significantly reduce the blocking probability and delay of the broadcast transactions. If a broadcast transaction wants to read a data item, which is already locked by an update transaction during its commit phase, the broadcast transaction will be blocked until the update transaction is committed based on the principles of 2PL. At the same time, the update transaction, which is holding the lock, may be blocked due to data conflicts with other update transactions. Due to transitive blocking, the blocking time of the broadcast transactions can be very long. Dividing the execution of an update transaction into two phases can greatly reduce the blocking probability and blocking time of broadcast transactions since data conflicts between update and broadcast transactions will occur only when the update transaction is in the commit phase, which is much shorter. Secondly, the detection of data conflicts between the update and broadcast transactions will become much easier. At the commit phase, the system will know which data items have been accessed by the update transaction. By comparing the write set of the update transaction with the read set of the broadcast transaction, the system can easily determine whether there is any data conflict between them.

Conflict Resolution between Update and Broadcast Transactions
Data conflict between an update transaction and a broadcast transaction is detected when the update transaction enters its commit phase. Re-broadcast is used to resolve the conflict by reversing the serialization order from BT ® U to U ® BT. The details of the algorithms at both the server and mobile clients are shown in the following sections.

Algorithm at the Server:

It is performed when an update transaction enters the commit phase.
On(transaction commit)
If OBT Ç OU = { }
then
BT and U have no dependency
else
for each data item di Î { OBT Ç OU }
re-broadcast data item di
endif

where OBT = set of data items of broadcast transaction BT
OU = set of data items of update transaction U

By re-broadcasting the conflicting data item, the serialization order between the broadcast transaction and the update transaction is reversed. The set of data items in the broadcast transaction consists of those data items, which are broadcast in the period from (current time ??life-span of a mobile transaction) to current time. Thus, the set of data items in the broadcast transaction is not fixed. After the broadcast of a data item, the data item will be included and the last data item in the broadcast transaction will be removed.

Algorithm at the Mobile Client
The data items requested by a MT are represented by a sequence of read operations. Processing of a MT starts from the first read operation in the sequence. Each data item received from a BT is matched with the requesting data item of the executing operation. If there is a match, the MT will read the data item and the operation will be processed. The process is repeated for the next read operation until there is no more operation in the sequence. In case a data item, which is already read, is re-broadcast while the MT is waiting for other data items, the MT will be restarted from the operation which requests that data item. It will use the re-broadcast value for the execution of the operation. There are two reasons for the restart. Firstly, it is to ensure the serializability order U ® MT. The second reason is to provide the most updated data values to the mobile transactions. The algorithm at the mobile client is shown below where it is assumed that the MT reads all its data items from BT and there is no cache at the client.

dc = the data item required by the first operation in LMT loop until LMT exhausted
read data item di from BT (di is the currently broadcasting item)
if di = dc
then
MT processes di and updates LMT
else
if di Î SMT
MT repeats the processing on di , updates LMT
Restarts its execution from the operation, which requires di
endif
endif
dc = the data item requested by the next operation in LMT
end loop
where LMT = sequence of read operations in MT
SMT = set of data items have been accessed by MT

Correctness and implementation of modified UFO

Correctness
The schedules of the committed transactions produced from our algorithm are always serializable. To prove this, we will show that the serialization order between all committed mobile transactions and their conflicting update transactions will always be U ® MT, if the mobile transactions read the conflicting data items from the broadcast transaction.

Let MT, BT and U be mobile transaction, broadcast transaction and update transaction, respectively. If there is a data conflict between BT and U, and the broadcast of the conflicting data item is before the update of the data item, the serialization between BT and U will be BT ® U. According to our algorithm, the conflicting data item will be re-broadcast immediately and the serialization order will be reset to U ® BT. If the broadcast is after the update, the serialization order will be U ® BT. Since MT reads data items from BT, their serialization order will always be BT ® MT. Since serialization order is transitive, the serialization order between MT and U will always be U ® MT for the data conflict between MT and U and the conflicting data item is broadcast during the length of the broadcast transaction.

It is obvious to see that the currency of data items observed by mobile transactions can be maximized due to the data re-broadcast mechanism of our algorithm since all the data items which are broadcast within the length of the broadcast transaction are the most updated version.

Implementation
We discuss the implementation and characteristics of our proposed algorithm. This algorithm does not require any changes in the mobile clients except in getting re-broadcast data items. The main overheads of the our algorithm are:
Division of the execution of update transactions into two phases
Checking of the data sets of a broadcast transaction and an update transaction whenever an update transaction wants to enter the commit phase
Re-broadcast of conflicting data items if these items are broadcast before the start of the commit phase of the update transaction.
Dividing the execution of update transactions into two phases is trivial and should not incur much additional overhead. The overhead is for checking conflicting data sets. To speed up the checking process, the data items to be updated may be sorted according to their IDs.

The main overhead of this is data re-broadcast. The number of re-broadcast depends on the probability of data conflict which in turn depends on the broadcast schedule, arrival rate and the update pattern of the update transactions. The algorithm at the mobile clients is simple and does not incur much additional overhead for checking. The only additional work is to replace the old version of a data item in case it is re-broadcast.

The main advantages of our proposed algorithm are summarized below.

Consistency: It ensures that the execution schedules of the transactions are serializable.

Currency: It can maximize the currency of the data items read by mobile transactions by re-broadcast. In general, it can only provide the committed values at the last broadcast cycle as all the database updates are performed at the end of a broadcast cycle.

Broadcast algorithm: It can be applied with many other broadcast algorithms, which may only broadcast a subset of the data items in the database.

Conclusion
Data broadcast has been shown to be an efficient method for disseminating data items to transactions generated by mobile clients. If the broadcast of data items and the execution of update transactions are uncontrolled to maintain the validity of the data items at the database, mobile transactions may observe inconsistent data values. In this paper, we study the issue of concurrency control between update transactions and mobile transactions. Our proposed protocol uses ECA rules to make decisions on broadcasting without conflicting. Although the protocol is simple, it can effectively maintain the schedule between update and mobile transactions to be serializable and at the time maximize the currency of the data items observed by the mobile transactions. This system has an inference engine that makes deduction using forward chaining control flow to provide effective consistency checking during updates. The system discussed in this paper, provides site autonomy between the mobile clients and the server with minimum upstream communication and data consistency that are desirable features to the scalability of applications, which are running in broadcast environments.

2008-08-31T23:28:00.000-07:00

e-commerce

2008-08-31T23:27:00.000-07:00

e-commerce :- commerce of buying and selling products conducted over the internet and through web based application.

*Advantage of E-Commerce system:

You can reach customers around the globe instead of a limited geographic location.
You have the ability to be open twenty-four hours a day, seven days a week.
You can automate the process of taking and fulfilling orders.
In addition to automating the order taking, you can receive many more orders at one time than you can with one salesperson working at the physical store location.

* Tools used for E-Commerce application:
VS 2005.
SQL Server.
IIS
SSL Cerificate.

- The Microsoft Solution Framework (MSF) is a set of guidelines, principles, concepts, and proven practices for designing and engineering software applications with Microsoft technologies.
* How to gather information?
· Interview.
· Documentation:- Organizing the info. Collected from client in well manner and analyzing that information.
· Official Requirement for building any e-commerce application
§ Product Catalog.
§ Shopping Cart.
§ Paypal credit card handling.
§ Tracking Information.
§ Content Management System(CMS).
§ About Us.
§ Contact Form.
§ User Account/Login form.
§ Product of the Month.
This information is taken into consideration with the help of case study they have provided in book (Little Italy Vineyards-Sonoma Valley).

* Turning Sales into Profit:-

· Selling Main Products.
· Selling Affiliate (Connected or Related) products.
· Partnering with similar business.
· Creating a user membership.
· Selling advertising space.

* Risks Involved in e-commerce:-
· Supply for demand: Company unable to meet the orders due to less production as compared to demand..
· System downtime:- due to heavy traffic, many request to server.
· Payment processing: SSL certificate, use paypal processing system.
· Physical and logical attacks: Hacker stills the data, logical hack is the one in which hacker hacks the system or software ie it targets the code and the software.
· Sensitive information and data.

2008-08-25T21:02:00.000-07:00

Panda assigns a threat level to each virus in order to inform users about the type of risk a virus or other threat presents at any given moment. This means that the threat level can change with time.

The criteria used by Panda to determine the threat presented by a virus or other threat depends on: its distribution and the damage it can cause. Discover the new innovations in this gauge. The following diagram shows the different threat levels.
Low threat: the virus is neither damaging nor widely spread.

Moderate threat: the virus is either fairly widely spread and causes significant damage or not widely spread but causes serious damage.

High threat: the virus is either very widespread and causes damage or relatively widespread and seriously damaging.

Severe threat: the virus is widely spread and the virus is very damaging.
Logically, the threat level of a virus can vary, from low threat in one moment to severe in another, depending on how widespread it becomes. The Panda Threat Level monitors these changes in real-time.
[ top ]
Distribution
Indicates the spread of a virus. The more widespread a virus is, the higher the probability it has of infecting users' computers.
The distribution of a virus is determined by the infection rate, which measures the percentage of infected computers against the total number of computers scanned.
The distribution levels are as follows:
Epidemic: The percentage of computers examined and infected by the virus is more than 10%

High: The percentage of computers examined and infected by the virus is between 7.5% and 10%.

Medium: The percentage of computers examined and infected by the virus is more than 1.0% and less than 7.5%.

Low: Less than 1.0% of computers are infected by the virus.

[ top ]
Damage level
Indicates the possible damage a virus can cause in a computer.
This damage can be more or less severe: messages appearing on the screen, lost or altered information, collapsed systems, program malfunctions, etc.
The damage levels of a virus are:
Severe: causing serious damage. For example, the destruction or modification of files, formatting hard drives, sending information to third parties, generation of heavy traffic in servers, reducing system performance, opening security holes, permanent damage, etc.

High: causes moderate effects. All viruses, as inoffensive as they may seem, attempt to cause damage to the user. Those that do not result in destructive action are classified as simply moderately damaging. For example, those that create messages to appear on the screen.
The Panda Virus Laboratory establishes the level of damage when the virus in question is analyzed for the first time.
[ top ]
What makes the Panda Threat Level different?
This gauge was conceived to respond to genuine user concerns: What is the probability that I will be hit by a virus? If I am infected, what kind of damage can it cause?

Panda assigns a threat level to each virus automatically and objectively. Its final goal is to measure the type of threat a virus presents at a given moment, so that the proper preventive measures can be taken.

Panda gives more weight to the spread of a virus than to the damage it can cause, because the more widespread a particular virus is, the easier it is to become infected by it. All viruses attempts to harm a users computer no matter how slightly.

As opposed to other gauges, the Panda Threat Level is calculated in real-time, based on the continuous worldwide virus activity. If you notice that the value has changed since last you checked, it means that the virus is either expanding or decreasing.

Virus entry points

2008-08-25T21:01:00.002-07:00

Virus entry points

The infection techniques and software vulnerabilities exploited by viruses and other computer threats.
Internet

Networks

Removable Disks
If you want to prevent virus attacks, knowing how they can enter your system is a vital first step.

Internet

The Internet has become the most widely used form of sending and receiving information. Unfortunately, it also serves as the fastest way to spread viruses and other computer threats.
a) E-Mail. The most common way to spread a virus or other threat, and where almost 80 percent of virus infections originate. The biggest dangers of a virus spread through e-mail include:
Rapid transmission. One infected message can, in just a few minutes, infect thousands of computers.
Increased exploitation of inter-connected computers, as users can send and receive messages to and from any kind of computer or platform.
The sophisticated techniques used by modern viruses and other threats mean they can resend themselves to all the users in your address book, unleashing their infection when the message is opened or exploiting vulnerabilities in mail programs to run automatically.
All this points to the need to thoroughly protect possible network entry points, including communication ports and e-mail protocols (POP3 and SMTP).
b) Internet browsing. Some web pages use programs such as Java applets and ActiveX controls to make web pages more dynamic, but viruses and other threats can also infect these programs and spread to Internet surfers visiting infected sites.
Some new viruses and other threats have the ability to take advantage of security vulnerabilities in web servers, while some viruses can redirect users to pages that have already been infected.
c) File Transfer (FTP). The term FTP stands for File Transfer Protocol. This information exchange system makes it possible to save documents (upload) and copy files (download) from one computer to another, anywhere in the world. When a file is downloaded from an FTP site, it is copied directly to your computer. Files from FTP sites can harbor viruses or other threats which could then be downloaded into your system.
d) News Groups (News). Online newsgroups and interactive messages known as chat (IRC, ICQ, etc.) represent another security risk. These groups have similar functions allowing users to post messages for others to read and respond to. The posted messages can sometimes be infected with a virus.
[ top ]

Networks

Networks are valuable tools for groupwork and for sharing information throughout companies and organizations. However, they also greatly increase the number of entry points for viruses and other threats.
a) Shared disk. A computer can have one or more hard disks which can be shared with a number of users across a network. If these disks were infected, when other computers access the infected drive they would become infected as well, and vice versa.
b) Workstations. Users connected to a network carry out thousands of information transactions daily, both internally (within the network) and externally (outside the network and through the Internet). If not properly protected, each workstation becomes a liability, creating numerous potential entry points for infected files.
c) Servers. Servers allow a network to function; they facilitate the connections between workstations, location of files, e-mail management, outside communications, etc. However, they also use applications which can have vulnerabilities that can be exploited by viruses and other threats.
If a server is infected it can contaminate the workstations connected to a network instantaneously. Likewise, a server can be contaminated by a single workstation or other server.
d) Proxy servers and firewalls. These gateways create the boundaries of the network perimeter, through which all the information entering and leaving a network must pass. Viruses and other threats from outside the network enter the perimeter in the form of infected files or malicious code, passing from one server to another.
e) Viruses spread through networks. Certain viruses and other threats are designed specifically to spread across computer networks, infecting all possible areas of the IT infrastructure.
Although they share similar objectives, they often use different means to access a system: exploiting vulnerabilities in software, attacking certain file or mail servers, sneaking through proxy servers and firewalls.
In order to properly protect a network, both inbound and outbound traffic passing through the perimeter must be monitored. The biggest danger that viruses and other threats present is their ability to spread. So should a they enter the network, they must still be stopped from leaving.
This website offers network administrators specific advice to protect their systems. Other users should consult the practical tips section.
[ top ]

Disks (storage devices)

Disks are storage devices on which data is stored in the form of files, web pages (files with HTML, ASP. extensions), e-mail and downloaded Internet files, etc.
a) DVD and CD-ROM. Abundant memory and versatility make these disks compatible with a large variety of hardware and software, replacing traditional floppy disks. The increasingly widespread use of DVD and CD-ROM presents a potential danger.
b) Removable/extractable disk drives. A removable disk drive is a drive that allows users to move information from one computer to another by connecting an external drive. If the information on the drive is infected it can be spread from one computer to another.
c) Shared network drive. This is a shared drive located on one computer and connected to a network of computers. All of the computers on the network then have access to the shared drive. Logically, if the network drive becomes infected, so can all the computers that share it.
d) Zip and Jazz disks. These are portable disks that have a large capacity for storing data which has been compressed and minimized. If they are not properly protected they can also lead to virus transmission.
e) Floppy disks. These were once the most common form of spreading viruses but have been replaced by newer, more versatile disks. Still however, they do represent a significant risk in terms of spreading viruses. Floppy disks (or diskettes) for example, are the only known form of loading a boot virus into a computer, which can affect the system boot sector.

Transmission and camouflage techniques

2008-08-25T21:01:00.001-07:00

Transmission and camouflage techniques

How they spread. Where they hide.
Transmission

Camouflage

Vulnerabilities

New Tactics
Viruses and other threats are constantly evolving new disguises and ways to penetrate network security. As IT companies produce new applications, viruses and other threats seek out weaknesses and new entry points into systems and networks.

Transmission

Some of the more common ways for viruses and other threats to spread include:
Attaching HTML code in the AutoSignature of e-mail messages.
Installing and activating the virus when messages are viewed in the Preview Pane.
Sending code that, when the user opens an infected message, causes the execution of the infected file.
Exploiting flaws or vulnerabilities in Internet Explorer and the Outlook and Outlook Express mail clients.
Using network drives and directories to access information and resources shared by users.
Hiding in online file-sharing networks like Gnutella. General strategies used to spread viruses and other threats include gaining the confidence of users or deceiving people into downloading a file that appears to contain music, images, documents of interest etc. but is in fact infected.
In the immediate future, means of transmission will no doubt be created. There is already a type of virus that sends out text messages to GSM mobile phones and even cable TV systems may soon be at risk.
Today, not all files are susceptible to virus attacks or other types of attack, but this may change in the future. Once it was assumed that web pages could not spread viruses but we know now that this is possible.
[ top ]

Camouflage Techniques

Viruses disguise themselves from antiviruses and other security devices using a host of complex techniques:
a) Stealth. Viruses that use this technique hide the normal characteristics that would indicate their presence.
For example, the size of the file will normally increase when it is infected. However, by only inserting code in free file sections, this type of virus tricks the system by making it seem that the file size has not changed.
During file infections the date and time are registered as file modifications. However, when these viruses infect a file, they do not make such changes and the file date and time information will remain as it was before the infection.
To avoid suspicion, stealth viruses will hide some files and change their attributes so that they cannot be viewed.
b) Tunneling. The 'tunneling' system is quite complicated, as these viruses try to avoid detection by the antivirus software by directly intercepting the interrupt handlers of the operating system and effectively 'burying' under the detection software.
c) Armoring. Viruses that use the 'armoring' techniques disguise their code so that it cannot be read. To detect armored code, antiviruses must use heuristic scanning techniques.
d) Self-Encrypting. Antivirus programs search for certain tell-tale signs of virus activity such as groups of characters or instructions. These viruses encode or encrypt their code to make it more difficult for the antivirus program to detect them. However, modern antivirus solutions use algorithms to detect the encryption routine of these viruses.
e) Polymorphism. Polymorphic viruses encrypt their code in a different way with each infection (their signature changes from one infection to the next). They take encryption one step further by also encrypting the way (routine or algorithm) in which their signature is encrypted. This means that a polymorphic virus is capable of creating different variants of itself from one infection to the next, changing its 'shape' with each infection.
Fortunately, the virus cannot completely encrypt itself, as it needs to keep part of its original code unencrypted to be able to run. Antivirus programs can detect polymorphic viruses by locating the routine or algorithm that allow the virus to execute.
[ top ]

Vulnerabilities

Vulnerabilities are weaknesses or security holes in certain applications or software programs.
Attacks exploiting vulnerabilities have increased in frequency, especially those preying on the more commonly used programs and operating systems. Some of the most recent ones include:
a) Internet Explorer Vulnerabilities.
Cross-site scripting. Affects Internet Explorer (versions 5.01, 5.5 and 6.0), spreading viruses to users by executing malicious code through a web page or through e-mail in HTML format.
Additional Information: Microsoft Security Bulletin MS02-008.
Solution: Available on Microsoft website, under Knowledge Base article Q321323 and under Windows Update.
XMLHTTP Control Can Allow Access to Local Files. Allows access to local files by sending and receiving XML data in HTTP format. The problem arises from the way the XMLHTTP control configures Internet Explorer, giving access to local files.
Additional Information: Microsoft Security Bulletin MS02-008.
Solution: Available on Microsoft website under Knowledge Base article Q317244.
Incorrect VBScript Handling in IE can Allow Web Pages to Read Local Files. Permits an attacker to access frames in other domains through web pages or e-mails in HTML format. Internet Explorer does not correctly recognize the domain when using code written in Visual Basic Script programming language, making it possible for an attacker to access confidential information.
Additional Information: Microsoft Security Bulletin MS02-009.
Solution: Available on Microsoft website under Knowledge Base article Q318089.
Malformed Dotless IP Address Can Cause Web Page to be Handled in Intranet Zone. Gives attacker access to web pages on the Internet with low levels of security and allows them to redirect the computer to a predetermined website. Finally, it permits a malicious programmer to log on to remote sessions of Telnet through Internet Explorer.
Additional Information: Microsoft Security Bulletin MS01-051.
Incorrect MIME Header Can Cause IE to Execute E-mail attachment. A vulnerability preventing IE from interpreting HTML code correctly.
Additional Information and Solution: Microsoft Security Bulletin MS01-020. b) Outlook Vulnerabilities.
Outlook View Control Exposes Unsafe Functionality. For Outlook versions 98, 2000 and 2002, consists of ActiveX control that allows access to e-mail folders from a web page.
Additional Information and Solution: Microsoft Security Bulletin MS02-038.
Unchecked buffer in vCard Handler. Problem in Outlook Express and vcard manipulation allows an attacker to cause the client program to fail when a vcard is opened. Also allows execution of malicious code in the system which opens the vcard.
Additional Information and Solution: Microsoft Security Bulletin MS02-012.
Malformed E-mail Header. Permits remote execution of malicious code after opening a specially-crafted message sent by an attacker.
Additional Information and Solution: Microsoft Security Bulletin MS00-043, MS00-045 and MS00-046.
Virus Update for Outlook 2000 and 98. Not a vulnerability but a series of updates released by Microsoft to restrict access to executable files.
Security in Outlook in messages with attached unexecutable files. Automatic execution of a file attached to a message.
Additional Information and Solution: Microsoft Security Bulletin MS99-048.
c) Windows XP/2000 Pro/NT/Me/98/95 Vulnerabilities.
Authentication Flaw Could Allow Unauthorized Users To Authenticate To SMTP Service en Windows 2000 and Exchange 5.5. Exclusive to Windows 2000 Pro., this vulnerability allows messages to be sent without authorization through the SMTP mail server.
Additional Information and Solution: Microsoft Security Bulletin MS02-011.
Windows 2000 Security Rollup Package 1 (SRP1). Exclusive to Windows 2000 Pro. A patch that includes a series of improvements included since Windows 2000 Pro SP2.
ActiveX Parameter Validation. Exclusive to Windows 2000 Pro. Permits the running of malicious code or viruses from a web page or e-mail using ActiveX. Additional Information and Solution: Microsoft Security Bulletin MS00-085.
Microsoft VM ActiveX Component. For Windows 2000 Pro/NT/Me/98/95. Problems with Virtual Java Machine. The vulnerability could allow remote action to be taken on a computer.
Additional Information and Solution: Microsoft Security Bulletin MS00-075.
DOS Device in Path Name Vulnerability. For Windows 98/95. Vulnerability that could cause a user's system to crash, if they attempted to access a file or folder whose path contained certain reserved words.
Additional Information and Solution: Microsoft Security Bulletin MS00-017.
Autorun File. For Windows 98/95. Permits creation of a file called AUTORUN.INF in the root directory of any disk drive, allowing malicious programmers to execute files containing viruses or other threats.
Additional Information and Solution: To solve this problem substitute the value 0 for 1 in the Autorun key, found in the Windows Registry: HKEY_LOCAL_MACHINE\ SYSTEM\ CurrentControlSet\ Services\ Cdrom.
Program CMD.EXE - Buffer overflow. For Windows 2000 Pro/NT 4.0. Permits an attacker to consume all or part of the memory of an infected computer.
Additional Information and Solution: Microsoft Security Bulletin MS00-027.
d) Viruses, Threats and Vulnerabilities.
One of the most common vulnerabilities is found in Internet Explorer (versions 5.01 and 5.5). Viruses and other threats take advantage of the Microsoft browser to automatically run code when the message carrying the virus is viewed through the Preview Pane.
Other vulnerabilities have been found in Internet IIS and Apache servers, where viruses have been able to execute malicious code.
In the future, there is also a threat of the appearance of a virus that could take advantage of a vulnerability in the Winamp player, used for listening to sound files with MP3 extensions.
[ top ]

New Tactics

Viruses and other threats are constantly evolving into new forms and using more complicated techniques, increasing the risks to users. These recently detected viruses and threats are based on notably sophisticated technology:
SWF/LMF-926, the first virus that infects files with a SWF extension (Shockwave Flash).
Donut, pioneer virus designed to infect Microsoft's .NET platform files.
Dadinu, first e-mail worm to infect files with CLP extensions.
Kazoa, spreads using the popular file exchange program KaZaa.
Other examples infamously known for their advanced engineering include:
WorldCup (Chick.F) users the subject field and content of this infected message to dupe users into believing that the attached file contains the World Cup 2002 match results.
Gibe is sent through an e-mail message disguised as an update from Microsoft to fix various vulnerabilities.
Petlil.A sent as en e-mail message that attracts the attention of the receiver using erotic pictures.
Kazoa uses files that appear to be games, movies and music to infect users of KaZaa.

types of virus

2008-08-25T20:58:00.000-07:00

Types of virus

Computer viruses are often classified according to diverse criteria.
Resident
Multipartites

Direct Action
File infectors

Overwrite
Companion

Boot
FAT

Macro
Worms

Directory
Trojans

Encrypted
Logic Bombs

Polymorphic
False Viruses
Viruses can be classified using multiple criteria: origin, techniques, types of files they infect, where they hide, the kind of damage they cause, the type of operating system or platform they attack etc.
A single virus, if it is particularly complex, may come under several different categories. And as new viruses emerge, it may sometimes be necessary to redefine categories or, very occasionally, create new categories.
The following are the most common types of viruses:

Resident Viruses

This type of virus hides permanently in the RAM memory. From here it can control and intercept all of the operations carried out by the system: corrupting files and programs that are opened, closed, copied, renamed etc.
Resident viruses can be treated as file infector viruses. When a virus goes memory resident, it will remain there until the computer is switched off or restarted (waiting for certain triggers to activate it, such as a specific date and time). In the meantime it sits and waits in hiding, unless of course an antivirus can locate and eliminate it.
Examples include: Randex, CMJ, Meve, MrKlunky.

Direct Action Viruses

The principal aim of these viruses is to replicate and take action when they are run. When a specific condition is met, the virus will go into action and infect files in the directory or folder that it is in and in directories that are specified in the AUTOEXEC.BAT file path. This batch file is always located in the root directory of the hard disk and carries out certain operations when the computer is booted.
Files infected with this type of virus can be disinfected, and completely restored to their original condition.

Overwrite Viruses

This type of virus is characterized by the fact that it deletes the information contained in the files that it infects, rendering them partially or totally useless once they have been infected.
Infected files do not change size, unless the virus occupies more space than the original file, because instead of hiding within a file, the virus replaces the files content.
The only way to clean a file infected by an overwrite virus is to delete the file completely, thus losing the original content.
Some examples of overwrite viruses include: Way, Trj.Reboot, Trivial.88.D.

Boot Virus

This type of virus affects the boot sector of a floppy or hard disk. This is a crucial part of a disk, in which information on the disk itself is stored together with a program that makes it possible to boot (start) the computer from the disk.
This kind of virus does not affect files, but rather the disks that contain them. First they attack the boot sector of the disk then, once you start your computer, the boot virus will infect the hard drive of your computer.
The best way of avoiding boot viruses is to ensure that floppy disks are write-protected and never start your computer with an unknown floppy disk in the disk drive.
Some examples of boot viruses include: Polyboot.B, AntiEXE

Macro Virus

Macro viruses infect files that are created using certain applications or programs that contain macros. These include Word documents (DOC extensions), Excel spreadsheets (XLS extensions), PowerPoint presentations (PPS extensions), Access databases (MDB extensions), Corel Draw etc.
A macro is a small program that a user can associate to a file created using certain applications. These mini-programs make it possible to automate series of operations so that they are performed as a single action, thereby saving the user from having to carry them out one by one.
When a document containing macros is opened, they will automatically be loaded and may be executed immediately or when the user decides to do so. The virus will then take effect by carrying out the actions it has been programmed to do, often regardless of the program's built-in macro virus protection.
There is not just one type of macro virus, but one for each tool: Microsoft Word, Microsoft Excel, Microsoft PowerPoint, Microsoft Access, Corel Draw, Lotus Ami Pro, etc.
Some examples of macro viruses: Relax, Melissa.A, Bablas, O97M/Y2K.

Directory Virus

An operating system finds files by looking up the path (composed of the disk drive and directory) in which each file is stored.
Directory viruses change the paths that indicate the location of a file. By executing a program (file with the extension .EXE or .COM) which has been infected by a virus, you are unwittingly running the virus program, while the original file and program have been previously moved by the virus.
Once infected it becomes impossible to locate the original files.

Encrypted

Encryption is a technique used by viruses so that they cannot be detected by antivirus programs.
The virus encodes or encrypts itself so as to be hidden from scans, before performing its task it will decrypt itself. Once it has unleashed its payload the virus will then go back into hiding.
Examples of encrypted viruses include: Elvira, Trile.

Polymorphic Virus

Polymorphic viruses encrypt or encode themselves in a different way (using different algorithms and encryption keys) every time they infect a system.
This makes it impossible for antiviruses to find them using string or signature searches (because they are different in each encryption) and also enables them to create a large number of copies of themselves.
Some examples include: Elkern, Marburg, Satan Bug, Tuareg.

Multipartite Virus

These advanced viruses can create multiple infections using several techniques. Their objective is to attack any elements that can be infected: files, programs, macros, disks, etc.
They are considered fairly dangerous due to their capacity to combine different infection techniques.
Some examples include: Ywinz.

File Infectors

This type of virus infects programs or executable files (files with an .EXE or .COM extension). When one of these programs is run, directly or indirectly, the virus is activated, producing the damaging effects it is programmed to carry out. The majority of existing viruses belong to this category, and can be classified according to the actions that they carry out.

Companion Viruses

Companion viruses can be considered file infector viruses like resident or direct action types. They are known as companion viruses because once they get into the system they "accompany" the other files that already exist. In other words, in order to carry out their infection routines, companion viruses can wait in memory until a program is run (resident viruses) or act immediately by making copies of themselves (direct action viruses).
Some examples include: Stator, Asimov.1539, Terrax.1069.

FAT Virus

The file allocation table or FAT is the part of a disk used to connect information and is a vital part of the normal functioning of the computer.
This type of virus attack can be especially dangerous, by preventing access to certain sections of the disk where important files are stored. Damage caused can result in information losses from individual files or even entire directories.

Worms

A worm is a program very similar to a virus; it has the ability to self-replicate, and can lead to negative effects on your system and most importantly they are detected and eliminated by antiviruses. However, worms are not strictly viruses, as they do not need to infect other files in order to reproduce.
Worms can exist without damaging files, and can reproduce at rapid speeds, saturating networks and causing them to collapse.
Worms almost always spread through e-mail, networks and chat (such as IRC or ICQ). They can also spread within the memory of a computer.
Some examples of worms include: PSWBugbear.B, Lovgate.F, Trile.C, Sobig.D, Mapson.

Trojans or Trojan Horses

Another unsavory breed of malicious code are Trojans or Trojan horses, which unlike viruses do not reproduce by infecting other files, nor do they self-replicate like worms.
Trojans work in a similar way to their mythological namesake, the famous wooden horse that hid Greek soldiers so that they could enter the city of Troy undetected.
They appear to be harmless programs that enter a computer through any channel. When that program is executed (they have names or characteristics which trick the user into doing so), they install other programs on the computer that can be harmful.
A Trojan may not activate its effects at first, but when they do, they can wreak havoc on your system. They have the capacity to delete files, destroy information on your hard drive and open up a backdoor to your system. This gives them complete access to your system allowing an outside user to copy and resend confidential information.
Some examples of Trojans are: IRC.Sx2, Trifor.

Logic Bombs

They are not considered viruses because they do not replicate. They are not even programs in their own right but rather camouflaged segments of other programs.
Their objective is to destroy data on the computer once certain conditions have been met. Logic bombs go undetected until launched, and the results can be destructive.

False Viruses

These messages are often confused for viruses but are something else entirely. It is important to know the difference between a real virus threat and a false virus.
Hoaxes are not viruses, they are false messages sent by e-mail, warning users of a non-existent virus. The intention is to spread rumors causing panic and alarm among users who receive this kind of information.
Occasionally, hoax warnings include technical terms to mislead users. On some other occasions, the names of some press agencies are mentioned in the heading of the warnings. In this way, the hoax author attempts to trick users into believing that they have received a warning about a real virus. Hoaxes try to fool the user into performing a series of actions to protect themselves from the virus, sometimes leading to negative results.
Users are advised not to pay attention to these misleading warnings and delete these messages once received without sending them to others.

Symptoms of Virus Infection

2008-08-25T20:54:00.000-07:00

Symptoms of Virus Infection
. While reading this article you may sound the tips too childish but nevertheless they can be critical. So don't overlook them and read on.
10 virus symptoms
Programs take longer to load. Memory-intensive operations take a lot of time to start.
A change in dates against the filenames in the directory. When the virus modifies a file the operating system changes the date stamp.
The floppy disk or hard disk is suddenly accessed without logical reason.
Increased use of disk space and growth in file size-the virus attaches itself to many files.
Abnormal write-protect errors. The virus trying to write to a protected disk.
Strange characters appear in the directory listing of filenames.
Strange messages like "Type Happy Birthday Joshi" (Joshi Virus) or "Driver Memory Error" (kak.worm) appear on the screen and in documents.
Strange graphic displays such as falling letters or a bouncing ball appear on screen.
Programs may hang the computer or not work at all.
Junk characters overwrite text in document or data files.
Your guide to safe computing
Listed below are some of the steps recommended by experts to safeguard your PC from viruses. These are a compilation of my past experiences and magazine sources.
Write-protect your floppy disks when using them on other computers.
Remove floppy disks from drives while booting.
Change a setting in the BIOS that enables your PC to boot from the C-drive first.
Use a good anti-virus program to scan floppy disks before copying files. Recommended ones are Norton Antivirus 2000 and Mcaffee 5.
Install software only from original write-protected disks with the publisher’s label.
Do not install pirated software, especially computer games.
Activate watch-guard programs (monitors) that look out for suspicious activity.
Use the update service offered by software vendors and update the anti-virus software every month.
Scan the entire hard disk twice a month.
Scan files downloaded from the Internet or those transferred through a network.
Prepare a rescue disk with critical system files. Preferably, it should be bootable.
Keep the original CD-ROM or diskettes containing the operating system handy.

Anatomy of A Computer Virus

2008-08-25T20:53:00.000-07:00

Anatomy of A Computer Virus
The most common question asked by not-so-informative net audience is the definition of a computer virus. I may say that a computer virus is a type of legitimate program. So what is that makes a virus stand apart from the rest?
The one outstanding feature of a virus is that it sets out with the aim of reproducing itself. People usually associate viruses with other actions such as damaging a system by, for instance, destroying data but this is not essential for a program to be classed as a virus. For example the Tiny series of viruses are coded with small size as there main criteria and don't waste code with damage routines. Other viruses use large amounts of code to hide themselves and thus by not attracting attention to themselves try to ensure there longevity. The name was given to this piece of malicious code due to its inherent ability to reproduce itself. So even if you have a piece of code that does nothing harmful to the system but keeps on making copies of itself then it can be branded as a computer virus.
Note:
By code, I mean any software written in any programming language. It may be legitimate or otherwise. This word will be in frequent use in further articles also.
The Tiny series is a category of computer viruses which get its name due to its small size (<1kb)
Now let us study the anatomy of a basic class of viruses. These properties are inherent of most viruses though the level of adaptation may differ from species to species. I can say that a virus has basically three parts
Replicator - The replicators job is to ensure the survival of the virus on a system. Most successful viruses do this by not inflicting damage on the system but by appending themselves to legitimate programs in the machine. Each time the program is run then the virus will 'wake up' and start to reproduce. As said earlier, this is the most important part of the virus code.
Concealer - This part of the virus has the job of hiding the virus. It uses a number of methods to do this but the point is if you don't know a virus is there then you wont try and kill it. Today's viruses use advance techniques to stop being caught from Antivirus software.
Payload - The payload of a virus can be practically anything, in fact if it can be programmed then it can be the payload. If a virus is going to have a long life then any damage it causes must either be very slight or not take place for a long period after infection. If an obvious payload gets delivered soon after infection then the user is soon going to notice and will go virus hunting. This does not help the long life or wide spread of a virus.

Trojans: The Method of Infection

2008-08-25T20:50:00.000-07:00

The most simple method is to send a trojan via email. So you receive a message saying that a wonderful file is attached and it will coerce you to click on it. This one is for dumb heads. I assume you are not one of those who click every attachment without scanning it with an up-to-date AV.
Secondly, you may receive a file from someone you know and the file looks harmless enough. On clicking you find a small application running, so you rest assured that the file was not a trojan. Here is where the ingenuity of the hacker comes into play. What he does is that he joins the trojan horse with an harmless application. . Such joiners are widely available on the Net. (If you want one, try Joiner). He designs a new icon for it using Micro Angelo. If he uses sub 7, the best and the most dangerous trojan according to me, then the latest version comes with an inbuilt icon changer. So one can easily assign a mp3 icon to a sub 7 server. (More on sub seven later)
If you are an experienced net user (I assume male, though I am not gender biased), you can easily restrict yourself from falling prey to above methods. But can you resist the feminine charm? This is one of the most widely used and successful means to catch a prey who is not a fool. For this, you need ICQ (I don't need to tell you about this, right?). So you may meet someone on random chat claiming to be a sultry babe from Amsterdam. She arouses your erotic senses and then says that she wishes to send you an erotic photo of herself. Naturally, no male (Here I am talking about normal males, not those rare ones who can resist such a temptation) would like to miss such an opportunity. So you get an incoming file request, say pic.jpg. Now you know that trojan has to be an .EXE file, so this cannot be one. So you receive it and click it.
The file is indeed a Jpg file joined with a trojan. But it is a fact that though you can bind an exe file to a Jpg one, the final file has to be an exe. What the hacker does is that he renames the file as pic.jpg.exe. ICQ shows this as pic.jpg. So you end up making a fool of yourself.
These are not the only ways. New ingenious ways are being designed by thinking minds to get better of you. So keep your senses wide awake when dealing with someone unknown on the Net.

hacking

2008-08-25T20:44:00.000-07:00

The term "hacking" in the 1980's became a buzzword in the media which was taken to be derogatory and which by misuse and overuse was attached to any form of socially non-acceptable computing activity outside of polite society. Within this context "hackers" were assumed to be the fringe society of the computing fraternity, mainly characterized as "youngsters" who did not know any better and who had obtained access to a technology with which they terrorized the world of communications and computing. To be tagged as a "hacker" was to portray a person as member of a less than acceptable group of near criminals whose activities were not be to be undertaken by the upright citizenry.
This was not the view of educated and knowledgeable computer or security professionals. This was the work of the media that created the existence of a hypothetical class of individuals who can then be branded as villains of the cyber era. This built on and the true meaning of the word and the intentions of this class was totally sidetracked.
Hackers are not criminals. They don't have intentions to damage or cause loss. They originated from the class of people who had an intrinsic thirst for knowledge. They wanted to stop at no point for gaining knowledge and letting the world benefit from their knowledge. Many historians will agree to the fact that knowledge always has been dangerous. People like Galileo, Pythagoras, etc had been banned because of the knowledge they possessed which was contradictory to popular belief. Same is the case with hackers. They possess that knowledge which others don't want them to possess.
Hackers are driven by curiosity. They have the urge to win. That makes them more aggressive, more intent and hence more dangerous, not to cyber society but to those narrow minded individuals.
Hacking and cracking are activities that generate intense public interest. Whenever anyone reads that some site was hacked into, some people get delighted, some don't. People who are delighted are those who don't have anything to do with such sites or with the Internet on the whole. Or they may be the persons who were responsible for the incident. Those who didn't excite were those people who are skeptical of this cyber world but still cannot live without it. Also the security world wakes up from sleep.

Viruses – Types and Examples

2008-08-25T20:41:00.000-07:00

Viruses – Types and Examples
I assume that you have become familiar with the definition and anatomy of a computer virus. As in medicine, in cases of Computer viruses too we have specialization depending on area of infection and amount of damage. So let us study the basic category of viruses.
Types of viruses
Boot viruses: These viruses infect floppy disk boot records or master boot records in hard disks. They replace the boot record program (which is responsible for loading the operating system in memory) copying it elsewhere on the disk or overwriting it. Boot viruses load into memory if the computer tries to read the disk while it is booting.Examples: Form, Disk Killer, Michelangelo, and Stone virus
Program viruses: These infect executable program files, such as those with extensions like .BIN, .COM, .EXE, .OVL, .DRV (driver) and .SYS (device driver). These programs are loaded in memory during execution, taking the virus with them. The virus becomes active in memory, making copies of itself and infecting files on disk.Examples: Sunday, Cascade
Multipartite viruses: A hybrid of Boot and Program viruses. They infect program files and when the infected program is executed, these viruses infect the boot record. When you boot the computer next time the virus from the boot record loads in memory and then starts infecting other program files on disk.Examples: Invader, Flip, and Tequila
Stealth viruses: These viruses use certain techniques to avoid detection. They may either redirect the disk head to read another sector instead of the one in which they reside or they may alter the reading of the infected file’s size shown in the directory listing. For instance, the Whale virus adds 9216 bytes to an infected file; then the virus subtracts the same number of bytes (9216) from the size given in the directory.Examples: Frodo, Joshi, Whale
Polymorphic viruses: A virus that can encrypt its code in different ways so that it appears differently in each infection. These viruses are more difficult to detect.Examples: Involuntary, Stimulate, Cascade, Phoenix, Evil, Proud, Virus 101
Macro Viruses: A macro virus is a new type of computer virus that infects the macros within a document or template. When you open a word processing or spreadsheet document, the macro virus is activated and it infects the Normal template (Normal.dot)-a general purpose file that stores default document formatting settings. Every document you open refers to the Normal template, and hence gets infected with the macro virus. Since this virus attaches itself to documents, the infection can spread if such documents are opened on other computers.Examples: DMV, Nuclear, Word Concept.
Active X: ActiveX and Java controls will soon be the scourge of computing. Most people do not know how to control there web browser to enable or disable the various functions like playing sound or video and so, by default, leave a nice big hole in the security by allowing applets free run into there machine. There has been a lot of commotion behind this and with the amount of power that JAVA imparts, things from the security angle seem a bit gloom.
These are just few broad categories. There are many more specialized types. But let us not go into that. We are here to learn to protect our self, not write a thesis on computer virus specification.

deepu-bangalore kaaaaa bull bullll

2008-08-22T22:26:00.000-07:00

friends

2008-08-22T22:24:00.000-07:00

2008-08-22T22:22:00.000-07:00

2008-08-22T22:19:00.000-07:00

2008-08-22T22:15:00.000-07:00

2008-08-22T22:11:00.000-07:00

2008-08-22T22:07:00.000-07:00

2008-08-22T22:03:00.000-07:00

2008-08-22T22:01:00.000-07:00

2008-08-22T21:58:00.000-07:00

2008-08-22T21:55:00.000-07:00

2008-08-22T21:52:00.000-07:00

happy independance day

2008-08-15T21:18:00.000-07:00

Mountbatten arrives at Delhi airport; received by Nehru and Liaquat Ali. March 25, 1947 1948: The news of Gandhi's assassination hits the streets. A stunned crowd gathers in Calcutta.
1948: Crowds in New Delhi wait for a glimpse of Gandhi's funeral procession
A Library being divided at the time of partition. Heart trembles to see this sight and it is tough to imagine the state of the nation at the moment when people needed to hold hands.

This is our 60th Independence Day!
Freedom is not a Right but a Feeling!
Let's be proud to feel the Freedom!
Let's say loud we are INDIANS!!!

Let all of us get to-gather &
Let's Celebrate Our Freedom!

It is our duty to preserve this Freedom!
Carry this forward to the future!
We did,We do,We will do!!!

Set the celebration on Air, Share your Joy, You're Free to do it, Send this to every Indian, to say
Vande Mataram!
Jai Hind

2008-08-15T21:13:00.000-07:00

TRAIN TO PAKISTAN; India 1947. Trains packed with refugees - Hindus and Sikhs headed for India, and Muslims headed for Pakistan - were convenient targets for gangs of killers on both sides of the border. Inadequately protected 'Refugee Specials' were typically stopped, and the occupants butchered, several times in the course of the journey. The dead - Punjab, 1947

1971: Indira Gandhi reviews the troops, in the context of militaryand diplomatic preparations for the Bangladesh War.
Ghandhiji Addressing people
Nehru and Gandhi at AICC meeting, July 1946

2008-08-15T21:11:00.000-07:00

PROUD TO BE AN INDIAN . JAI HIND
Aug. 15, 1947: Mountbatten swears Nehru in as Prime Minister of India

2008-08-15T21:08:00.000-07:00

do you know

2008-08-14T02:46:00.001-07:00

2008-08-14T02:39:00.000-07:00

common characters in an office

2008-08-14T02:33:00.000-07:00

2008-08-14T02:30:00.000-07:00

2008-08-14T02:27:00.000-07:00

top ten secrets

2008-08-14T02:20:00.000-07:00

2008-08-14T02:19:00.000-07:00

2008-08-14T02:17:00.000-07:00

2008-08-14T02:16:00.000-07:00

2008-08-14T02:15:00.000-07:00

2008-08-14T02:13:00.000-07:00

2008-08-14T02:10:00.000-07:00

2008-08-14T02:08:00.000-07:00

2008-08-13T23:32:00.000-07:00

software depression life cycle

2008-08-13T23:23:00.000-07:00

2008-08-13T23:22:00.000-07:00

2008-08-13T23:21:00.000-07:00

2008-08-13T23:17:00.000-07:00

keep hopes

2008-08-13T23:03:00.001-07:00

happy rakhi

2008-08-13T23:03:00.000-07:00

2008-08-13T23:01:00.000-07:00

2008-08-13T22:59:00.000-07:00

2008-08-13T22:52:00.000-07:00

2008-08-13T22:50:00.000-07:00

2008-08-13T22:49:00.000-07:00

2008-08-13T22:40:00.000-07:00

mail me

2008-08-13T22:33:00.000-07:00

HI
When you are very busy, but still want to keep in touch, guess what you do - you forward mails! When you have nothing to say, but still want to keep in contact, you forward mails!
To let you know that: you are still remembered, you are still important, you are still loved, you are still cared for, you are still wanted, guess what you get? A forwarded mail from me.

So my friend, next time if you get a mail , don't think that I have sent you just a mail, but that...

I Have Thought of You Today!

2008-08-13T22:23:00.000-07:00

When you have something to say, but don't know what, and don't know how, you forward mails! Sometimes, we Wonder why friends keep forwarding mails, maybe this could explain:

To let you know that: you are still remembered, you are still important, you are still loved, you are still cared for, you are still wanted, guess what you get? A forwarded mail from me.

raasi falalu

2008-08-13T22:18:00.000-07:00

manasu peru

2008-08-13T22:15:00.000-07:00

vira boosina vennala nee kavvimpu
chiru galito rammani kaburampi jo kotta nela
neevu naa kanuleduta undaga ne nidurincha jaala noo..priya.....................

2008-08-02T00:35:00.000-07:00

when u r looking for a friend don't look for perfection
just look for friendship
give the whole heart to ur lover they will break it.
give the broken heart to ur frind they will make it.
that is friendship.

who is a friend?

2008-08-02T00:31:00.000-07:00

A push when u r stopped
a touch when u r lost
a word when u r quiet
a smile when u r sad
and a shoulder when u cry.

friendship day

2008-08-01T22:18:00.000-07:00

Hi Friends,

Give thousand chances to your enemy to become your friend, But don ' t give a single chance to your friend to become your enemy '

seven

2008-07-30T02:45:00.000-07:00

ఆకాశంలో హరివిల్లు
శ్రుథి చేసిన సరిగమలు
సప్థ స్వరాల మధురిమలు
aakaaSamloe harivillu
Sruthi cheasina sarigamalu
saptha swaraala madhurimalu

kurulu

2008-07-28T21:33:00.000-07:00

nee kurula jaDi vaana loe
nea taDichi muda&davaga
naa manasu jalapaatamei ooyala loogagaa

నీ కురుల జడి వాన లో
నే తడిచి ముదదవగ
నా మనసు జలపాతమై ఊయల లూగగా

veena venuvu

2008-07-28T21:25:00.000-07:00

వీణ వేణువైన సరిగమ వినావ
తీగ రాగమైన మదురిమ కనావ
veeNa veaNuvaina sarigama vinaava
teega raagamaina madurima kanaava

STRESS TEST

2008-07-19T03:12:00.000-07:00

Do u want to c best Drunken Conversation

2008-07-19T03:09:00.001-07:00

best Drunken Conversation