From The Desk of HOD

Keeping with the motto of Acquire Knowledge and Grow, under patronage of our Director,
Dr. R.K. Agarwal, department has published the Vol. 7, No. 1 a half-yearly Journal. The aim
of publishing Journal of Computer Application (JCA) is to inculcate habit of writing and
reading a technical paper among faculty and students. Topics and contents have been selected
to educate our students on current state of the art technology of common applications in
simplistic manner without going through the mathematical details. Length of topics have
deliberately been kept very short to accommodate most of the writers, and keep the interest of
readers as well. My sincere appreciation to all writers specially to students of MCA department.
Enjoy the reading and kindly offer your valuable suggestion for improvement in our subsequent
issues.

Looking ahead for your support.

Prof. S. L. Kapoor

1
 CONTENTS

S. No. TITLE Page No.

1 Pro*C Embedded SQL 5-7

Dr. B.K. Sharma, Professor, MCA department, AKGEC, GZB

2 ORIENTDB – Use for Handling Graph Database 8-9

Snehlata Kaul, Assistant Professor, AKGEC, Ghaziabad

3 Green Computing 10-12

Saroj Bala, Assistant Professor, AKGEC, Ghaziabad

4 Li-Fi (Light Fidelity)-The future technology In Wireless communication 13-15

Harnit Saini, Assistant Professor, AKGEC, Ghaziabad

5 An Efficient Indexing Tree Structure For Multidimensional Data On Cloud 16-18

Mani Dwivedi, Assistant Professor, AKGEC, Ghaziabad

6 Mobile cloud computing Integration: Architecture, Applications, and Approaches 19-23

Anjali Singh, Assistant Professor, AKGEC, Ghaziabad

7 Towards Developing Reusable Software Components 24-26

Aditya Pratap Singh, Assistant Professor, AKGEC, Ghaziabad

8 Genetic Algorithm Framework for Parallel Computing Environments 27-29

Ruchi Gupta, Assistant Professor, AKGEC, Ghaziabad

9 A Survey on Big Data and Mining 30-32

Dheeraj Kumar Singh, Assistant Professor, AKGEC, Ghaziabad

10 Mobile Cyber Threats 33-37

Arpna Saxena, Assistant Professor, AKGEC, Ghaziabad

11 Applications of Palm Vein Authentication Technology 38-40

Indu Verma, Assistant Professor, AKGEC, Ghaziabad

12. PON Topologies for Dynamic Optical Access Networks 41-43

Sanjeev K. Prasad, Assistant Professor, AKGEC, Ghaziabad

13 An Overview of Semantic Search Systems 44-46

Dr. Pooja Arora, Assistant Professor, AKGEC, Ghaziabad

13 A Soft Introduction to Machine Learning 47-48

Anurag Sharma, Student, MCA Department

3
 PRO*C EMBEDDED SQL
Dr. B.K. Sharma
Professor, MCA Department, AKGEC, GZB
Email : bksharma888@yahoo.com

Abstract–The Pro*C/C++ precompiler enables you to create EXEC SQL SELECT salary INTO :a
applications that access your Oracle database whenever rapid FROM Employee
development and compatibility with other systems are your WHERE SSN = THE_SSN;
priorities.The Pro*C/C++ programming tool enables you to
embed Structured Query Language (SQL) statements in a C or
2. HOST VARIABLES
C++ program. The Pro*C/C++ precompiler translates these
statements into standard Oracle runtime library calls, then
generates a modified source program that you can compile, Host variables are the key to the communication between the
link, and run in the usual way. host program and the database. A host variable expression
must resolve to an lvalue (i.e., it can be assigned). You can
1. INTRODUCTION: declare host variables according to C syntax, as you declare
Embedded SQL is a process of combining the computing power regular C variables. The host variable declarations can be
of a high-level language like C / C++ with the database placed wherever C variable declarations can be placed. The C
manipulation capabilities of SQL. It allows you to execute all datatypes that can be used with Oracle include:
SQL statement from an application program. Oracle's embedded z char
SQL environment is called Pro*C. z char[n]
z int
A Pro*C program is compiled in two steps. First, the Pro*C z short
precompiler recognizes the SQL statements embedded in the z long
program and replaces them with appropriate calls to the z float
functions in the SQL runtime library. The output is pure C/C++ z double
code with all the pure C/C++ portions intact. Then, a regular C/ z VARCHAR[n] - This is a psuedo-type recognized by the
C++ compiler is used to compile the code and produces the Pro*C precompiler. It is used to represent blank-padded,
executable. variable-length strings. Pro*C precompiler will convert
it into a structure with a 2-byte length field and a n-byte
Pro*C Syntax character array.
All SQL statements need to start with EXEC SQL and end with
a semicolon ";". The SQL statements can place anywhere within 2.1 Pointers
a C/C++ block with the standard procedure of programming You can define pointers using the regular C syntax, and use
that is the restriction that the declarative statements do not them in embedded SQL statements. As usual, prefix them with
come after the executable statements. As an example: a colon:
{ int *x;
int a; /* ... */
EXEC SQL SELECT salary INTO :a EXEC SQL SELECT xyz INTO :x FROM ...;
FROM Employee The result of this SELECT statement will be written into *x,
WHERE SSN=876543210; not x.
printf("The salary is %d\n", a); Structures
} Structures can be used as host variables, as illustrated in the
following example:
Preprocessor Directives typedef struct {
The C/C++ preprocessor directives that work with Pro*C are char name[21]; /* one greater than column length;
#include and #if. Pro*C does not recognize #define. For for '\0' */
example, the following code is invalid: int SSN;
#define THE_SSN 876543210 } Emp;

5
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
/* ... */
Emp bigshot;
/* ... */
EXEC SQL INSERT INTO emp (ename, eSSN)
VALUES (:bigshot);
2.2 Arrays
Host arrays can be used in the following way:
int emp_number[50];
char name[50][11];
/* ... */
EXEC SQL INSERT INTO emp(emp_number, name)
VALUES (:emp_number, :emp_name);
which will insert all the 50 tuples in one go.
Arrays can only be single dimensional. The example char
name[50][11] would seem to contradict that rule. However,
Pro*C actually considers name a one-dimensional array of
strings rather than a two-dimensional array of characters. You
can also have arrays of structures.
When using arrays to store the results of a query, if the size of
the host array (say n) is smaller than the actual number of
tuples returned by the query, then only the first n result tuples
will be entered into the host array.
2.3 Indicator Variables
Indicator variables are essentially "NULL flags" attached to
host variables. You can associate every host variable with an
optional indicator variable. An indicator variable must be
defined as a 2-byte integer (using the typeshort) and, in SQL
statements, must be prefixed by a colon and immediately follow
its host variable. Or, you may use the keyword INDICATOR in
between the host variable and indicator variable. Here is an
example:
short indicator_var;
EXEC SQL SELECT xyz INTO :host_var:indicator_var
FROM ...;
/* ... */
EXEC SQL INSERT INTO R
VALUES(:host_var INDICATOR :indicator_var, ...);
You can use indicator variables in the INTO clause of a SELECT
statement to detect NULL's or truncated values in the output
host variables.
3. DATATYPE EQUIVALENCING
Oracle recognizes two kinds of datatypes: internal and external.
Internal datatypes specify how Oracle stores column values
in database tables. External datatypes specify the formats
used to store values in input and output host variables. At
precompile time, a default Oracle external datatype is assigned
to each host variable. Datatype equivalencing allows you to
override this default equivalencing and lets you control the
way Oracle interprets the input data and formats the output
data.
6
The equivalencing can be done on a variable-by-variable basis
using the VAR statement. The syntax is:
EXEC SQL VAR <host_var> IS <type_name> [ (<length>) ];
For example, suppose you want to select employee names from
the emp table, and then pass them to a routine that expects C-
style '\0'-terminated strings. You need not explicitly '\0'-terminate
the names yourself. Simply equivalence a host variable to the
STRING external datatype, as follows:
char emp_name[21];
EXEC SQL VAR emp_name IS STRING(21);
The length of the ename column in the emp table is 20 characters,
so you allot emp_name 21 characters to accommodate the '\0'-
terminator. STRING is an Oracle external datatype specifically
designed to interface with C-style strings. When you select a
value from the ename column into emp_name, Oracle will
automatically '\0'-terminate the value for you.
You can also equivalence user-defined datatypes to Oracle
external datatypes using the TYPE statement. The syntax is:
EXEC SQL TYPE <user_type> IS <type_name> [ (<length>) ]
[REFERENCE];
You can declare a user-defined type to be a pointer, either
explicitly, as a pointer to a scalar or structure, or implicitly as an
array, and then use this type in a TYPE statement. In these
cases, you need to use the REFERENCEclause at the end of
the statement, as shown below:
typedef unsigned char *my_raw;
EXEC SQL TYPE my_raw IS VARRAW(4000) REFERENCE;
my_raw buffer;
/* ... */
buffer = malloc(4004);
Here we allocated more memory than the type length (4000)
because the precompiler also returns the length, and may add
padding after the length in order to meet the alignment
requirement on your system.
4. DYNAMIC SQL
While embedded SQL is fine for fixed applications, sometimes
it is important for a program to dynamically create entire SQL
statements. With dynamic SQL, a statement stored in a string
variable can be issued. PREPAREturns a character string into
a SQL statement, and EXECUTE executes that statement.
Consider the following example.
char *s = "INSERT INTO emp VALUES(1234, 'jon', 3)";
EXEC SQL PREPARE q FROM :s;
EXEC SQL EXECUTE q;
Alternatively, PREPARE and EXECUTE may be combined into
one statement:
char *s = "INSERT INTO emp VALUES(1234, 'jon', 3)";
EXEC SQL EXECUTE IMMEDIATE :s;

TransactionsOracle PRO*C supports transactions as defined
by the SQL standard. A transaction is a sequence of SQL
statements that Oracle treats as a single unit of work. A
transaction begins at your first SQL statement. A transaction
ends when you issue "EXEC SQL COMMIT" (to make
permanent any database changes during the current
transaction) or "EXEC SQL ROLLBACK" (to undo any changes
since the current transaction began). After the current
transaction ends with your COMMIT or ROLLBACK
statement, the next executable SQL statement will automatically
begin a new transaction.
If your program exits without calling EXEC SQL COMMIT, all
database changes will be discarded.
Error HandlingAfter each executable SQL statement, your
program can find the status of execution either by explicit
checking of SQLCA, or by implicit checking using the
WHENEVER statement. These two ways are covered in details
below.
5. SQLCA
SQLCA (SQL Communications Area) is used to detect errors
and status changes in your program. This structure contains
components that are filled in by Oracle at runtime after every
executable SQL statement.
6. WHENEVER STATEMENT
This statement allows you to do automatic error checking and
handling. The syntax is:
EXEC SQL WHENEVER <condition> <action>;
Oracle automatically checks SQLCA for <condition>, and if
such condition is detected, your program will automatically
perform <action>.
<condition> can be any of the following:
z SQLWARNING - sqlwarn[0] is set because Oracle
returned a warning
z SQLERROR - sqlcode is negative because Oracle returned
an error
7
Object Recognition Techniques for Digital Images
z NOT FOUND - sqlcode is positive because Oracle could
not find a row that meets your WHERE condition, or a
SELECT INTO or FETCH returned no rows
Examples of the WHENEVER statement:
EXEC SQL WHENEVER SQLWARNING DO
print_warning_msg();
EXEC SQL WHENEVER NOT FOUND GOTO handle_empty;
7. CONCLUSIONS
Pro*C is a precompiler enables you to create applications that
access your Oracle database. This tool is enables you to embed
Structured Query Language (SQL) statements in a C or C++
program.
8. REFERENCES
[1] Database Systems: The Complete Book by Hector Garcia,
Jeff Ullman, and Jennifer Widom.
[2] A First Course in Database Systems by Jeff Ullman and
Jennifer Widom.
Gradiance SQL Tutorial
[3] https://docs.oracle.com/cd/B28359_01/appdev.111/
b28427.pdf
[4] https://docs.oracle.com/cd/E11882_01/appdev.112/
e10825.pdf
ABOUT THE AUTHORS
Dr. B. K. Sharma is a Professor and Dean
Hostel of Ajay Kumar Garg Engineering
College, Ghaziabad. He obtained his
MCA degree from JNU, New Delhi,
M.Tech. from Guru Gobind Singh
Indraprastha University, Delhi and Ph.D.
from Shobhit University, Meerut. His
areas of specialization are Software
Watermarking, Discrete Mathematics,
Theory of Computation and Compiler Design. During his career
of more than decade in the teaching, he has published many
Research papers in International/National Journals/
Conferences. He has also published many books for
engineering students.
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
ORIENTDB – USE FOR HANDLING
GRAPH DATABASE
Snehlata Kaul
Assistant Professor, MCA Department
Email Id : sneha8kaul@yahoo.co.in
ABSTRACT – Data Management is not now to manage and text
data, it is beyond it. At present we need to manage the multi-
media, dynamic and swiftly embryonic nature of data which
contain text, numbers, audio, video, graphics images etc..
Through this article I would like to discuss the multi-model
database, the “OrientDB” which support the graphic data.
1. INTRODUCTION
In computing, a graph database is a database that uses graph
structures for semantic queries with nodes, edges and
properties to represent and store data. Graph databases employ
nodes, properties, and edges. To mange this type of data
different graph databases products are intriguing a prominent
roles as well.
Neo4j, OrientalDB, InfiniteGraph and AllegroGraph are some
of the graph databases. Through this article I will try to discuses
one of the latest Graph databases “OrientDB”, the NOSQL
database[2].
The aim of this article is to guide the reader through
understanding what are the most interesting features that
OrientDB brings on the table out-of-the-box and how, melding
them altogether, this database differs from traditional relational
systems and other NoSQL products, being it document DBs
like MongoDB or key-value stores like Redis or Memcache.
2. ORIENTDB –LET US START
OrientDB is a graph database written in Java, mainly developed
by Luca Garulli,AssetData’s CTO. It a 2nd Generation
Distributed Graph Database with the flexibility of Documents
in one product with an Open Source commercial friendly license
(Apache 2 license), which overcome lacing feature of handling
Big data of the First generation Graph Databases.
OrientDB is incredibly fast: it can store 220,000 records per
second on common hardware. Even for a Document based
database, the relationships are managed as in Graph Databases
with direct connections among records.[1]
2.1. Features of OrientDB
Fully transactional:
Supports ACID transactions guaranteeing that all database
transactions are processed reliably and in the event of a crash
8
all pending documents are recovered and committed.
Graph structured data model:
Native management of graphs. Fully compliant with the Apache
TinkerPop Gremlin (previously known as Blueprints) open
source graph computing framework.[2]
3. ORIENTDB- WORING WITH GRAPH
In graph databases, the database system graphs data into
network-like structures consisting of vertices and edges. In
the OrientDB Graph model, the database represents data
through the concept of a property graph, which defines a vertex
as an entity linked with other vertices and an edge, as an entity
that links two vertices.
OrientDB ships with a generic vertex persistent class, called V,
as well as a class for edges, called E.
In effect, the Graph model database works on top of the
underlying document model. But, in order to simplify this
process, OrientDB introduces a new set of commands for
managing graphs from the console.[3]
4. ORIENTDB- THE GRAPH MODEL
A graph represents a network-like structure consisting of
Vertices (also known as Nodes) interconnected by Edges (also
known as Arcs). OrientDB's graph model is represented by the
concept of a property graph, which defines the following:
Vertex - an entity that can be linked with other Vertices and
has the following mandatory properties:
z unique identifier
z set of incoming Edges
z set of outgoing Edges
Edge - an entity that links two Vertices and has the following
mandatory properties:
z unique identifier
z link to an incoming Vertex (also known as head)
z link to an outgoing Vertex (also known as tail)
z label that defines the type of connection/relationship
between head and tail vertex
In addition to mandatory properties, each vertex or edge can
also hold a set of custom properties. These properties can be
 Genetic Programming Approach for Reverse Engineering

defined by users, which can make vertices and edges appear
similar to documents.
OrientDB-GRAPH CONSISTENCY Before OrientDB, the
graph consistency could be assured only by using
transactions. The problems with using transactions for simple
operations like creation of edges are:
Speed, the transaction has a cost in comparison with non-
transactional operations
Management of optimistic retry at application level.
Furthermore, with 'remote' connections this means high latency
Low scalability on high concurrency (this will be resolved in
OrientDB v3.0, where commits will not lock the database
anymore)
any conflicts are caught transparently by OrientDB and the
operations are repeated. The operations that support the auto-
retry are:
CREATE EDGE
DELETE EDGE
DELETE VERTEX
3. CONCLUSION
OrientedDB is Fully transactional, supports ACID transactions
guaranteeing that all database transactions are processed
reliably and in the event of a crash all pending documents are
recovered and committed.[4]
Graph structured data model provide
inhabitant management of graphs. Fully compliant with the
Apache TinkerPop Gremlin (previously known as Blueprints)
open source graph computing framework..

As of OrientDB provides a new mode to manage graphs without 3. REFERENCE:

using transactions. It uses the Java class OrientGraphNoTx or [1] "Multi-Model Database - OrientDB Manual [2] Jump up
via SQL by changing the global setting sql.graph to: a b "Popularity ranking of database management
ConsistencyMode to one of the following values: systems". db-engines.com. Solid IT. Retrieved 2015-07-
04.
tx, the default, uses transactions to maintain consistency. This [3] Apache Software Foundation. "Apache CouchDB".
was the only available setting before OrientDB Retrieved 15 April 2012.
[4] Oracle NoSQL High Availability
notx_sync_repair, avoids the use of transactions. Consistency,
in case of a JVM crash, is guaranteed through a database ABOUT THE AUTHORS
repair operation, which runs at startup in synchronous mode. Snehlata Kaul is working as an Assistant
The database cannot be used until the repair is finished. Professor in Ajay Kumar Garg
Engineering College, Ghaziabad, U.P
notx_async_repair, also avoids the use of transactions. (India). She has obtained her MCA from
Consistency, in case of JVM crash, is guaranteed through a DR. B. R. Ambedkar Marathwada
database repair operation, which runs at startup in University, Aurangabad, Maharashtra
asynchronous mode. The database can be used immediately, and M.Tech. from KSOU, Mysore. She
as the repair procedure will run in the background has more than decades of teaching
experience. Her research area includes
Both the new modes notx_sync_repair and notx_async_repair multi agent system, DBMS, ADBMS & SPM. She has attended
will manage conflicts automatically, with a configurable RETRY several seminars, workshops and conferences at various levels.
(default=50). In case changes to the graph occur concurrently, She has published many papers in national and international
journals and conferences.

9
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
GREEN COMPUTING
Saroj Bala
Assistant Professor, MCA Department
E-mail: saroj_kkr@rediffmail.com
ABSTRACT– During recent years, attention in Green
Computing has moved research into energy-saving techniques
for home computers to enterprise systems' Client and Server
machines. Saving energy or reduction of carbon footprints is
one of the aspects of Green Computing. The research in the
direction of Green Computing is more than just saving energy
and reducing carbon foot prints. This study provides a brief
account of Green Computing. The emphasis of this study is on
current trends in Green Computing; challenges in the field of
Green Computing and the future trends of Green Computing.
1. INTRODUCTION
The field of Green Computing encompasses a broad range of
subjects from new energy-generation techniques to the study
of advanced materials to be used in our daily life. Green
technology focuses on reducing the environmental impact of
industrial processes and innovative technologies caused by
the Earth’s growing population. It has taken upon itself the
goal to provide society’s needs in ways that do not damage
the natural resources. This means creating fully recyclable
products, reducing pollution, proposing alternative
technologies in various fields, and creating a center of
economic activity around technologies that benefit the
environment. The huge amount of computing manufactured
worldwide has a direct impact on environment issues, and
scientists are conducting numerous studies in order to reduce
the negative impact of computing technology on our natural
resources. A central point of research is testing and applying
alternative nonhazardous materials in the products’
manufacturing process.
The article is structured as follows: section 2 discusses current
trends, Section 3 and 4 discusses challanges and future trends
respectively.
2. CURRENT TRENDS
Current trends of Green Computing are towards efficient
utilization of resources. Energy is considered as the main
resource and the carbon footprints are considered the major
threats to environment. Therefore, the emphasis is to reduce
the energy utilization & carbon footprints and increase the
performance of Computing. There are several areas where
researchers are putting lots of efforts to achieve desired results:
1. Organizations are realizing that the source and amount of
10
their energy consumption significantly contributes to
Greenhouse Gas emissions. In response to this finding,
organizations are currently using the following equation:
Reduced energy consumption =
Reduced greenhouse gas emissions =
Reduced operational costs for the data center
It means adopting fewer and more energy efficient
systems while refactoring application environments to
make optimal use of physical resources is the best
architectural model.
2. Based on the Gartner estimations over 133,000 PCs are
discarded by U.S. homes and businesses every day and
less than 10 percent of all electronics are currently
recycled. Majority of countries around the world require
electronic companies to finance and manage recycling
programs for their products especially under-developed
Countries. Green Computing must take the product life
cycle into consideration; from production to operation
to recycling. E-Waste is a manageable piece of the waste
stream and recycling e-Waste is easy to adopt. Recycling
computing equipment such as lead and mercury enables
to replace equipment that otherwise would have been
manufactured. The reuse of such equipments allows
saving energy and reducing impact on environment,
which can be due to electronic wastes.
3. Currently much of the emphasis of Green Computing area
is on Data Centers, as the Data Centers are known for
their energy hunger and wasteful energy consumptions.
With the purpose of reducing energy consumption in
Data Centers it is worthwhile to concentrate on following:
z Information Systems – efficient and right set
information systems for business needs are a key in
building Green Data Centers.
z Cooling Systems –cooling system should be designed
in such a way so that it is expandable as needs for
cooling dictates.
z Standardized environment for equipment is must for
Data Center Air Management and Cooling System.
z Consider initial and future loads, when designing &
selecting data center electrical system equipment.
4. Virtualization is a trend of Green computing it offers
virtualization software as well as management software
for virtualized environments. Virtualization runs fewer
systems at higher levels of utilization. Virtualization allows
full utilization of computer resources and benefits in:
z Reduction of total amount of hardware;
z Power off Idle Virtual Server to save resources and
energy; and
z Reduction in total space, air and rent requirements
ultimately reduces the cost
5. Another approach to promote Green Computing and save
environment is to introduce policies all around the World,
so that, companies design products to receive the eco-
label. There are several organizations in the world which
support “eco-label” IT products. These organizations
provide certificates to IT products based on factors
including design for recycling, recycling system, noise
energy consumption etc.
3. CHALLENGES
According to researchers in the past the focus was on
computing efficiency and cost associated to IT equipments
and infrastructure services were considered low cost and
available. Now infrastructure is becoming the bottleneck in IT
environments and the reason for this shift is due to growing
computing needs, energy cost and global warming. This shift
is a great challenge for IT industry. Therefore now researchers
are focusing on the cooling system, power and data center
space. At one extreme it is the processing power that is
important to business and on the other extreme it is the drive,
challenge of environment friendly system, and infrastructure
limitations. Green Computing challenges are not only for IT
equipments users but also for the IT equipments Vendors.
Several major vendors have made considerable progress in
this area, for example, Hewlett-Packard recently unveiled what
it calls “the greenest computer ever”—the HP rp5700 desktop
PC. The HP rp5700 exceeds U.S. Energy Star 4.0 standards,
and has an expected life of at least five years, and 90% of its
materials are recyclable. Dell is speeding up its programs to
reduce hazardous substances in its computers, and its new
Dell OptiPlex desktops are 50% more energy-efficient than
similar systems manufactured in 2005, credit goes to more
energy-efficient processors, new power management features,
and other related factors. IBM is working on technology to
develop cheaper and more efficient solar cells plus many other
solutions from IBM to support sustainable IT. According to
researchers of Green Computing following are few prominent
challenges that Green computing is facing today:
z Equipment power density / Power and cooling
capacities;
z Increase in energy requirements for Data Centers and
growing energy cost;
z Control on increasing requirements of heat removing
11
equipment, which increases because of increase in total
power consumption by IT equipments;
z Equipment Life cycle management – Cradle to Grave;
and
z Disposal of Electronic Wastes
4. FUTURE TRENDS
The future of Green Computing is going to be based on
efficiency, rather than reduction in consumption. The primarily
focus of Green IT is in the organization’s self interest in energy
cost reduction, at Data Centers and at desktops, and the result
of which is the corresponding reduction in carbon generation.
The secondary focus of Green IT needs to focus beyond energy
on innovation and improving alignment with overall corporate
social responsibility efforts. This secondary focus will demand
the development of Green Computing strategies. The idea of
sustainability addresses the subject of business value creation
while ensuring that long term environmental resources are not
impacted. There are few efforts, which all enterprises are
supposed to take care of. In future certifications together with
recommendations and government regulations will put more
pressure on vendors to use green technology and reduce
impact on environment. Cloud computing is energy-efficient
technology for ICT provided that it’s potential for significant
energy savings that have so far focused on only hardware
aspects, can be fully explored with respect to system operation
and networking aspects also. Cloud Computing results in better
resource utilization, which is good for the sustainability
movement for green technology. The product durability and/
or longevity are one of the best approaches towards achieving
Green Computing objectives. Long life of product will allow
more utilization of products and it will put a control on
unnecessary manufacturing of products. It is obvious that
government regulations will push the products vendors to
make more efforts to increase the product life.
Power management is proving to be one of the most valuable
and clear-cut techniques in near future to decrease energy
consumption. IT departments with focus on saving energy
can decrease use with a centralized power management tool.
One of the areas where Green Computing can grow is the share
and use efficiently the unused resources on idle computers.
Leveraging the unused computing power of modern machines
to create an environmentally proficient substitute to traditional
desktop computing is cost effective option. Intelligent
compression techniques can be used to compress the data
and eliminate duplicates help in cutting the data storage
requirements.
5. CONCLUSION
Technology is an active contributor in achieving the goals of
Green Computing. IT industry is putting efforts in all its sectors
to achieve Green computing. Equipment recycling, reduction
of paper usage, virtualization, cloud computing, power
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
management, Green manufacturing are the key initiatives
towards Green computing. Current challenges to achieve Green
Computing are enormous and the impact is on computing
performance. Government regulations are pushing Vendors to
act green; behave green; do green; go green; think green; use
green and no doubt to reduce energy consumptions as well.
All these efforts are still in limited areas and currently efforts
are mainly to reduce energy consumption, e-Waste but the
future of Green Computing will be depending on efficiency
and Green products. Future work in Green Computing discipline
will also rely on research work in academics since this is an
emerging discipline and there is much more need to be done.
There is need for more research in this discipline especially
within academic sector.
REFERENCES
[1] Tariq Rahim Soomro and Muhammad Sarwar, Green
Computing: From current to Future Trends, International
Journal of Social, Behavioral, Educational, Economic,
Business and Industrial Engineering Vol:6, No:3, page
326-329, 2012.
12
[2] Pushtikant Malviya, Shailendra Singh, A Study about
Green Computing, International Journal of Advanced
Research in Computer Science and Software Engineering,
Volume 3, Issue 6, page 790-794, June 2013
Saroj Bala is working as an Assistant
Professor in Ajay Kumar Garg
Engineering College, Ghaziabad,
U.P.(India). She has obtained her MCA
from Punjabi University, Patiala and B.Sc
from Kurukshetra University,
Kurukshetra. She has over 17 years of
teaching experience. Her research area
includes data clustering, swarm
intelligence, image processing and green computing. She has
attended several seminars, workshops and conferences at
various levels. She has published many papers in national and
international journals.
 LI-FI (LIGHT FIDELITY)-THE FUTURE TECHNOLOGY IN
WIRELESS COMMUNICATION
Harnit Saini
Assistant Professor, MCA Department, AKGEC, GZB
E-mail: harnit_saini@yahoo.com

Abstract –Whether you’re using wireless internet in a coffee
shop, stealing it from the guy next door, or competing for
bandwidth at a conference, you have probably gotten frustrated
at the slow speeds you face when more than one device is tapped
into the network. As more and more people and their many
devices access wireless internet, clogged airwaves are going to
make it. One germen phycist. Harald Haas has come up with a
solution he calls “data through illumination” –taking the fibber
out of fiber optic by sending data through an LED light bulb
that varies in intensity faster than the human eye can follow.
It’s the same idea band behind infrared remote controls but far
more powerful. Haas says his invention, which he calls DLIGHT,
can produce data rates faster than 10 megabits per second, which
is speedier than your average broadband connection. He
envisions a future where data for laptops, smart phones, and
tablets is transmitted through the light in a room. And security
would be snap – if you can’t see the light, you can’t access the
data.
1. INTRODUCTION
In simple terms, Li-Fi can be thought of as a light-based Wi-Fi.
That is, it uses light instead of radio waves to transmit
information. And instead of Wi-Fi modems, Li-Fi would use
transceiver-fitted LED lamps that can light a room as well as
transmit and receive information. Since simple light bulbs are
used, there can technically be any number of access points.
This technology uses a part of the electromagnetic spectrum
that is still not greatly utilized- The Visible Spectrum. Light is
in fact very much part of our lives for millions and millions of
years and does not have any major ill effect. Moreover there is
10,000 times more space available in this spectrum and just
counting on the bulbs in use, it also multiplies to 10,000 times
more availability as an infrastructure, globally.
high speeds in the lab. Researchers at the Heinrich Hertz
Institute in Berlin, Germany, have reached data rates of over
500 megabytes per second using a standard white-light LED.
Haas has set up a spin-off firm to sell a consumer VLC transmitter
that is due for launch next year. It is capable of transmitting
data at 100 MB/s - faster than most UK broadband connections.
2. HOW LI-FI WORKS?
Li-Fi is typically implemented using white LED light bulbs at
the downlink transmitter. These devices are normally used for
illumination only by applying a constant current. However, by
fast and subtle variations of the current, the optical output can
be made to vary at extremely high speeds.
This very property of optical current is used in Li-Fi setup.
The operational procedure is very simple-, if the LED is on,
you transmit a digital 1, if it’s off you transmit a 0. The LEDs
can be switched on and off very quickly, which gives nice
opportunities for transmitting data. Hence all that is required
is some LEDs and a controller that code data into those LEDs.
All one has to do is to vary the rate at which the LED’s flicker
depending upon the data we want to encode.
Further enhancements can be made in this method, like using
an array of LEDs for parallel data transmission, or using mixtures
of red, green and blue LEDs to alter the light’s frequency with
each frequency encoding a different data channel. Such
advancements promise a theoretical speed of 10 Gbps –
meaning one can download a full high-definition film in just 30
seconds.

It is possible to encode data in the light by varying the rate at

which the LEDs flicker on and off to give different strings of 1s
and 0s. The LED intensity is modulated so rapidly that human
eyes cannot notice, so the output appears constant.

More sophisticated techniques could dramatically increase VLC

data rates. Teams at the University of Oxford and the University
of Edinburgh are focusing on parallel data transmission using
arrays of LEDs, where each LED transmits a different data
stream. Other groups are using mixtures of red, green and blue
LEDs to alter the light's frequency, with each frequency
encoding a different data channel.

Li-Fi, as it has been dubbed, has already achieved blisteringly

13
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
TTo further get a grasp of Li-Fi consider an IR remote. It sends
a single data stream of bits at the rate of 10,000-20,000 bps.
Now replace the IR LED with a Light Box containing a large
LED array.
3. APPLICATION OF LI-FI TECHNOLOGY
3.1 You Might Just Live Longer
You Might Just Live Longer For a long time, med ical
technology has lagged behind the rest of the wireless world.
Operating rooms do not allow Wi-Fi over radiation concerns,
and there is also that whole lack of dedicated spectrum. While
Wi-Fi is in place in many hospitals, interference from cell phones
and computers can block signals from monitoring equipment.
Li-Fi solves both problems: lights are not only allowed in
operating rooms, but tend to be the most glaring (punintended)
fixtures in the room. And, as Haas mentions in his TED Talk,Li-
Fi has 10,000 times the spectrum of Wi-Fi, so maybe we can, I
dunno, delegate red light to priority medical data. Code Red!
3.2 Airlines
Airline Wi-Fi. Ugh. Nothing says captive audience like having
to pay for the "service" of dialup speed Wi-Fi on the plane.
And don’t get me started on the pricing.
The best I’ve heard so far is that passengers will "soon" be
offered a "high-speed like" connection on some airlines. United
is planning on speeds as high as 9.8 Mbps per plane.
Uh, I have twice that capacity in my living room. And at the
same price as checking a bag, I expect it. Li-Fi could easily
introduce that sort of speed to each seat's reading light. I’ll be
the guy WoWing next to you. Its better than listening to you
tell me about your wildly successful son, ma’am.
3.3 Smarter Power Plants
Wi-Fi and many other radiation types are bad for sensitive
areas. Like those surrounding power plants. But power plants
need fast, inter-connected data systems to monitor things like
demand, grid integrity and (in nuclear plants) core temperature.
The savings from proper monitoring at a single power plant
can add up to hundreds of thousands of dollars.
Li-Fi could offer safe, abundant connectivity for all areas of
these sensitive locations. Not only would this save money
related to currently implemented solutions, but the draw on a
power plant’s own reserves could be lessened if they haven’t
yet converted to LE
D lighting.
3.4 Undersea Awesomeness
Underwater ROVs, those favourite toys of treasure seekers
and James Cameron,operate from large cables that supply their
power and allow them to receive signals from their pilots above.
14
ROVs work great, except when the tether isn’t long enough to
explore an area, or when it gets stuck on something. If their
wires were cut and replaced with light —say from a submerged,
high-powered lamp —then they would be much freer to explore.
They could also use their headlamps to communicate with
each other, processing data autonomously and referring
findings periodically back to the surface, all the while obtaining
their next batch of orders.
3.5 It Could Keep You Informed and Save Lives
Say there’s an earthquake in New York. Or a hurricane. Take
your pick —it’s a wacky city. The average New Yorker may not
know what the protocols are for those kinds of disasters. Until
they pass under a street light, that is.
Remember, with Li-Fi, if there’s light, you’re online. Subway
stations and tunnels, common dead zones for most emergency
communications, pose no obstruction. Plus, in times less
stresssing cities could opt to provide cheap high speed Web
access to every street corner.
4. ADVANTAGES OF LI-FI
z Li-Fi can solve problems related to the insufficiency of
radio frequency bandwidth because this technology uses
Visible light spectrum that has still not been greatly
utilized.
z High data transmission rates of up to 10Gbps can be
achieved.
z Since light cannot penetrate walls, it provides privacy
and security that Wi-Fi cannot.
z Li-Fi has low implementation and maintenance costs.
z It is safe for humans since light, unlike radio frequencies,
cannot penetrate human body. Hence, concerns of cell
mutation are mitigated.
5. DISADVANTAGES OF LI-FI
z Light can't pass through objects.
z A major challenge facing Li-Fi is how the receiving device
will transmit back to transmitter.
z High installation cost of the VLC systems.
z Interferences from external light sources like sun, light,
normal bulbs, opaque materials.
6. CONCLUSION
The possibilities are numerous and can be explored further. If
his technology can be put into practical use, every bulb can be
used something like a Wi-Fi hotspot to transmit wireless data
and we will proceed toward the cleaner, greener, safer and
brighter future.
The concept of Li-Fi is currently attracting a great deal of
interest, not least because it may offer a genuine and very
efficient alternative to radio-based wireless. As a growing
number of people and their many devices access wireless
internet, the airwaves are becoming increasingly clogged, Harnit Saini has done her Bachelor of
making it more and more difficult to get a reliable, high-speed Computer Applications from Kanya Maha
signal. Vidyalya, Jalandhar, Punjab, affiliated to
Guru Nank Dev University, Amritsar,
This may solve issues such as the shortage of radio-frequency Punjab in the year 2002. She has done
bandwidth and also allow internet where traditional radio based her Master of Computer Applications
wireless isn’t allowed such as aircraft or hospitals. One of the with honours from Punjab Institute of
shortcomings however is that it only work in direct line of Management and Technology, Mandi
sight. Gobindgarh, Punjab, affiliated to Punjab Technical University,
Jalandhar, Punjab in year 2005. She has done her Master of
REFERENCES Technology degree in Computer Science and Engineering from
[1] seminarprojects.com/s/seminar-report-on-lifi Ajay Kumar Garg Engineering College, Ghaziabad. She has
[2] http://en.wikipedia.org/wiki/Li-Fi attended a national conference on Development of Reliable
[3] http://teleinfobd.blogspot.in/2012/01/what-is-lifi.html Information Systems, Techniques and Related Issues during
[4] technopits.blogspot.comtechnology.cgap.org/2012/01/ her M.Tech. at Ajay Kumar Garg Engineering College,
11/a-lifi-world/ Ghaziabad in February, 2012. She has also attended a workshop
[5] www.lificonsortium.org/ on Formal Languages, Automata Theory and Computations at
[6] the-gadgeteer.com/2011/08/29/li-fi-internet-at-thespeed- Ajay Kumar Garg Engineering College, Ghaziabad in April, 2012.
of-light She was also in the organizing team of national conference
DRISTI-2012 and national seminar CYST-2013 held in Ajay
Kumar Garg Engineering College Ghaziabad. She has published
two papers during her M.Tech in International Journals. She is
an active member of IEEE. She possesses good moral values
and calmness. She is ready to face challenges at every moment
of life. Faith in God is her biggest strength.

15
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
AN EFFICIENT INDEXING TREE STRUCTURE FOR
MULTIDIMENSIONAL DATA ON CLOUD
Mani Dwivedi,
Assistant Professor, AKGEC, Ghaziabad
dwivedimani@gmail.com
Abstract – Nowadays cloud computing provides storage resource
on demand has become increasingly important. Cloud
computing has attracted much attention in industrial and
research areas, for its advantages such as high availability, high
reliability and costsaving to the business organizations.
However, multidimensional data indexing remains as a big
challenge for cloud computing, because of the inefficiency in
storage and search caused by complicated existing index
structures, which greatly limits the scalability of applications
and dimensionality of data to be indexed. A novel index scheme
with a simple tree structure for multidimensional data indexing
(SDI) in cloud systems have been proposed, which overcomes
the root-bottleneck problem existing in most other tree-based
multidimensional indexing schemes for cloud data
management. Extensive study verifies the superiority of SDI in
both search and storage management performance.
1. INTRODUCTION
Cloud computing is the technology used to access remotely
stored data through the internet. It protects the data from the
disasters like earthquakes, tsunami, cyclones, fire etc. As cloud
computing is becoming more accrual, more information is being
centralized into the cloud. Data owners are relieved from the
burden of data storage and maintenance, to enjoy the on
demand high quality data service. The customers of the cloud,
now has to be secure against the cloud service providers itself,
because they can leak information to prohibited entities or get
hacked. Though current cloud systems have achieved great
success in file-sharing and file management with the help of
mature technologies such as keyword-based search and one
dimensional data indexing, extending cloud technologies to
applications with more complicated data management tasks is
nontrivial. There are several difficulties in implementing
Fig. 1. SDI Structure
16
multidimensional data indexing and supporting
multidimensional complex/similarity queries, which can be either
k-nearest-neighbor (KNN) queries or range queries.
Almost every existing cloud computing environment employs
a one-dimensional identifier (or ID, for short) space. The only
exception protocol, CAN [2], uses a low dimensional torus as
the topology of the ID space. The dimensionality of the ID
space usually cannot be matched with the dimensionality of
the data to be indexed. Apparently, these distributed-hash-
table (DHT) based methods cannot be used directly for our
purpose. Another natural choice is to extend the tree-based
indexing in centralized databases or traditional distributed
databases with a limited number of nodes. Essentially, these
methods imitate a multidimensional tree index with an additional
ring-based overlay linking all nodes in the tree together.
It can be assumed that tree structured overlay network should
be used in the way that additional links should be added with
care. With appropriately designed algorithms, a simple tree
structured overlay network with less links could be more
efficient than a complex one in terms of, not only network
maintenance, but also multidimensional data search. In this
paper a novel Simple tree structure for multidimensional data
indexing (SDI) is presented by overcoming the problems of
VBI-tree [1].
2. SDI STRUCTURE
In order to overcome the shortcomings of VBI-Tree,SDI is
forwarded, which is shown in Fig.1. Each routing node may
“link” to five kinds of
 nodes, if any: one parent, two children, two adjacent routing
nodes, neighbor routing nodes and one ancestor node.
Compared with VBI-Tree, SDI defines new ancestor links and
different adjacent links, but removes upside path. If all data
nodes are removed which are leaves, then a routing tree with
only routing nodes is created. By an inorder traversal to this
routing tree, we create adjacent link between any two nodes as
shown in Fig. 1. Given a node x, the nodes immediately prior to
and after it, connected by the adjacent link, are the left and
right adjacent nodes, respectively. Adjacent link will always
connect to one LRN at one end. Ancestor link is distributed by
the lower level routing node to its specific higher level routing
node descendants, which are at least two levels higher 2 and
lie on the left(right) child branch but right(left) most positions
at each level. Ancestor link brings the ancestor coverage
information to its selected descendants. For any node at level
l (l >= 0), it will distribute at most 2* (log N - l - 2) links out
with network nodes N. Child height is the child subtree height,
which is used to activate the balance algorithm [9]. For the
data node, it has no sideways routing tables, ancestor or
adjacent links, but only one parent link to LRN(Leaf routing
Node). Modification to the original adjacent link has restricted
the routing inside routing tree, which makes the tree succinct
and using ancestor link instead of upside path reduces the
updating cost from O(N) to O(log N), which makes the tree
speedy.
2.1 Ancestor link distribution
In SDI, ancestor links are distributed to routing nodes at each
level evenly except the left and right most ones. Each link will
be maintained by at most two nodes of the same level: the
right(left) most descendant of the left(right) child branch. All
nodes with level no less than 2, except the left most and right
most ones, will have ancestor links. If one node maintains an
ancestor link, there is only one. Each node will keep the region
information for the linked ancestor, if any.
2.2 Index building
Index building for SDI is the same as in VBI-Tree [1], which
deals with the data indexing distribution among tree nodes.
The ancestor node will cover the descendant node. Node
joining or departure causes the data space to be divided or
combined. Data adding or deleting causes the coverage space
of node to be expanded or shrunk, which is the same process
as in centralized index schemes [3,4].
3. QUERY PROCESSING
According to the modification to the tree structure, new
algorithms for query processing have been defined. By visiting
ancestor links among neighbors, the query efficiency is still
O(log N) but with no root-bottleneck problem or high
maintenance cost. Point query is a special case of range query
and KNN query, setting query radius to zero. For simplicity,
first we consider the case where no sibling nodes overlap with
17
each other. Ancestor link helps to do a discrete data search
with less hops, which reduces the query processing cost
drastically, compared with VBI-Tree. It is ensured that all the
nodes which intersect with the query can be visited once and
only once. In the query processing algorithm, by using
additional parameters, we restrict the search to the nodes or
branches which have not been checked. For query processing,
we use a parallel query distribution which guarantees the query
efficiency to be O(log N).
3.1 Performance of query processing
VBI-Tree uses upside path to log the coverage information for
all ancestors along the way to root and then each node has a
wider view. So VBI-Tree beats SDI in query efficiency. However
both of them can resolve the query by O(log N). The most
important thing for SDI is that it can resolve the query with
much less cost (query messages) and the more skewed the
data distribution, the more benefit it gets. SDI beats VBI-Tree
in three cases, especially for the range query and the KNN
query. By using ancestor links, SDI resolves discrete data
checking with less hops but VBI-Tree can only jump one level
at a time. The query cost increases with increasing
dimensionality, the bigger the dimensionality, the more the space
overlapping. KNN query processing adopts the range query
processing algorithm and SDI wins in query cost.
4. CONCLUSION
Indexing of multidimensional data is an essential problem for
bringing cloud technologies into mission critical data
management applications. An enabling technique for this
purpose should not only keep search efficiency in a static
environment, but also provide availability and robustness
without performance sacrifice in a large-scale cloud based
systems where nodes may join or leave the system dynamically.
SDI, a tree-based overlay network is introduced, in which each
node only maintains carefully selected additional links to
ancestor and descendant nodes. It has been shown here that
even with less additional links, the search algorithms based on
SDI still bounds the query efficiency by O(log N). The
advantage achieved by the simple yet efficient index structure
is huge. It eliminates the root bottleneck problem suffered by
most other tree-based overlay networks. Furthermore, since
less links are maintained, it reduces the cost for both network
maintenance and query processing.
5. REFERENCES
[1] H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, A. Zhou, VBI
-Tree: A Peerto- Peer framework for supporting multi-
dimensional indexing schemes, in: ICDE, 2006, pp. 34–
43.
[2] S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker,
A scalable content-addressable network, in: SIGCOMM,
2001, pp. 161–172.
[3] A. Guttman, R-trees: A dynamic index structure for spatial
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

searching, in: SIGMOD, 1984, pp. 47–57. ABOUT THE AUTHORS

[4] P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient Mani Dwivedi did her MCA from IIMT
access method for similarity search in metric spaces, in: Management College, Merrut ,Affiliated
VLDB, 1997, pp. 426–435. to UP Technical University, Noida in the
year 2008. She also received the degree
in M.Tech (Computer Science
Engineering) from UP Technical
University, Noida. She is currently
working in MCA department as Assistant
Professor of Ajay Kumar Garg Engineering College, Ghaziabad.

18
 MOBILE CLOUD COMPUTING INTEGRATION:
ARCHITECTURE, APPLICATIONS, AND APPROACHES
Anjali Singh
Assistant Professor, MCA Department, AKGEC, GZB
E-mail: sinajali2001@yahoo.com
Abstract – Together with an explosive growth of the mobile
applications and emerging of cloud computing concept, mobile
cloud computing (MCC) has been introduced to be a potential
technology for mobile services. MCC integrates the cloud com-
puting into the mobile environment and overcomes obstacles
related to the performance (e.g., battery life, storage, and
bandwidth), environment (e.g., heterogeneity, scalability, and
availability), and security (e.g., reliability and privacy) dis- cussed
in mobile computing. This paper gives a survey of MCC, which
helps general readers have an overview of the MCC including
the definition, architecture, and applications. The issues,
existing solutions, and approaches are presented. In addition,
the future research directions of MCC are discussed.
1. INTRODUCTION
Mobile devices (e.g., smartphone and tablet PC) are
increasingly becoming an essential part of human life as the
most effective and convenient communication tools not
bounded by time and place. Mobile users accumulate rich
experience of various services from mobile applications (e.g.,
iPhone apps and Google apps), which run on the devices and/
or on remote servers via wireless networks. The rapid progress
of mobile computing (MC) becomes a powerful trend in the
development of IT technology as well as commerce and
industry fields. However, the mobile devices are facing many
challenges in their resources (e.g., battery life, storage, and
bandwidth) and communications (e.g., mobility and security).
The limited resources significantly impede the improvement of
service qualities. Cloud computing (CC) has been widely
recognized as the next generation computing infrastructure.
CC offers some advantages by allowing users to use
infrastructure (e.g., servers, networks, and storages), platforms
(e.g., middleware services and operating systems), and
software’s (e.g., application programs) provided by cloud
providers (e.g., Google, Amazon, and Sales force) at low cost.
In addition, CC enables users to elastically utilize resources in
an on- demand fashion. As a result, mobile applications can be
rapidly provisioned and released with the minimal management
efforts or service provider’s interactions. With the explosion
of mobile applications and the support of CC for a variety of
services for mobile users, mobile cloud computing (MCC) is
introduced as an integration of CC into the mobile environment.
MCC brings new types of services and facilities mobile users
to take full advantages of CC
19
2. WHAT IS MOBILE CLOUD COMPUTING?
‘Mobile cloud computing at its simplest, refers to an
infrastructure where both the data storage and data processing
happen outside of the mobile device. Mobile cloud applications
move the computing power and data storage away from mobile
phones and into the cloud, bringing applications and MC to
not just smartphone users but a much broader range of mobile
subscribers’.
MCC is a new paradigm for mobile applications whereby the
data processing and storage are moved from the mobile device
to powerful and centralized computing platforms located in
clouds. These centralized applications are then accessed over
the wireless connection based on a thin native client or web
browser on the mobile devices. Alternatively, MCC can be
defined as a combination of mobile web and CC which is the
most popular tool for mobile users to access applications and
services on the Internet. Briefly, MCC provides mobile users
with the data processing and storage services in clouds. The
mobile devices do not need a powerful configuration (e.g.,
CPU speed and memory capacity) because all the complicated
computing modules can be processed in the clouds.
2.1 ARCHITECTURES OF MOBILE CLOUD
COMPUTING
From the concept of MCC, the general architecture of MCC
can be shown in Figure 1. In Figure 1, mobile devices are
connected to the mobile networks via base stations (e.g., base
transceiver station, access point, or satellite) that establish
and control the connections (air links) and functional interfaces
between the networks and mobile devices. Mobile users’
requests and information (e.g., ID and location) are transmitted
to the central processors that are connected to servers
providing mobile network services. Here, mobile network
operators can provide services to mobile users as
authentication, authorization, and accounting based on the
home agent and subscribers’ data stored in databases. In the
cloud, cloud controllers process the requests to provide mobile
users with the corresponding cloud services. These services
are developed with the concepts of utility computing,
virtualization, and service-oriented architecture (e.g., web,
application, and database servers). Generally, a CC is a large-
scale distributed network system implemented based on a
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

number of servers in data centers. The cloud services are
generally classified based on a layer concept. In the upper
layers of this paradigm, Infrastructure as a Service (IaaS),
Platform as a Service (PaaS), and Software as a Service (SaaS)
are stacked.
a. To provide services for customers. Typically, data centers
are built in less populated places, with high power supply
stability and a low risk of disaster.
b. IaaS. Infrastructure as a Service is built on top of the
data center layer. IaaS enables the provision of storage,
hardware, servers, and networking components. The
client typically pays on a per-use basis. Thus, clients
can save cost as the payment is only based on how
much resource they really use. Infrastructure can be
expanded or shrunk dynamically as needed.
c. PaaS. Platform as a Service offers an advanced integrated
environment for building, testing, and deploying custom
applications. The examples of PaaS are Google App
Engine, Microsoft Azure, and Amazon Map Reduce/
Simple Storage Service.
d. SaaS. Data storage service can be viewed as either in
IaaS or PaaS. Given this architectural model, the users
can use the services flexibly and efficiently.
an increase of cost and may not be feasible for all mobile
devices. Computation offloading technique is proposed with
the objective to migrate the large computations and complex
processing from resource-limited devices (i.e., mobile devices)
to resourceful machines (i.e., servers in clouds). This avoids
taking a long application execution time on mobile devices
which results in large amount of power consumption. The
effectiveness of offloading techniques through several
experiments. The results demonstrate that the remote
application execution can save energy significantly. In addition,
many mobile applications take advantages from task migration
and remote processing. For example, offloading a compiler
optimization for image processing can reduce 41% for energy
consumption of a mobile device. Also, using memory arithmetic
unit and interface (MAUI) to migrate mobile game components
to servers in the cloud can save 27% of energy consumption
for computer games and 45% for the chess game. Improving
data storage capacity and processing power. Storage capacity
is also a constraint for mobile devices. MCC is developed to
enable mobile users to store/access the large data on the cloud
through wireless networks. First example is the Amazon Simple
Storage Service which supports file storage service. Another
example is Image Exchange which utilizes the large storage
space in clouds for mobile users. This mobile photo sharing

Figure1. Mobile cloud computing architeceture

2.2 Advantages of mobile cloud computing Cloud computing
service enables mobile users to upload images to the clouds
is known to be a promising solution for MC because of many
immediately after capturing. Users may access all images from
reasons (e.g., mobility, communication, and portability). In the
any devices. With the cloud, the users can save considerable
following, we describe how the cloud can be used to overcome
amount of energy and storage space on their mobile devices
obstacles in MC, thereby pointing out advantages of MCC.
because all images are sent and processed on the clouds.
Extending battery lifetime. Battery is one of the main concerns
for mobile devices. Several solutions have been proposed to
Mobile cloud computing also helps in reducing the running
enhance the CPU performance and to manage the disk and
cost for compute-intensive applications that take long time
screen in an intelligent manner to reduce power consumption.
and large amount of energy when performed on the limited-
However, these solutions require changes in the structure of
resource devices. CC can efficiently support various tasks for
mobile devices, or they require a new hardware that results in

20
data warehousing, managing and synchronizing multiple
documents online. For example, clouds can be used for
transcoding playing chess or broadcasting multimedia services
to mobile devices. In these cases, all the complex calculations
for transcoding or offering an optimal chess move that take a
long time when perform on mobile devices will be processed
efficiently on the cloud. Mobile applications also are not
constrained by storage capacity on the devices because their
data now is stored on the cloud. Improving reliability. Storing
data or running applications on clouds is an effective way to
improve the reliability because the data and application are
stored and backed up on a number of computers. This reduces
the chance of data and application lost on the mobile devices.
In addition, MCC can be designed as a comprehensive data
security model for both service providers and users. For
example, the cloud can be used to protect copyrighted digital
contents (e.g., video, clip, and music) from being abused and
unauthorized distribution. Also, the cloud can remotely provide
to mobile users with security services such as virus scanning,
malicious code detection, and authentication. Also, such
cloud-based security services can make efficient use of the
collected record from different users to improve the
effectiveness of the services
In addition, MCC also inherits some advantages of clouds for
mobile services as follows:
Dynamic Provisioning. Dynamic on-demand provisioning of
resources on a fine-grained, self-service basis is a flexible way
for service providers and mobile users to run their applications
without advanced reservation of resources.
Scalability. The deployment of mobile applications can be
performed and scaled to meet the unpredictable user demands
due to flexible resource provisioning. Service providers can
easily add and expand an application and service without or
with little constraint on the resource usage.
Multitenancy. Service providers (e.g., network operator and
data center owner) can share the resources and costs to support
a variety of applications and large number of users.
Ease of integration. Multiple services from different service
providers can be integrated easily through the cloud and
Internet to meet the user demand.
3. APPLICATIONS OF MOBILE CLOUD COMPUTING
Mobile applications gain increasing share in a global mobile
market. Various mobile applications have taken the advantages
of MCC. In this section, some typical MCC applications are
introduced.
3.1. Mobile commerce Mobile commerce (m-commerce) is a
business model for commerce using mobile devices. The m-
commerce applications generally fulfill some tasks that require
21
mobility (e.g., mobile transactions and payments, mobile
messaging, and mobile ticketing). The m-commerce applications
can be classified into few classes including finance, advertising,
and shopping. The m-commerce applications have to face
various challenges (e.g., low network bandwidth, high
complexity of mobile device configurations, and security).
Therefore, m-commerce applications are integrated into CC
environment to address these issues. Yang et al. proposes a
3G E-commerce platform based on CC. This paradigm combines
the advantages of both third generation (3G) network and CC
to increase data processing speed and security level based on
public key infrastructure (PKI). The PKI mechanism uses an
encryption-based access control and an over-encryption to
ensure privacy of user’s access to the outsourced data. A 4PL-
AVE trading platform utilizes CC technology to enhance the
security for users and improve the customer satisfaction,
customer intimacy, and cost competitiveness.
3.2. Mobile learning Mobile learning (m-learning) is designed
based on electronic learning (e-learning) and mobility. However,
traditional m-learning applications have limitations in terms of
high cost of devices and network, low network transmission
rate, and limited educational resources.
Cloud-based m-learning applications are introduced to solve
these limitations. For example, utilizing a cloud with the large
storage capacity and powerful processing ability, the
applications provide learners with much richer services in terms
of data (information) size, faster processing speed, and longer
battery life.
The benefits of combining mlearning and CC to enhance the
communication quality between students and teachers. In this
case, a smartphone software based on the open source answer
students’ questions in a timely manner. In addition, a contextual
m-learning system based on Mobile Interaction in
3.3. Mobile healthcare
The purpose of applying MCC in medical applications is to
minimize the limitations of traditional medical treatment (e.g.,
small physical storage, security and privacy, and medical errors.
Mobile healthcare (m-healthcare) provides mobile users with
convenient helps to access resources (e.g., patient health
records) easily and efficiently. Besides, m-healthcare offers
hospitals and healthcare organizations a variety of on-demand
services on clouds rather than owning standalone applications
on local servers.
z Intelligent emergency management system can manage
and coordinate the fleet of emergency vehicles effectively
and in time when receiving calls from accidents or
incidents.
z Health-aware mobile devices detect pulse rate, blood
pressure, and level of alcohol to alert healthcare
emergency system.
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
z Pervasive access to healthcare information allows
patients or healthcare providers to access the current
and past medical information.
z Pervasive lifestyle incentive management can be used
to pay healthcare expenses and manage other related
charges automatically.
A paper proposes @Health Cloud, a prototype implementation
of m-healthcare information management system based on CC
and a mobile client running Android operating system (OS).
This prototype presents three services utilizing the Amazon’s
S3 Cloud Storage Service to manage patient health records
and medical images.
z Seamless connection to cloud storage allows users to
retrieve, modify, and upload medical contents (e.g.,
medical images, patient health records, and biosignals)
utilizing web services and a set of available APIs called
Repretational State Transfer.
z Patient health record management system displays the
information regarding patients’ status, related biosignals,
and image contents through application’s interface.
z Image viewing support allows the mobile users to decode
the large image files at different resolution levels given
different network availability and quality.
4. ISSUES AND APPROACHES OF MOBILE CLOUD
COMPUTING
As discussed in the previous section, MCC has many
advantages for mobile users and service providers. However,
because of the integration of two different fields, that is, CC
and mobile networks, MCC has to face many technical
challenges. This section lists several research issues in MCC,
which are related to the mobile communication and CC. Then,
the available solutions to address these issues are reviewed.
4.1 Issues in mobile communication side
(1) Low bandwidth. Bandwidth is one of the big issues in
MCC because the radio resource for wireless networks
is much scarce as compared with the traditional wired
networks.
(2) Availability. Service availability becomes a more
important issue in MCC than that in the CC with wired
networks. Mobile users may not be able to connect to
the cloud to obtain a service due to traffic congestion,
network failures, and the out-of-signal.
(3) Heterogeneity. Mobile cloud computing will be used in
the highly heterogeneous networks in terms of wireless
network interfaces. Different mobile nodes access to the
cloud through different radio access technologies such
as WCDMA, GPRS, WiMAX, CDMA2000, and WLAN.
As a result, an issue of how to handle the wireless
connectivity while satisfying MCC’s requirements arises
(e.g., always-on connectivity, on-demand scalability of
wireless connectivity, and the energy efficiency of mobile
devices).
22
4.2. Issues in computing side
(1) Computing offloading. As explained in the previous
section, offloading is one of the main features of MCC to
improve the battery lifetime for the mobile devices and
to increase the performance of applications.
(2) Security. Protecting user privacy and data/application
secrecy from adversary is a key to establish and maintain
consumers’ trust in the mobile platform, especially in
MCC.
(3) Enhancing the efficiency of data access. With an
increasing number of cloud services, the demand of
accessing data resources (e.g., image, files, and
documents) on the cloud increases. As a result, a method
to deal with (i.e., store, manage, and access) data
resources on clouds becomes a significant challenge.
(4) Context-aware mobile cloud services. It is important for
the service provider to fulfill mobile users’ satisfaction
by monitoring their preferences and providing
appropriate services to each of the users
5. PRICING
Using services in MCC involves both mobile service provider
(MSP) and cloud service provider (CSP). However, MSPs and
CSPs have different services management, customers
management, methods of payment, and prices. Therefore, this
will lead to many issues; that is, how to set price, how the price
will be divided among different entities, and how the customers
pay. For example, when a mobile user runs mobile gaming
application on the cloud, this involves the game service
provider (providing a game license), mobile service provider
(accessing the data through base station), and CSP (running
game engine on a data center).
6. CONCLUSION
Mobile cloud computing is one of the mobile technology
trends in the future because it combines the advantages of
both MC and CC, thereby providing optimal services for mobile
users. That traction will push the revenue of MCC to $5.2
billion. With this importance, this article has provided an
overview of MCC in which its definitions, architecture, and
advantages have been presented. The applications supported
by MCC including m-commerce, mlearning, and mobile
healthcare have been discussed which clearly show the
applicability of the MCC to a wide range of mobile services.
Then, the issues and related approaches for MCC (i.e., from
communication and computing sides) have been discussed.
Finally, the future research directions have been outlined.
REFERENCES
1. Satyanarayanan M. Proceedings of the 1st ACM
Workshop on Mobile Cloud Computing & Services:
Social Networks and Beyond (MCS), 2010.
2. Satyanarayanan M. Fundamental challenges in mobile
computing, In Proceedings of the 5th annual ACM
 symposium on Principles of distributed computing, 1996;
1–7.
3. Ali M. Green cloud on the horizon, In Proceedings of the
1st International Conference on Cloud Computing
(CloudCom), Manila, 2009; 451–459.
4. http://www.mobilecloudcomputingforum.com
5. White Paper. Mobile Cloud Computing Solution Brief.
AEPONA, 2010.
6. Christensen JH. Using Restful web-services and cloud
computing to create next generation mobile applications,
In Proceedings of the 24th ACM SIGPLAN conference
companion on Object oriented programming systems
languages and applications (OOPSLA), 2009; 627–634.
7. Liu L, Moulic R, Shea D. Cloud service portal for mobile
device management, In Proceedings of IEEE 7th
International Conference on e-Business Engineering
(ICEBE), 2011; 474.
8. Foster I, Zhao Y, Raicu I, Lu S. Cloud computing and grid
computing 360-degree compared, In Proceedings of
Workshop on Grid Computing Environments (GCE),
2009;.
9. Calheiros RN, Vecchiola C, Karunamoorthy D, Buyya R.
The Aneka platform and QoS-driven resource
provisioning for elastic applications on hybrid Clouds.
Future Generation Computer Systems, to appear.
23
10. Buyya R, Yeo CS, Venugopal S, Broberg J, Brandic I.
Cloud computing and emerging IT platforms: vision,
hype, and reality for delivering computing as the 5th
utility. Journal on Future Generation Computer Systems
2009; 25(6): 599–616.
11. Huang Y, Su H, Sun W, et al. Framework for building a
low-cost, scalable, and secured platform for webdelivered
business services. IBM Journal of Research and
Development 2010; 54(6): 535–548.
12. Tsai W, Sun X, Balasooriya J. Service-oriented cloud
computing architecture, In Proceedings of the 7th
International Conference on Information Technology:
New Generations (ITNG), 2010; 684–689.
Ms. Anjali Singh has an teaching
Experience of 14 years she had pursued
her MCA and M.Tech degrees in year
2001 and 2013 respectively. which
includes teaching in different subjects like
Computer Networks, multimedia Systems
Mobile Computing, Modelling Simulation
,Cyber Security, Web Technology Human
Values etc.
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

GENETIC ALGORITHM FRAMEWORK FOR PARALLEL

COMPUTING ENVIRONMENTS
Ruchi Gupta
Assistant Professor, MCA Department
E-mail: 80 ruchi@gmail.com

Abstract –In this research article, we presented a framework to
execute Genetic algorithms (GA) in various parallel
environments. GA researchers can prepare implementations of
GA operators and fitness functions using this framework. In
the proposed framework, the GA model is restricted to a coarse-
grained and micro-grained model. In this paper, different
parallel computing environment using genetic algorithm are
presented. Computational performance is also discussed through
examples.
Index Terms: - Genetic Algorithm, Parallel Computing.
1. INTRODUCTION
Recently, several types of parallel architecture have come into
wide use. For example, calculation with multi-core CPU which
more than four cores is not unusual. General purposed GPU
becomes also easy to use. In Japan, some of the
supercomputing centers are open for researchers to use high-
end computational resources.
Thus, even when we wish to use the same algorithms, it is
necessary to prepare different implementation codes suitable
for different parallel architectures. This places a heavy burden
on algorithm researchers, because in-depth knowledge of the
different parallel architectures is required to run their
implementation codes efficiently on parallel machines. GA is a
type of optimization algorithm with multipoint search [1]. GA
may find the optimum point even when the landscape of the
objective function has multiple peaks. However, GA requires
much iteration to find the optimum. This results in high
calculation cost. As GA is a multipoint search algorithm, it
implicitly has several types of parallelism [2][3][4][5]. Thus,
several types of research regarding parallelization of GAs are
existed. Ono et al, introduced the GA model and implementation
parallel models of GA should be clarified. As there is parallelism
in the GA itself, parallel GA can be performed even on a single
process. We call this the logical parallel model. On the other
hand, because GA has multiple search points, a single model
can be implemented on parallel computers. In this case, an
implementation parallel model should be prepared.
In most GA research, these logical and implementation parallel
models are not distinguished clearly and are often the same
[6][7][8]. When the logical model is closely related to the
implementation model, GA users should have deep knowledge
of the parallel architectures on which their parallel GAs are
running. At the same times, as the logical model and
implementation model are closely related, different parallel
codes are required for different parallel machines. Therefore, it
would be of great benefit if GA users were not required to have
such deep knowledge of novel parallel architectures to run
their GAs in parallel.
Here, we presented e a parallel environment framework for GA
that adopts the coarse grained and micro-grained model as an
implementation model. GA researchers prepare the
implementations of genetic algorithm operators and fitness
functions using the proposed framework.
2. GENETIC ALGORITHM
The GA is an optimization algorithm that mimics natural
evolution with variation and adaptation to the environment.
In evolution processes in nature, an individual that is better
adapted to the environment among a group of individual
forming a certain generation survives at a higher rate, and
leaves offspring to the next generation. In the GA concept, the
computer finds an individual that is better adapted to the
environment, or a solution that yields an optimum value to an
evaluation function, by modeling the mechanism of biological
evolution. Figure 1 shows a typical flowchart of GA.
Fig. 1. Flowchart of GA.
3. PARALLEL MODEL OF GA
The GA is able to parallelized because it searches multiple
points and repeats sampling. This method has the same
characteristic as serial GA. The other is to split a population
into multiple subpopulations. Today, the latter method is
frequently used, because it has the higher parallelism than the
former method. There are GA methods performing very efficient
parallelism, which combine the both methods. On changing
the method of parallel GA, it is important to consider that it
may happen to change the amount of calculations and the
accuracy of solutions. That brings to the point that Parallel GA
has the following two meanings.

24
z Parallel algorithm for increasing search performance
z Parallel implementation for reducing execution time
For example, Pospichal [9] has proposed the distributed
population GA based on GPU, and achieved a high efficiency.
Although this method has achieved high efficiency, GA other
than the distributed population GA cannot be implemented,
since GA and parallel implementation are inseparable Also, it is
difficult to implement this method into architecture other than
GPU. The most basic parallel models are introduced as the
following Parallel models of GA can be divided into coarse-
grained and micro-grained models
1) Coarse-grained model
The coarse-grained model is generally called a distributed
population model. This model splits the population into multiple
subpopulations, which are then searched. Therefore, several
individuals in several subpopulations are moved into other
subpopulations. This operation is called the migration. Figure
2 shows the flow of the coarse grained model. This model uses
computational resources effectively, because it connects to
computational nodes only during migration. In addition, this
model changes performance of the search compared to a serial
algorithm.
Fig. 2. Coarse-grained model.
2) Micro-grained model
Evaluations account for a large share of total execution time in
complex of objective problems. The micro-grained model is
based on the general concept of parallelization. This model is
a master-slave model. A master processor executes other
genetic operations besides evaluation. Evaluations are
executed by slave processors. A master processor sends
individuals that should be evaluated. Slave processors
evaluate these individual, and return them to the master
processor. Figure 3 shows the flow of micro-grained model.
This model shows inferior parallelization performance compared
to the coarse-grained model, because it must have many
connections and the master processor uses a CPU. In addition,
this model does not alter the search performance compared to
a serial algorithm.
25
Fig. 3. Micro-grained model.
4. CONCLUSIONS AND FUTURE WORK
In this paper, we have surveyed a framework for GAs in parallel
environments. GA researchers can prepare implementations of
GA operators and fitness functions using this framework. In
the proposed framework, the GA model is restricted to coarse
grained and micro-grained model.
In future work, a mechanism to find the best number of
individuals and to tune it dynamically will be implemented in
the libraries. In addition, we will also attempt to prepare some
parallel libraries for other parallel architectures.
5. REFERENCE
1. David E. Goldberg, Genetic Algorithms in Search,
Optimization, and Machine Learning, Addison-Wesley,
1989.
2. T. Starkweather, D. Whitley, and K. Mathimas,
Optimization using Distributed Genetic Algorithms,
Parallel Problem Solving form Nature, 1991.
3. H. M¨uhlenbein, “Parallel genetic algorithms, population
genetics and combinatorial optimization,” in Parallelism,
Learning, Evolution, vol. 565 of Lecture Notes in
Computer Science, pp. 398–406. Springer Berlin /
Heidelberg, 1991.
4. C.Belding Theodore, “The Distributed Genetic Algorithm
Revisited,” Proc.6th International Conf. Genetic
Algorithms, pp. 114–121, 1995.
5. M. Miki, T. Hiroyasu, M. Kaneko, and K. Hatanaka, “A
Parallel Genetic Algorithm with Distributed Environment
Scheme,” IEEE International Conference on Systems,
Man, and Cybernetics, vol. 1, pp. 695–700, 1999.
6. Lim D., Ong Y. Soon, Jin Y., Sendhoff.B, and Lee B. Sung,
“Efficient hierarchical parallel genetic algorithms using
grid computing,” Future Generation Computer Systems,
vol. 23, no. 4, pp. 658–670, 2007.
7. J. Ming Li, X. Jing Wang, R. Sheng He, and Z. Xian Chi,
“An efficient fine-grained parallel genetic algorithm
based on gpu-accelerated,” in Network and Parallel
Computing Workshops, 2007. NPC Workshops. IFIP
International Conference on, 2007, pp. 855–862.
8. Thompson, A. Matthew and Dunlap, I. Brett,
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
“Optimization of analytic density functionals by parallel
genetic algorithm,” Chemical Physics Letters, vol. 463,
no. 1–3, pp. 278–282, 2008.
9. P. Pospichal and J. Jaros, “GPU-based Acceleration of
the Genetic Algorithm,” GPU competition of GECCO
competition, 2009.
26
Ruchi Gupta is an Assistant Professor in
AKGEC, Ghaziabad, an affiliated college
of Uttar Pradesh Technical University,
Lucknow, (India). She did her MCA and
MTech (CS) from U.P Technical
University Lucknow and pursuing Ph.D.
(Computer Science) from Sharda
University Grater Noida. Her area of
interest includes Genetic Algorithm.
 TOWARDS DEVELOPING REUSABLE SOFTWARE
COMPONENTS
Aditya Pratap Singh
Assistant Professor AKGEC, Ghaziabad
adityapsingh@gmail.com

Abstract–The CBSE Component based software engineering) Visual Studio” to develop reusable software component with
allows faster development at lower cost and better usability many development options. Now days all Software Industries
using Software Development with reuse and for reuse. The have understood that component can deliver great reusability,
software components work as a plug and play device due to
extensibility and maintainability for benefits for creating a large
their reusability properties, which abstract the software
scale software system by breaking down into the small binary
complexity and increase performance. In spite of numerous
research efforts there are no mature software component components. In Ravichandran and Rothenberger [5] noticed
development guidelines defined for the current technologies that, now industry is emphasizing more on black box reuse
such as .NET or JAVA. over white box reuse. Component based programming
This study presents guidelines for component development for emphasize on “Black Box Reuse” which means implementing
reuse in .NET environment. This study demonstrated an client of such component, not need to worry about its internal
approach by designing a binary component as part of functionality.
development for reuse based on .NET component framework.
The significant contribution of this study is to propose generic
Keywords – Software Reuse, Software Component, CBSE.
comprehensive guidelines for development team to adopt them
while developing software components for reuse.
INTRODUCTION
In last three decades, Software Development has established
COMPONENT BASED SOFTWARE ENGINEERING
itself as a global market for business. In current scenario, IT
Component-Based Software Engineering (CBSE) is concerned
Companies have slowly shifted from traditional software
with improving Component-Based Development (CBD)
development environment to component based environment.
practices. In particular, CBSE aims to provide developers with
The reason behind these changes is increased productivity
final software system properties predictability based on the
and reduced cost due to reusability of software components.
analysis of its constituent components. Therefore, there is a
Correspondingly, CBSE (Component Based Software
need to develop effective ways for developing software
Engineering) is the new trend for software development
components.
industries.
Software component is an independent unit of binary code,
The software component is an independent element which can
which can be used as plug and play, like a hardware device. It
be deployed and composed in further software development
designed and developed in modular architecture, which
cycle without any modification. These software components
promote interoperability with other component and framework
reduce complexity from end user point of view and provide
for reuse or with reuse.
quick and easy implementation, subsequently help to reduce
the cost. The subsequent development work in software
Although, a software component is an independent modular
industry is trying to incorporate component reusability in one
unit, which is loosely coupled and not bonded to one client
or other ways. Zirpins et al. [6] suggested that, Today’s Modern
and most important, it possesses official usage guidelines for
ERP systems are made of several software components and it
further reuse. In general, a typical software component model
shows the real example of Software Component reuse on big
is divided into three parts as:
scale.
a) Semantics: Denotes, what component are mean to be?
Ravichandran, and Rothenberger [4] stated that, Software
b) Syntax: Defines, how it is constructed, developed and
components works similar to an autonomous hardware
represented?
components, which abstracts the internal complexity of device
c) Compositions: Finally, how it is going to be composed
and provide easy user interface to operate and similarly can be
and reassembled?
used as a building block in new product development. Among
all IT giant, Microsoft was the first one, who understood the
Semantics provide description of components and describe
industry needs and succeed to cash this ready market.
the components usage and functionality. Where syntax
Microsoft offered the Development Kit known as “Microsoft

27
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
denotes the component’s algorithms and development
complexity, which give the physical structure to component.
Finally composition provides overall wrapper mechanism to
compose the various functionality of a component and present
it for reuse to customers.
In some areas, life cycle of component is much similarly as
window or web software development lifecycle but modeling,
packaging and implementation are totally different from general
software development process. An in depth domain analysis
and method of packaging and deployment of compiled binary
code in such a loose couple way, makes component’s lifecycle
special.
The demands and requirements for software component keep
fluctuating according to new system requirements in market,
so while developing a new software component for reuse,
developers need to follow some guidelines for component
design and development, however still software industry don’t
have a standard guideline for building reusable components
but seasoned author like Lowy [2] and [4] proposed their own
guidelines for component architecture. On comparing this study
find that [3] is more specific about lower level of programming
concepts, while [5] is more focused on bigger picture about
component design and reuse potential for industries.
Figure 1. Difference between Producer Reuse and Consumer
Reuse.
Furthermore, software component lies, in two categoriesas,
“for reuse” and “with reuse”. Similarly [1], claimedthat usage
of software component can be divided into two categories:
a) Consumer Reuse: which mean, development of new
software systems, using existing component, called as
“development with reuse”.
b) ProducerReuse: which means, developing, building new
portable components, for further reuse, called
“Development for Reuse”.
The figure 1, presents the differentiation between producer
reuse and consumer reuse.
PROPOSED GUIDELINESFOR DEVELOPING
REUSABLE .NET COMPONENTS
One of the main advantages of building components is to
28
promote reusability. Visual Studio .NET also supports such a
paradigm, wherein the components that we develop can be
hosted inside the toolbar and then dragged and dropped into
the various projects. The development environment then writes
the necessary code for us. Before starting component design
However, some self-assessment questions can be helpful for
architects to component design [5]:
• Identifying the common functions in domain to avoid
duplications of tasks.
• Dependency on other components and hardware devices.
• Optimized designed for further technology up gradation.
• Easy use and implementation with some minor changes.
• How valid is component decomposition for reuse?
• From business point of view, a good Return on
Investment (ROI) of a software component ensures the
component’s longer life and usage in application
domains.
The design for reuse provides a set of clear implementation
steps, which should be followed by architects and developers.
This set of guidelines can be classified into a number of
categories:
• Supporting components reuse by providing exception
handlers.
• Interface based programming.
• Using Delegate to provide flexibility using strong type
function pointers.
• Use of Generic<T>, make classes and functions more
reusable with any data type.
• Inheritance (Is a relationship) ensure the relationship
between classes and their derived objects; provide
foundation of Object Oriented Programming concepts.
• Design and develop components with Interface based
Programming, which abstracts the code complexity for
user.
• Using Abstract Classes, which provide flexibility over
interface, to alter the implementing class’s functionality.
• Remoting, Object Marshaling
• Multithreading with Thread safety.
• Packaging and deployment.
CONCLUSION
Current technologies help establish a solid foundation to enable
the functionalities of software components. With adequate
technologies in the field of software development Software
component guidelines offer the best practice for component
development. The guidelines for new component development
should be flexible to add in more artifacts and principals to
manipulate them according to current businesses requirements,
which would help to save cost and labor and provide flexible
development environment. This small article tries to present
some of the guidelines for software component development
in .NET environment.
 REFERENCES Aditya Pratap Singh received his
[1]. Lau, K. K. and Wang, Z. (2007) Software Component Master of computer application degree
Models. IEEE Transaction Software Engineering, Vol. from Uttar Pradesh Technical University,
33(10) p. 709-724. Lucknow in 2003. He is perusing PhD
[2]. Lowy, J. (2003) Programming .NETComponent. from Gautam Budhha University, Greater
Cambridge, O’Reilly. Noida. He is assistant professor in the
[3]. MSDN (2013)An Introduction to c# Generics. [online]. Department of MCA at Ajay Kumar Garg
MSDN. Engineering College, Ghaziabad. His
[4]. Ramachandran M. (2008) Software Component: current research interests are in
Guidelines and Applications. New York: Nova Science component-based software engineering and software
publisher. measurement. He has presented his work in several national
[5]. Ravichandran, T. and Rothenberger, A. (2003) Software and international conferences. His work has appeared in IEEE
reuse strategies and component markets. Communication Explore. He has served in program committee relating to national
of ACM. Vol. 6(8) p. 109-110. conferences on cyber security issues.
[6]. Zirpins, C., Ortiz, G., Lamersdorf, W. and Emmerich, W.
(2013) Proceeding of the first international workshop on
engineering service compositions. IBM.

29
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

A SURVEY ON BIG DATA AND MINING

Dheeraj Kumar Singh
Assistant Professor, Department of MCA, AKGEC, Ghaziabad
singhdheeraj4@gmail.com

Abstract–Big Data concern large-volume, complex, growing data

sets with multiple, autonomous sources. With the fast
development of networking, data storage, and the data collection
capacity, Big Data are now rapidly expanding in all science and
engineering domains, including physical, biological and
biomedical sciences. This paper presents a HACE theorem that
characterizes the features of the Big Data revolution, and
proposes a Big Data processing model, from the data mining
perspective. This data-driven model involves demand-driven
aggregation of information sources, mining and analysis, user
interest modeling, and security and privacy considerations. We
analyze the challenging issues in the data-driven model and
also in the Big Data revolution.

1. INTRODUCTION Fig.1 Data Mining with Big Data

What is Big Data? A name and a marketing term, for sure, but
also shorthand for advancing trends in technology that open
the door to a new approach to understanding the world and
making decisions. There is a lot more data, all the time, growing
at 50 percent a year, or more than doubling every two years,
estimates IDC, a technology research firm. It’s not just more
streams of data, but entirely new ones. For example, there are
now countless digital sensors worldwide in industrial
equipment, automobiles, electrical meters and shipping crates.
They can measure and communicate location, movement,
vibration, temperature, humidity, even chemical changes in the
air, mean lot of different type of data all-together.
2. BIG DATA AND DATA MINING
The Big Data is nothing but a data, available at
heterogeneous, autonomous sources, in extreme large
amount, which get updated in fractions of seconds. For
example, the data stored at the server of Facebook, as most
of us, daily use the Facebook; we upload various types of
information, upload photos. All the data get stored at the
data warehouses at the server of Facebook. This data is
nothing but the big data, which is so called due to its
complexity. Also another example is storage of photos at
Flicker. These are the good real-time examples of the Big
Data. Another best example of Big data would be, the
readings taken from an electronic microscope of the
universe. Now the term Data Mining, Finding for the exact
useful information or knowledge from the collected data,
for future actions, is nothing but the data mining. So,
collectively, the term Big Data Mining is a close up view,
with lots of detail information of a Big Data with lots of
information. As shown in fig 1 below. Fig.
3. KEY FEATURES OF BIG DATA
The features of Big Data are:
z It is huge in size.
z The data keep on changing time time to time.
z Its data sources are from different phases.
z It is free from the influence, guidance, or control of
anyone.
z It is too much complex in nature, thus hard to handle.
It’s huge in nature because, there is the collection of data from
various sources together. If we consider the example of
Facebook, lots of numbers of people are uploading their data
in various types such as text, images or videos. The people
also keep their data changing continuously. This tremendous
and instantaneously, time to time changing stock of the data is
stored in a warehouse. This large storage of data requires large
area for actual implementation. As the size is too large, no one
is capable to control it oneself. The Big Data needs to be
controlled by dividing it in groups. Due to largeness in size,
decentralized control and different data sources with different
types the Big Data becomes much complex and harder to
handle. We cannot manage them with the local tools those we
use for managing the regular data in real time. For major Big
Data-related applications, such as Google, Flicker, Facebook,
a large number of server farms are deployed all over the world
to ensure nonstop services and quick responses for local
markets.
4. CHALLENGING ISSUES IN DATA MINING WITH
BIG DATA.
There are three sectors at which the challenges for Big Data
arrive. These three sectors are:

30
z Mining platform.
z Privacy.
z Design of mining algorithms.
Basically, the Big Data is stored at different places and also the
data volumes may get increased as the data keeps on increasing
continuously. So, to collect all the data stored at different places
is that much expensive. Suppose, if we use these typical data
mining methods (those methods which are used for mining the
small scale data in our personal computer systems) for mining
of Big Data, and then it would become an obstacle for it. Because
the typical methods are required data to be loaded in main
memory, though we have super large main memory. To maintain
the privacy is one of the main aims of data mining algorithms.
Presently, to mine information from Big data, parallel computing
based algorithms such as MapReduce are used. In such
algorithms, large data sets are divided into number of subsets
and then, mining algorithms are applied to those subsets.
Finally, summation algorithms are applied to the results of
mining algorithms, to meet the goal of Big Data mining. In this
whole procedure, the privacy statements obviously break as
we divide the single Big Data into number of smaller datasets.
While designing such algorithms, we face various challenges.
As shown in the figure 2 above, there are blind men observing
the giant elephant. Everyone is trying to predict their
conclusion on what the thing is actually. Somebody is saying
that the thing is a hose; someone says it’s a tree or pipe etc.
Actually everyone is just observing some part of that giant
elephant and not the whole, so the results of each blind person’s
prediction is something different than actually what it is.
Similarly, when we divide the Big Data in to number of subsets,
and apply the mining algorithms on those subsets, the results
of those mining algorithms will not always point us to the
actual result as we want when we collect the results together.
5. RELATED WORK
On the level of mining platform sector, at present, parallel
programming models like MapReduce are being used for the
purpose of analysis and mining of data. MapReduce is a batch-
31
oriented parallel computing model. There is still a certain gap
in performance with relational databases. Improving the
performance of MapReduce and enhancing the real-time nature
of large-scale data processing have received a significant
amount of attention, with MapReduce parallel programming
being applied to many machine learning and data mining
algorithms. Data mining algorithms usually need to scan
through the training data for obtaining the statistics to solve
or optimize model. For those people, who intend to hire a third
party such as auditors to process their data, it is very important
to have efficient and effective access to the data. In such cases,
the privacy restrictions of user may be faces like no local copies
or downloading allowed, etc. So there is privacy-preserving
public auditing mechanism proposed for large scale data
storage.[1] This public key-based mechanism is used to enable
third-party auditing, so users can safely allow a third party to
analyze their data without breaching the security settings or
compromising the data privacy. In case of design of data mining
algorithms, Knowledge evolution is a common phenomenon
in real world systems. But as the problem statement differs,
accordingly the knowledge will differ. For example, when we
go to the doctor for the treatment, that doctor’s treatment
program continuously adjusts with the conditions of the
patient. Similarly the knowledge. For this, Wu [2] [3] [4]
proposed and established the theory of local pattern analysis,
which has laid a foundation for global knowledge discovery in
multisource data mining. This theory provides a solution not
only for the problem of full search, but also for finding global
models that traditional mining methods cannot find.
6. CONCLUSION
Big Data is going to continue growing during the next years,
and each data scientist will have to manage much more amount
of data every year. This data is going to be more diverse, larger,
and faster. We discussed some insights about the topic, and
what we consider are the main concerns and the main
challenges for the future. Big Data is becoming the new Final
Frontier for scientific data research and for business
applications. We are at the beginning of a new era where Big
Data mining will help us to discover knowledge that no one
has discovered before. Everybody is warmly invited to
participate in this intrepid journey.
REFERENCES
[1] C. Wang, S.S.M. Chow, Q. Wang, K. Ren, and W. Lou,
“Privacy- Preserving Public Auditing for Secure Cloud
Storage” IEEE Trans. Computers, vol. 62, no. 2, pp. 362-
375, Feb. 2013.
[2] X. Wu and S. Zhang, “Synthesizing High-Frequency
Rules from Different Data Sources,” IEEE Trans.
Knowledge and Data Eng., vol. 15, no. 2, pp. 353-367,
Mar./Apr. 2003.
[3] X. Wu, C. Zhang, and S. Zhang, “Database Classification
for Multi-Database Mining,” Information Systems,
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
vol. 30, no. 1, pp. 71- 88, 2005
[4] K. Su, H. Huang, X. Wu, and S. Zhang, “A Logical
Framework for Identifying Quality Knowledge from
Different Data Sources,” Decision Support Systems, vol.
42, no. 3, pp. 1673-1683, 2006.
[5] E.Y. Chang, H. Bai, and K. Zhu, “Parallel Algorithms for
Mining Large-Scale Rich-Media Data,” Proc. 17th ACM
Int’l Conf. Multimedia, (MM ’09,) pp. 917-918, 2009.
32
[6] D. Howe et al., “Big Data: The Future of Biocuration,”
Nature, vol. 455, pp. 47-50, Sept. 2008.
[7] A. Labrinidis and H. Jagadish, “Challenges and
Opportunities with Big Data,” Proc. VLDB Endowment,
vol. 5, no. 12, 2032-2033, 2012.
[8] Y. Lindell and B. Pinkas, “Privacy Preserving Data
Mining,” J. Cryptology, vol. 15, no. 3, pp. 177-206, 2002.
 MOBILE CYBER THREATS
Arpna Saxena
Assistant Professor, MCA Department
E-mail: saxenaarpna@gmail.com

Abstract–Smart phones and tablets have long been established data, such as email, calendars, contact information, and
as popular personal electronics devices. Cyber-threats, including passwords, on the devices. Mobile applications for social
those targeting mobile devices, are directly linked to cybercrime. networking keep a wealth of personal information. Recent
In most developed countries, creating and distributing malicious
innovations in mobile commerce have enabled users to conduct
software is a criminal offence. Although such criminal acts are
many transactions from their smart phone, such as purchasing
perpetrated in virtual environments, their victims lose real
assets, such as personal data and money. Combating cybercrime goods and applications over wireless networks, redeeming
is particularly difficult because cybercriminals do not need to coupons and tickets, banking, processing point-of-sale
cross the borders of other countries to commit crimes in those payments, and even paying at cash registers.
territories. At the same time, enforcement authorities in these
same countries have to overcome numerous barriers in order to 2. TYPICAL ATTACKS LEVERAGE PORTABILITY AND
administer justice. Therefore, international cooperation SIMILARITY TO PCS
between information security experts and law enforcement Mobile phones share many of the vulnerabilities of PCs.
authorities is required to effectively combat crime in the virtual
However, the attributes that make mobile phones easy to carry,
world.
use, and modify open them to a range of attacks.
z Perhaps most simply, the very portability of mobile
1. INTRODUCTION
phones and PDAs makes them easy to steal. The owner
Smart phones, or mobile phones with advanced capabilities
of a stolen phone could lose all the data stored on it,
like those of personal computers (PCs), are appearing in more
from personal identifiers to financial and corporate data.
people’s pockets, purses, and briefcases. Smart phones’
Worse, a sophisticated attacker with enough time can
popularity and relatively lax security have made them attractive
defeat most security features of mobile phones and gain
targets for attackers.
access to any information they store [5].
z Many seemingly legitimate software applications, or
The number and sophistication of attacks on mobile phones is
apps, are malicious [6]. Anyone can develop apps for
increasing, and countermeasures are slow to catch up.
some of the most popular mobile operating systems, and
mobile service providers may offer third-party apps with
Smart phones and personal digital assistants (PDAs) give users
little or no evaluation of their safety. Sources that are not
mobile access to email, the internet, GPS navigation, and many
affiliated with mobile service providers may also offer
other applications. However, smart phone security has not
unregulated apps that access locked phone capabilities.
kept pace with traditional computer security. Technical security
Some users “root” or “jailbreak” their devices, bypassing
measures, such as firewalls, antivirus, and encryption, are
operating system lockout features to install these apps.
uncommon on mobile phones, and mobile phone operating
z Even legitimate smart phone software can be exploited.
systems are not updated as frequently as those on personal
Mobile phone software and network services have
computers [3]. Mobile social networking applications
vulnerabilities, just like their PC counterparts do. For
sometimes lack the detailed privacy controls of their PC
years, attackers have exploited mobile phone software
counterparts. Unfortunately, many smart phone users do not
to eavesdrop, crash phone software, or conduct other
recognize these security shortcomings. Many users fail to
attacks [7]. A user may trigger such an attack through
enable the security software that comes with their phones,
some explicit action, such as clicking a maliciously
and they believe that surfing the internet on their phones is as
designed link that exploits vulnerability in a web browser.
safe as or safer than surfing on their computers [4].
A user may also be exposed to attack passively, however,
simply by using a device that has a vulnerable application
Meanwhile, mobile phones are becoming more and more
or network service running in the background [8].
valuable as targets for attack. People are using smart phones
z Phishing attacks use electronic communications to trick
for an increasing number of activities and often store sensitive
users into installing malicious software or giving away

33
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

sensitive information. Email phishing is a common attack is often addressed in terms of five cornerstone segments as
on PCs, and it is just as dangerous on email-enabled shown below.
mobile phones. Mobile phone users are also vulnerable
to phishing voice calls (“vishing”) and SMS/MMS
messages (“smishing”) [9]. These attacks target feature
phones (mobile phones without advanced data and
wireless capabilities) as well as smart phones, and they
sometimes try to trick users into receiving fraudulent
charges on their mobile phone bill. Phishers often
increase their attacks after major current events, crafting
their communications to look like news stories or
solicitations for charitable donations. Spammers used
this strategy after the March 2011 earthquake and
tsunami in Japan [10].

3. CONSEQUENCES OF A MOBILE ATTACK CAN BE

SEVERE
Many users may consider mobile phone security to be less
important than the security of their PCs, but the
consequences of attacks on mobile phones can be just as
severe. Malicious software can make a mobile phone a
member of a network of devices that can be controlled by
an attacker (a “botnet”). Malicious software can also send
device information to attackers and perform other harmful
commands. Mobile phones can also spread viruses to PCs
that they are connected to. Losing a mobile phone used to
mean only the loss of contact information, call histories,
text messages, and perhaps photos. However, in more recent
years, losing a smart phone can also jeopardize financial
information stored on the device in banking and payment
apps, as well as usernames and passwords used to access
apps and online services. If the phone is stolen, attackers could
use this information to access the user’s bank account or credit
card account. An attacker could also steal, publicly reveal,
or sell any personal information extracted from the device,
including the user’s information, information about
contacts, and GPS locations. Even if the victim recovers the
device, he or she may receive many spam emails and SMS/
MMS messages and may become the target for future
phishing attacks. Some personal and business services add
a layer of authentication by calling a user’s mobile phone or
sending an additional password via SMS before allowing the
user to log onto the service’s website. A stolen mobile phone
gets an attacker one step closer to accessing the services as
the user. If the device contains the owner’s username and
password for the service, the attacker would have everything
necessary to access the service.
4. FIVE CORNERSTONES OF MOBILE
CYBERSECURITY
Mobile communications are a complex ecosystem comprised
of a broad list of technologies and players integrated into a
“system-of-systems” that enables the wireless environment
that consumers enjoy today. Within this ecosystem, security
Next, we explore each of the five segments, the threat landscape
and the proactive steps the mobile industry is taking to address
the threats through solutions available today
1. Consumers and End Users Industry is working hard, and
with growing success, to educate users on how to reduce their
cybersecurity risks. Best practices that the industry
recommends for consumers to become security savvy include:
z configure Devices to Be more Secure – Smart phones
and other mobile devices have password features that
lock the devices on a scheduled basis. After a
predetermined period of time of inactivity (e.g., one
minute, two minutes, etc.) the device requires the correct
PIN or password to be entered. Encryption, remote-wipe
capabilities and - depending on the operating system -
anti-virus software may also serve to improve security.
z “caveat Link” – Beware of suspicious links. Do not click
on links in suspicious emails or text messages as they
may lead to malicious websites.
z Exercise caution Downloading apps – Avoid
applications from unauthorized application stores. Some
application stores vet apps so they do not contain
malware. Online research on an app before downloading
is often a sound first step.
z check Permissions – Check the access (i.e., access to
which segments of your mobile device) that an application
requires, including Web-based applications, browsers
and native applications.

34

z Know your Network – Avoid using unknown Wi-Fi
networks and use public Wi-Fi hot spots sparingly.
Hackers can create “honey pot” Wi-Fi hot spots intended
to attract, and subsequently compromise, mobile devices.
Similarly, they troll public Wi-Fi spots looking for
unsecured devices. If you have Wi-Fi at home, enable
encryption.
z Don’t Publish your mobile Phone Number – Posting
your mobile phone number on a public website can make
it a target for software programs that crawl the Web
collecting phone numbers that may later receive spam, if
not outright phishing attacks.
z Use your mobile Device as it Was Setup – Some people
use third-party firmware to override settings on their
mobile devices (e.g., enabling them to switch service
providers). Such “jail breaking” or “rooting” can result
in malware or malicious code infecting the mobile devices.
These are only a few of the strategies and resources available
from the industry, but the bottom line is that users play an
important role in protecting their devices, especially what they
download and links they click on. Consumers benefit the best
from cybersecurity when they are aware of the variety of
security options that are a part of their mobile devices.
2. Device
Today’s mobile devices are miniature computers. In addition
to these truly “smart” phones, there is a growing variety of
devices such as tablets and net book computers that include
wireless connectivity. These new mobile devices are more
advanced than those sold even five years ago. All computers,
including mobile devices, need to be secured to prevent
intrusion. Applications downloaded from questionable, or even
legitimate sites, can record information typed onto the device
(e.g., bank account numbers, passwords and PINs), read data
stored on the device (including emails, attachments, text
messages, credit card numbers and login/password
combinations to corporate intranets); and record conversations
(not only telephone calls) within earshot of the phone. A
malicious application or malware can transmit any of this
information to hackers (including those in foreign countries)
who then use the information for nefarious and criminal
purposes, such as transferring money out of bank accounts
and conducting corporate espionage.
3. Network-Based Security Policies
From a consumer perspective, network operators provide a
wealth of tools that can be used to provide improved security
and data protection for information that resides on the smart
phone or tablet. Such tools include device management
capabilities, firewalls and other network-based functionality.
These tools give consumers the power to protect their
35
Basics for Integration of Data Warehouse and Data Mining
information, but network service providers cannot dictate
security policies for consumers to follow. However, service
providers provide a wealth of consumer educational materials
and practices for enhanced security protection.
4. Authentication and Control
A lost, unlocked smart phone with pre-programmed access to
a bank account or a corporate intranet can cause incalculable
damage. Authentication control is the process of determining
if a user is authorized to access information stored on the
device or over a network connection.
5. Cloud, Networks and Services Networks deliver many of
the applications and services that consumers enjoy today. As
illustrated, the complex security solutions the industry
provides encompass multiple types of network access
connections: the cloud, the Internet backbone, core network
and access network connections.
5. ACT QUICKLY IF YOUR MOBILE PHONE OR PDA
IS STOLEN
z Report the loss to your organization and/or mobile
service provider. If your phone or PDA was issued by an
organization or is used to access private data, notify
your organization of the loss immediately. If your personal
phone or PDA was lost, contact your mobile phone
service provider as soon as possible to deter malicious
use of your device and minimize fraudulent charges.
z Report the loss or theft to local authorities. Depending
on the situation, it may be appropriate to notify relevant
staff and/or local police.
z Change account credentials. If you used your phone or
PDA to access any remote resources, such as corporate
networks or social networking sites, revoke all
credentials that were stored on the lost device. This may
involve contacting your IT department to revoke issued
certificates or logging into websites to change your
password.
z If necessary, wipe the phone. Some mobile service
providers offer remote wiping, which allows you or your
provider to remotely delete all data on the phone.
6. CYBER SAFETY
As our use of the devices increases and expands to new features
and functions in other areas such as banking and healthcare,
they may hold even more personal data. By following CTIA–
The Wireless Association and its members’ simple
CYBERSAFETY tips, consumers can actively protect
themselves and their data.
C – Check to make sure the websites downloads, SMS links,
etc. are legitimate and trustworthy BEFORE you visit or add to
them to your mobile device so you can avoid adware /spyware/
viruses/ unauthorized charges/etc. Spyware and adware may
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
provide unauthorized access to your information, such as
location, websites visited and passwords, to questionable
entities. You can validate an application’s usage by checking
with an application store. To ensure a link is legitimate, search
the entity’s website and match it to the unknown URL.
Y – Year-round, 24/7, always use and protect your wireless
device with passwords and PINs to prevent unauthorized
access. Passwords/PINs should be hard to guess, changed
periodically and never shared. When you aren’t using your
device, set its inactivity timer to a reasonably short period (i.e.,
1–3 minutes).
B – Back-up important files from your wireless device to your
personal computer or to a cloud service/application periodically
in case your wireless device is compromised, lost or stolen.
E – Examine your monthly wireless bill to ensure there is no
suspicious and unauthorized activity. Many wireless providers
allow customers to check their usage 24/7 by using shortcuts
on their device, calling a toll-free number or visiting their
website. Contact your wireless provider for details.
R – Read user agreements BEFORE installing software or
applications to your mobile device. Some companies may use
your personal information, including location, for advertising
or other uses. Unfortunately, there are some questionable
companies that include spyware/malware/viruses in their
software or applications
S – Sensitive and personal information, such as banking or
health records, should be encrypted or safeguarded with
additional security features, such as Virtual Private Networks
(VPN). For example, many applications stores offer encryption
software that can be used to encrypt information on wireless
devices.
A – Avoid rooting, jail breaking or hacking your mobile device
and its software as it may void your device’s warranty and
increase the risk of cyber threats to a wireless device.
F – Features and apps that can remote lock, locate and/or
erase your device should be installed and used to protect your
wireless device and your personal information from
unauthorized users.
E – Enlist your wireless provider and your local police when
your wireless device is stolen. If your device is lost, ask your
provider to put your account on “hold” in case you find it. In
the meantime, your device is protected and you won’t be
responsible for charges if it turns out the lost device were
stolen. The U.S. providers are creating a database designed
to prevent smart phones, which their customers report as
stolen, from being activated and/or provided service on the
36
networks.
T – Train yourself to keep your mobile device’s operating
system (OS), software or apps updated to the latest version.
These updates often fix problems and possible cyber
vulnerabilities. You may need to restart your mobile device
after the updates are installed so they are applied immediately.
Many smart phones and tablets are like mini-computers so it’s
a good habit to develop.
Y – You should never alter your wireless device’s unique
identification numbers (i.e., International Mobile Equipment
Identity (IMEI) and Electronic Serial Number (ESN)). Similar to
a serial number, the wireless network authenticates each mobile
device based on its unique number
7. CONCLUSION
Effective cybersecurity – whether for a nation, business,
organization or individual – is the result of a partnership
between the entity being protected and those in the industry
that makes mobile communications possible. All of the
participants, from the consumer to the manufacturers, carriers,
applications developers, software providers, etc. have a role
to play. At every step of the process, there is a shared
responsibility for making cybersecurity a priority. The good
news is that as a result of the historical, ongoing and concerted
efforts of industry, regulators and lawmakers, public knowledge
of the need for heightened cybersecurity has grown and
continues to grow.
While achieving political consensus is always a challenge,
there appears to be a widespread understanding among
policymakers that a single legislative “fix” for cybersecurity
does not exist; therefore, a flexible approach to legislation in
the wireless arena is necessary. The threat landscape is, by
definition, a non-static one. Enabling cybersecurity, as a result,
cannot be achieved by following a set list of mandated criteria.
Even if such a list were to exist, it would be outdated the same
day it was established.
Cybersecurity threats and vulnerabilities can change from day
to day, and even hour to hour. The effective steps for managing
cyber risks today are unlikely to suffice for very long.
Maintaining security in a wireless environment is a constantly
evolving dynamic.
However, policymakers play an important role in cybersecurity.
Policy efforts that are informed by the realities of the
cybersecurity atmosphere — no silver bullet, no single fix,
many moving parts and all of them interdependent — are a
must.
8. REFERENCE
[1] PandaLabs. “Quarterly Report PandaLabs (January-
March 2011).”
[2] Symantec. “Symantec Report Finds Cyber Threats [7] National Institute of Standards and Technology.
Skyrocket in Volume and Sophistication.” “Guidelines on Cell Phone and PDA Security (SP 800-
[3] National Institute of Standards and Technology. 124).”
“Guidelines on Cell Phone and PDA Security (SP 800- [8] John Cox. “iPhone on Wi-Fi Vulnerable to Security
124).”. Attack.”
[4] Trend Micro. “Smartphone Users: Not Smart Enough [9] US-CERT. “Technical Information Paper-TIP-10-105-01:
About Security.” Cyber Threats to Mobile Devices.”
[5] National Institute of Standards and Technology.
“Guidelines on Cell Phone and PDA Security (SP 800- Ms. Arpna Saxena is working as
124).” Assistant Professor with Ajay Kumar
[6] “Technical Information Paper: Cyber Threats to Mobile Garg Engineering College, Ghaziabad.
Devices” (http://www.us-cert.gov/reading_room/TIP10- She has completed her MCA in 2003 from
105-01.pdf) HNBU University, Uttranchal and
M.Tech. in 2014 from Guru Gobind Singh
University, Delhi.

37
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad

APPLICATIONS OF PALM VEIN AUTHENTICATION

TECHNOLOGY
Indu Verma
Assistant Professor, MCA Department AKGEC, Ghaziabad (U.P)
E-mail: induverma029@gmail.com

Abstract– The vein information is hard to duplicate since veins
are internal to the human body. The palm vein authentication
technology offers a high level of accuracy. Palm vein
authentication uses the vascular patterns of an individual’s
palm as personal identification data. Compared with a finger
or the back of a hand, a palm has a broader and more complicated
vascular pattern and thus contains a wealth of differentiating
features for personal identification. This paper discusses the
contactless palm vein authentication device that uses blood
vessel patterns as a personal identifying factor. The vein
information is hard to duplicate since veins are internal to the
human body. The palm vein authentication technology offers a
high level of accuracy.
I. INTRODUCTION
Palm vein authentication uses the vascular patterns of an
individual’s palm as personal identification data. Compared
with a finger [1] or the back of a hand, a palm has a broader and
more complicated vascular pattern and thus contains a wealth
of differentiating features for personal identification. The palm
is an ideal part of the body for this technology; it normally
does not have hair which can be an obstacle for photographing
the blood vessel pattern, and it is less susceptible to a change
in skin color, unlike a finger or the back of a hand. The deoxidized
hemoglobin in the vein vessels absorb light having a
wavelength of about 7.6 x 10-4 mm within the near-infrared
area [2]. When the infrared ray image is captured, unlike the
image seen in Fig.1, only the blood vessel pattern containing
the deoxidized hemoglobin is visible as a series of dark lines
(Fig.2). Based on this feature, the vein authentication device
translates the black lines of the infrared ray image as the blood
vessel pattern of the palm (Fig. 3), and then matches it with the
previously registered blood vessel pattern of the individual.
Fig.1. Fig.2. Fig.3. Fig.4.
Visible Infrared Extracted Palm vein
ray image ray image vein pattern sensor
Biometrics are automated methods of recognizing a person
based on a physiological or behavioral characteristic. Among
the features measured are; face, fingerprints, hand geometry,
handwriting, iris, retinal, vein, and voice. Biometric systems
are superior because they provide a nontransferable means of
identifying people not just cards or badges. The key point
about an identification method that is ”nontransferable" means
it cannot be given or lent to another individual so nobody can
get around the system they personally have to go through the
control point. The fundamentals of biometrics are that they are
things about a person:
- Measurable - things that can be counted, numbered or
otherwise quantified
- Physiological characteristics - like height, eye color,
fingerprint, DNA etc.
- Behavioral characteristics - such as the way a person
moves, walks, types.
In a practical biometric system (i.e., a system that employs
biometrics for personal recognition), there are a number of
other issues that should be considered, including: Performance,
which refers to the achievable recognition accuracy and speed,
the resources required to achieve the desired recognition
accuracy and speed, as well as the operational and
environmental factors that affect the accuracy and speed;
Acceptability, which indicates the extent to which people are
willing to accept the use of a particular biometric identifier
(characteristic) in their daily lives; Circumvention, which
reflects how easily the system can be fooled using fraudulent
methods. A key advantage of biometric authentication is that
biometric data is based on physical characteristics that stay
constant throughout one’s lifetime and are difficult(some more
than others) to fake or change. Biometric identification can
provide extremely accurate, secured access to information;
fingerprints, palm vein and iris scans produce absolutely unique
data sets (when done properly). Automated biometric
identification can be done rapidly and uniformly, without
resorting to documents that may be stolen, lost or altered. It is
not easy to determine which method of biometric data gathering
and reading does the "best" job of ensuring secure
authentication. Each of the different methods has inherent

38
advantages and disadvantages. Some are less invasive than
others; some can be done without the knowledge of the
subject; others are very difficult to fake.
Palm vein authentication uses an infrared beam to penetrate
the users hand as it is held over the sensor; the veins within
the palm of the user are returned as black lines. Palm vein
authentication has a high level of authentication accuracy due
to the uniqueness and complexity of vein patterns of the palm.
Fig5: Fig6: Fig7: Fig8:
Iris scan Face recognition Finger print Palm print
Because the palm vein patterns are internal to the body, this is
a difficult method to forge. Also, the system is contactless and
hygienic for use in public areas.
II. PREVIOUS WORKS
Biometrics authentication is a growing and controversial field
in which civil liberties groups express concern over privacy
and identity issues. Today, biometric laws and regulations are
in process and biometric industry standards are being tested.
Automatic recognition based on “who you are” as opposed to
“what you know” (PIN) or “what you have” (ID card).
Recognition of a person by his body & then linking that body
to an externally established identity forms a very powerful tool
for identity management Biometric Recognition. Figure 1 shows
the different type of biometric authentication. Canadian airports
started using iris scan in 2005 to screen pilots and airport
workers. Pilots were initially worried about the possibility that
repeated scans would negatively affect their vision but the
technology has improved to the point where that is no longer
an issue. Canada Customs uses an iris scan system called
CANPASS-Air for low-risk travelers at Pearson airport.
Finger vein authentication is used as a new biometric method
utilizing the vein patterns inside one’s fingers for personal
identification. Vein patterns are different for each finger and
for each person, and as they are hidden underneath the skin’s
surface, forgery is extremely difficult. These unique aspects of
finger vein pattern recognition set it apart from previous forms
of biometrics and have led to its adoption by the many financial
institutions as their newest security technology.
III. IMPLEMENTATION OF CONTACTLESS
PALM VEIN AUTHENTICATION
The contactless palm vein authentication technology consists
of image sensing and software technology. The palm vein
39
sensor (Fig.6) captures an infrared ray image of the user’s palm.
The lighting of the infrared ray is controlled depending on the
illumination around the sensor, and the sensor is able to capture
the palm image regardless of the position and movement of the
palm. The software then matches the translated vein pattern
with the registered pattern, while measuring the position and
orientation of the palm by a pattern matching method.
Implementation of a contactless identification system enables
applications in public places or in environments where hygiene
standards are required, such as in medical applications. In
addition, sufficient consideration was given to individuals who
are reluctant to come into direct contact with publicly used
devices.
The first step in all palm vein authentication applications is the
enrolment process, which scans the user's palm and records
the unique pattern as an encrypted biometric template in the
database or on the smart card itself. In banking applications,
for example, once a new customer has been issued a smart
card, he/she is asked to visit the bank in order to enroll her
vein data.
Fig 9. Schematic of the hand vein pattern imaging module.
IV. COMPARISONS
Comparing bioguard and Mohamed Shahin proposal [5], it
seems bioguard palm vein technology provide advantages,
such as:
Accuracy and Reliability – Uniqueness and complexity of vein
patterns, together with advanced authentication algorithms,
ensure unsurpassed accuracy. Field test duration less than iris
recognition, and near-zero false rejection and false acceptance
rates.
Security – Vein patterns are internal and unexposed, making
them almost impossible to duplicate or forge. Images are
converted into encrypted biometric templates at the sensor
level, preventing misuse of the actual image.
Contactless – Hygienic, non-invasive, "no touch" technology
enables use when hands are dirty, wet or even wearing some
types of latex gloves.
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
Cost-Effective – Attractively priced while saving you the huge
potential costs of malpractice litigation, privacy violations, etc.
Provides a high level of security at a reasonable cost.
Usability – Compact form factor provides greater flexibility
and ease of implementation in a variety of security applications.
Application areas for palm vein technology are it supports
variety of banking scenarios:
1. ATMs 2. Walk-in-customers 3. Internal branch security 4.
Remote banking.
Whereas the advantages in [5] is that Hand Vein Verification
System (HVVS) is accurate in the low to medium security level,
these hand vein verification is purely system base, it’s puts
more effort on the overall performance of a system. These
system checks the FAR(%)(false acceptance rate) and the
FRR(%)(false rejection rate) with different threshold unit, to
get the optimal threshold.
V CONCLUSION
Reliable personal recognition is critical to many applications
in our day to day life.
Biometrics refers to automatic recognition of an individual based
on her behavioural and/or physiological characteristics. It is
obvious that any system assuring reliable personal recognition
must necessarily involve a biometric component. This is not
however, to state that biometrics alone can deliver reliable
personal recognition component. Biometric-based systems also
have some limitations that may have adverse implications for
the security of a system. While some of the limitations of
biometrics can be overcome with the evolution of biometric
technology and a careful system design, it is important to
understand that foolproof personal recognition systems simply
do not exist and perhaps, never will. Security is a risk
management strategy that identifies controls, eliminates, or
minimizes uncertain events that may adversely affect system
resources and information assets. The security level of a system
depends on the requirements (threat model) of an application
and the cost-benefit analysis.
As biometric technology matures, there will be an increasing
interaction among the market, technology, and the applications.
This interaction will be influenced by the added value of the
technology, user acceptance, and the credibility of the service
provider. It is too early to predict where and how biometric
technology would evolve and get embedded in which
applications. But it is certain that biometric-based recognition
will have a profound influence on the way we conduct our
daily business.
40
REFERENCES
[1] “Extraction of Finger-Vein Patterns Using Maximum
Curvature Points in Image Profiles,” in Proceedings of
the 9th IAPR Conf. on Machine Vision Applications, N.
Miura, A. Nagasaka, and T. Miyatake, (MVA2005,
Tsukuba Science City, Japan, 2005), pp. 347-350.
[2] Bio-informatics Visualization Technology committee, Bio-
informatics Visualization Technology (Corona
Publishing, 1997), p.83, Fig.3.2
[3] “Palm Vein Authentication System: A Review”,
International Journal of Control and Automation Vol. 3,
No. 1, March, 2010
[4] “Palm vein authentication technology and its
applications”, proceeding of The Biometric Consortium
Conference, September 19-21st 2005,Hyatt Regency
Crystal City, Arlington, VA, USA
[5] Mohamed Shahin, Ahmed Badawi, and Mohamed Kamel,
”Biometric Authentication Using Fast Correlation of Near
Infrared Hand Vein Patterns”, International Journal of
Biological and Medical Sciences, vol 2,No.1,winter 2007,
pp. 141-148.
[6] Shi Zhao, Yiding Wang and Yunhong Wang, “Extracting
Hand Vein Patterns from Low-Quality Images: A New
Biometric Technique Using Low-Cost Devices”, Fourth
International Conference on Image and Graphics, 2007.
[7] Masaki Watanabe, Toshio Endoh,Morito Shiohara, and
Shigeru Sasaki,” Palm vein authentication technology
and its applications”, The Biometric Consortium
Conference, September 19-21, 2005,USA, pp. 1-2.
[8] “Palm Vein Authentication Technology” white paper,
Bioguard, Innovative Biometric Solutions, March, 2007.
[9] Yuhang Ding, Dayan Zhuang and Kejun Wang, “A Study
of Hand Vein Recognition Method”, The IEEE
International Conference on Mechatronics & Automation
Niagara Falls, Canada, July 2005.
Indu Verma is working as an assistant
professor in Ajay Kumar Garg
Engineering College, Ghaziabad,
U.P(India), she has obtained her M-Tech
(Computer Engineering) with Hons. from
Shobhit University and MCA from U.P
technical University, Lucknow (U.P.). She
has been in teaching from last 9.5 years;
she has been member of several academic and administrative
committees.
During her teaching tenure she has also been coordinated a
National Conference and many Technical fests at college level.
She has attended several seminars, workshops and conferences
at various levels. Also she has some papers published at
national and international conferences. Her area of research
includes Biometric System authentication, Computer Networks,
Network Security and Database.
 PON TOPOLOGIES FOR DYNAMIC OPTICAL
ACCESS NETWORKS
Sanjeev K. Prasad
Asst. Prof. MCA Department, AKGEC Ghaziabad
sanjeevkps2002@gmail.com

Abstract– PON-based access networks envisage the demonstration 2. NETWORK ARCHITECTURE

of scalability to allow gradual deployment of time and
wavelength multiplexed architectures in a single-platform
without changes in fiber infrastructure and also highly-efficient
bandwidth allocation for service provision and upgrade on-
demand. This is achieved by the application of coarse-fine
grooming to route reflective-ONUs of time and wavelength
PONs collectively and the development of MAC protocols
enabling the OLT to dynamically assign available time slots
among ONUs and demonstrate efficient bandwidth and
wavelength assignment.
Keywords: PON, coarse WDM (CWDM), dynamic bandwidth
allocation (DBA), quality of service (QoS).
1. INTRODUCTION
The emergence of new bandwidth-intensive applications
articulated by distance learning, online gaming, Web 2.0 and
movie delivery by means of high-definition video, has
ultimately justified the necessity of upgrading the access
network infrastructure to provide fat-bandwidth pipelines at
subscriber close proximity. Passive optical networks (PONs)
offer currently more opportunities to communicate these
services than ever before, with potential connection speeds of
up to 100 Mbit/s in mind [1]. A scalable multi-PON access
network architecture [2] has been investigated in that direction
to provide interoperability among dynamic time division
multiplexing (TDM) and wavelength division multiplexing
(WDM)-PONs through coarse WDM (CWDM) routing in the
optical line terminal (OLT). To provide bandwidth on demand,
a novel TDM dynamic minimum bandwidth (DMB) allocation
protocol and an upgraded version have been proposed to
achieve quality of service (QoS) at three different service levels
and diverse network throughputs [3]. In addition, to allow for
WDM-PON resource allocation, to overcome the inevitable
network congestion of single wavelength networks, the
developed medium access control (MAC) protocols have been
extended to implement logical point-to-point topologies based
on general loop-back WDM-PON architectures [2] to increase
service provisioning between reflective optical network units
(ONUs) and the OLT by vigorously distributing network
capacity simultaneously between the upstream and
downstream.
The network architecture in Fig. 1 exhibits a single 4x4 coarse
array waveguide grating (AWG) in the OLT to route multiple
TDM and WDM-PONs by means of a single tunable laser
(TL1) and receiver (RX1) allowing for coarse-fine grooming to
display smooth network upgrade. Proposed coarse AWG
devices display 7 nm, 3 dB Gaussian passband windows [4],
denoted in Fig. 1 by coarse ITU-T channels λ1 = 1530 nm and
λ2 = 1550 nm, set to accommodate up to 16, 0.4 nm-spaced
wavelengths to address a total of 16 ONUs per PON. In
downstream, TL1 will optimally utilize λ19, placed at the centre
of the AWG coarse channel λ1, to broadcast information to all
ONUs of TDM-PON1. To address a WDM-PON, TL1 will switch
on all 16 wavelengths, centered ±3.2 nm around coarse channel
λ2, i.e. λ21-16, to address jointly all ONUs in WDM-PON4 [5].
Figure 1. Unlimited-capacity multi-PON
access network architecture.
The established network interoperability is a key feature since
it allows a smooth migration from single to multi-wavelength
optical access to address increasing bandwidth requirements.
Reflective semiconductor optical amplifier (RSOA)-based ONUs
are universally employed, avoiding the necessity of
wavelength-specific, local optical sources. The use of multiple
transceivers in a single OLT to serve all reflective PONs [5]
allows for centralized control to distribute ONU capacity among
upstream and downstream on demand and concurrently provide
each PON with multiple wavelengths for enhanced bandwidth
allocation flexibility. Finally, the network exhibits increased
scalability since extra TLs can be directly applied at unused

41
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
AWG ports in the OLT, e.g. TL2 at I/O port 2, to maintain high
network performance at increased traffic load with low OLT
inventory count since the ratio of subscriber number to OLT
transceivers is comparatively high.
3. NETWORK BANDWIDTH MANAGEMENT
To allow centralized, dynamic bandwidth allocation among the
architecture’s TDM and WDM-PONs, the OLT according to
the developed algorithms will assign varying frame time-slots,
initially to each PON in order-of demand and subsequently
arrange each PON bandwidth among their ONUs based on
their service level and individual bandwidth requirement [3, 6].
In that direction, the DMB protocol [3] provides ONUs in TDM-
PONs with three service levels at different weights, Wt, to
represent network accessing priority. Subsequently the
algorithm automatically assigns to each ONU a guaranteed
minimum bandwidth, Bt min, from the overall network capacity,
to satisfy their basic service requirements at various service
levels t and apportions any unused bandwidth to ONUs
according to their buffer queuing status. Following probable
variations in network capacity, it is capable of readjusting the
guaranteed minimum and unused bandwidths among ONUs to
comply with subscriber contracts. For service level t, for example
the maximum allocated bandwidth Bmax_allocated for ONUi will be
equal to the addition of Bt min and the extra assigned bandwidth,
Bex_assigned. Otherwise, if the bandwidth requirement, Ri, is smaller
than the total, Bmax_allocated will be equal to the required
bandwidth, Ri, as given by (1).
To further reduce the packet waiting time in the ONUs, the
network traffic self-similarity characteristics have been
incorporated into the DMB protocol [6]. In addition, since the
upstream and downstream channels are independent, the grant
massages for subsequent polling cycles can be communicated
before the last ONU has finished its upstream transmission.
Consequently the OLT in what is known as the advanced DMB
(ADMB) protocol possess the capability to automatically re-
arrange the upstream transmission order by assigning the ONU
with the longest upstream transmission period to the last
upstream time slot, reducing the idle period and increasing the
overall network throughput. Contrasting the ADMB protocol
with published dynamic bandwidth assignment algorithms,
simulation results have shown [6] substantial reductions in
mean packet delay, particularly at high network load in relation
to the IPACT algorithm [7].
4. LONG-REACH PONS
The scalability of the presented network architecture is
currently further explored by investigating its ability to
demonstrate a long-reach, wide-splitting ratio network shared
42
by numerous TDM and WDM-PONs [8], offering significant
cost savings in an incorporated access-metro network
infrastructure [8]. The current architecture is believed to be
straightforwardly extendable to such a topology since it already
serves a number of different physical PON locations with
dedicated coarse wavelength channels. To that extend,
extensive splitting ratios can be achieved by exploiting the
decentralized coarse routing capability of the architecture to
allow amplification units to be installed on route if necessary
and to allocate increased number of dedicated wavelength
channels to each physical PON using the multiple free spectral
ranges (FSRs) of the CWDM AWG.
In view of the MAC layer of a typical 100 km long-reach TDM-
PON, the direct implementation of the DMB protocol has
displayed limited performance in terms of bandwidth utilization
due to a recorded, 500 μs increase in packet propagation time
compared to 25 km-PONs, exhibiting a total of 1000 ìs-wide idle
time-slots in each transmission cycle as a result of the report
and grant packets polling times. To achieve acceptable channel
throughput and packet delay performance, an innovative two-
state DMB (TSD) protocol has been demonstrated that utilizes
the idle time slots in the sense of virtual polling cycles, during
which the ONUs can transmit data by means of a prediction
method estimating their bandwidth requirement [9]. The amount
of virtual bandwidths, allocated to ONUs, are determined by
the DMB algorithm with each estimated ONU bandwidth
requirement and 1000 μs idle period regarded as the maximum
polling period parameter [9]. As a result, simulation results
have presented a significant 34% improvement in terms of
channel throughput performance as well as a reduction in
packet delay and packet loss rate [9].
5. HYBRID WIRELESS OPTICAL NETWORKS
The need for convergence of wired and low-cost wireless
technologies in the access network, providing end users with
connection flexibility and mobility, is being explored by
investigating the interoperability of the multi-PON architecture
[2] with WiMAX. This could offer network resilience in case of
fiber failure to individual ONUs through the use of overlapping
WiMAX cells while allow for efficient dynamic resource
allocation to base-station-ONUs of a TDM-PON to provide
additional WiMAX channels by means of a centralized signal
processing approach in the OLT.
6. CONCLUSIONS
The access network architecture presented in this paper utilizes
the coarse channels of an AWG in the OLT and reflective ONUs
to demonstrate dynamic TDM and WDM-PONs, through a
single OLT with coarse-fine grooming features. The use of a
single-AWG, single-TL OLT to address multiple reflective
ONUs of a WDMPON have demonstrated error-free routing of
16, 0.4 nm-spaced wavelengths over a single, 7 nm-wide
Gaussian passband window of the AWG in the presence PDW
shifting. To manage packet transmission, several DBA
protocols have been proposed to dynamically and efficiently
arrange the bandwidth among ONUs. Depending on the
physical-layer architecture, the innovative DMB protocol has
successfully been modified to develop the ADMB and MDMB
protocols for TDM and WDM-PONs respectively to efficiently
improve the performance of channel throughput and packet
delay. Recent developments have concentrated on 100 km-
reach networks to achieve comparable network performance
in terms of channel utilization rate, packet delay, and packet
loss rate to standard access PONs at a superior 400% wider
network coverage by means of the application of the TSD
protocol. Notable initiatives have also been carried out to
investigate the application of multiple wavelength operation
over standard splitter-based GPONs by extending the dynamic
bandwidth algorithms to include an additional dimension, that
of wavelength and the integration of WiMAX to terminate
wireless users to base station-ONUs with the intention of
providing flexibility in resource allocation among end users.
REFERENCES
[1] P.-F. Fournier, “From FTTH pilot to pre-rollout in France,”
presented at CAI Cheuvreux, France, 2007.
[2] Y. Shachaf, C.-H. Chang, P. Kourtessis, J. M. Senior,
“Multi-PON access network using a coarse AWG for
smooth migration from TDM to WDM PON,” OSA Optics
Express, vol. 15, pp. 7840-7844, 2007.
[3] C.-H. Chang, P. Kourtessis, and J. M. Senior, “GPON
service level agreement based dynamic bandwidth
assignment protocol,” Journal of Electronics Letters, vol.
42, pp. 1173-1174, 2006.
[4] J. Jiang, C. L. Callender, C. Blanchetière, J. P. Noad, S.
Chen, J. Ballato, and J. Dennis W. Smith, “Arrayed
Waveguide Gratings Based on Perfluorocyclobutane
Polymers for CWDM Applications,” IEEE Photonics
Technology Letters, vol. 18, pp. 370-372, 2006.
43
[5] Y. Shachaf, P. Kourtessis, and J. M. Senior, “An
interoperable access network based on CWDM-routed
PONs,” presented at 33rd European Conference and
Exhibition on Optical Communication (ECOC), Berlin,
Germany, 2007.
[6] C.-H. Chang, P. Kourtessis, and J. M. Senior, “Dynamic
Bandwidth assignment for Multi-service access in
GPON,” presented at 12th European Conference on
Networks and Optical Communications (NOC),
Stockholm, Sweden, 2007.
[7] G. Kramer, B. Mukherjee, and G. Pesavento, “IPACT a
dynamic protocol for an Ethernet PON (EPON),” IEEE
Communications Magazine, vol. 40, pp. 74-80, 2002.
[8] R. P. Davey and D. B. Payne, “The future of fiber access
systems?” BT Technology Journal, vol. 20, pp. 104 -114,
2002.
[9] C. H. Chang, N. M. Alvarez, P. Kourtessis, and J. M.
Senior, “Dynamic Bandwidth assignment for Multi-
service access in long-reach GPON,” presented at 33rd
European Conference and Exhibition on Optical
Communication (ECOC), Berlin, Germany, 2007.
Sanjeev K. Prasad is an Assistant
Professor in AKGEC, Ghaziabad, an
affiliated college of Uttar Pradesh
Technical University, Lucknow, (India).
He received M. Tech. degree in Computer
Science & Engineering from Uttar
Pradesh Technical University, Lucknow,
(India) and he is pursuing Ph.D. in
Computer Science from Gurukula Kangri
Vishwavidyalay, Haridwar, (India). Before joining this college,
he has served many other colleges affiliated to Uttar Pradesh
Technical University, Lucknow, (India). He has got published
4 papers in international journals and 3 papers published
international conferences. His areas of interest include Mobile
Ad-Hoc Networks and Computer Graphics.
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
AN OVERVIEW OF SEMANTIC SEARCH SYSTEMS
Dr. Pooja Arora
Assistant Professor, MCA Department AKGEC
Ghaziabad, India
puja.arora06@gmail.com
Abstract–Research on semantic search aims to improve
conventional information search and retrieval methods, and
facilitate information acquisition, processing, storage and
retrieval on the semantic web. The past ten years have seen a
number of implemented semantic search systems and various
proposed frameworks. A comprehensive survey is needed to gain
an overall view of current research trends in this field. In this
article, report and findings based on which a generalized
semantic search framework is formalized. Further, issues with
regards to future research in this area are described.
Keywords–Semantic Search, Knowledge Acquisition, Semantic
Web, Information Retrieval.
1. INTRODUCTION
Research in information retrieval (IR) community has developed
variety of techniques to help people locate relevant information
in large document repositories. Besides classical IR models
(i.e., Vector Space and Probabilistic Model) [7], extended
models such as Latent Semantic Indexing, Machine Learning
based models (i.e., Neural Network, Symbolic Learning, and
Genetic Algorithm based models) and Probabilistic Latent
Semantic Analysis (PLSA) have been devised with hope to
improve information retrieval process. However, rapid
expansion of the Web and growing wealth of information
pose increasing difficulties to retrieve information efficiently
on the Web. To arrange more relevant results on top of the
retrieved sets, most of contemporary Web search engines
utilize various ranking algorithms such as PageRank, HITS,
and Citation Indexing that exploit link structures to rank the
search results. Despite the substantial success, those
search engines face perplexity in certain situations due to
the information overload problem on one hand, and
superficial understanding of user queries and documents
on the other. The semantic web is an extension of the current
Web in which resources are described using logic-based
knowledge representation languages for automated machine
processing across heterogeneous systems. In recent years,
its related technologies have been adopted to develop
semantic-enhanced search systems. Significance of the
research in this area is clear for two reasons: it supplements
conventional information retrieval by providing search
services centered on entities, relations, and knowledge; and
development of the semantic web also demands enhanced
search paradigms in order to facilitate acquisition, processing,
storage, and retrieval of the semantic information. The article
44
provides a survey to gain an overall view of the current research
status[1].
2. SEMANTIC SEARCH SYSTEMS
Conventional search techniques are developed on the basis
of words computation model and enhanced by the link analysis.
On one hand, semantic search extends the scope of traditional
information retrieval paradigm from mere document retrieval to
entity and knowledge retrieval; on the other hand, it improves
the conventional IR methods by looking at a different
perspective: the meaning of words, which can be formalized
and represented in machine processible format using ontology
languages such as RDF and OWL. For example, an arbitrary
resource or entity can be described as an instance of a class in
an ontology; having attribute values and relations with other
entities. With the logical representation of resources, a semantic
search system is able to retrieve meaningful results by drawing
inference on the query and knowledge base. As a simple
example, meaning of the query for “people in School of
Computer Science” will be interpreted by a semantic search
system as individuals (e.g., professors and lecturers) who have
relations (e.g., work for or affiliated with) with the school. On
the contrary, conventional IR systems interpret the query based
on its lexical form. Web pages in which the worlds “people”
and ”computer science” co-occur, are probably retrieved. The
cost is that users have to extract useful information from a
number of pages, possibly query the search engine several
times.
2.1 Document-oriented Search
Document-oriented search can be thought of as an extension
of the conventional IR approaches where the primary goal is
to retrieve documents, such as web pages and text documents,
document fragments, scientific publications and ontologies.
In search systems of this category, documents are annotated
using logic-based knowledge representation languages with
respect to annotation and domain ontologies to provide
approximate representations for the topics or contents of
original documents. The retrieval process is carried out by
matching user queries with the resulting semantic
annotations[3]. The early work in SHOE search system
facilitates users constructing constrained logical queries by
specifying attribute values of ontology classes to retrieve
precise results. The main limitations are the manual annotation
process and lack of inference support. There has been

considerable work on speculating the significance of logical
reasoning for semantic search systems. OWLIR adopts an
integrated approach that combines logical inference and
traditional information retrieval techniques. A document is
represented using original text and semantic markup. The
semantic markup and the domain ontology are exploited by
logical reasoners to provide enhanced search results.
Conventional IR system based on the original text is integrated
into the semantic search system to provide complementary
results in case no result is returned by the semantic search.
2.2 Entity and Knowledge-oriented Search
Entity and knowledge-oriented search method expands the
scope of conventional IR systems which solely retrieve
documents. Systems based on this method often model
ontologies as directed graphs and exploit links between entities
to provide exploration and navigation. Attribute values and
relations of the retrieved entities are also shown to provide
additional knowledge and rich user experiences. TAP is one of
the first empirical studies of large scale semantic search on the
Web[4]. It improves the traditional text search by understanding
the denotation of the query terms, and augmenting search
results using a broad-coverage knowledge base with an
inference mechanism based on graph traversal. Recently a
number of systems such as CS-Aktive, RKB Explorer, and
SWSE have been implemented based on the principles of “open
world” and “linked data4”, which coincide with spirit of the
semantic web of being “distributed”.
2.3 Multimedia Information Search
In ontology-based image annotation and search systems,
resources are annotated by domain experts or using text around
images in documents. Early works adopt manual approach
which suppresses scalability. The work in performs query
expansion to retrieve semantically related images by drawing
logical inference on its domain ontology (e.g., using
subsumption relation between concepts). Falcon-S annotates
images using metadata by crawling and parsing pages on the
Web. Disambiguation of resources with same labels is resolved
using context information derived from user queries. Squiggle
is a semantic framework to help building domain-specific
semantic search applications for indexing and retrieving
multimedia items. Its knowledge representation model is based
on the SKOS vocabulary which enables the system to suggest
meanings of queries by a simple inference process, e.g., suggest
alternative labels or synonyms for an image. As a result, images
annotated with one label can be retrieved using the image’s
alternative labels.
2.4 Relation-centered Search
Relation-centered semantic search approach pays special
attention to relations between query terms implicitly expressed
by users. It usually performs an additional query pre-
processing step through the use of external language lexicons,
45
Ambient Intelligence
or an inference process using a knowledge base. AquaLog is a
question-answering system. It implements similarity services
for relations and classes to identify synonyms of verbs and
nouns appearing in a query using WordNet5. The obtained
synonyms are used to match property and entity names in the
knowledge base for answering queries. SemSearch supports
natural language queries and translates them into formal queries
for reasoning. An entity referred by a keyword is matched
against a subject, predicate or object in the knowledge base
using combinations. The above two systems process entity
relations using language lexicon or word combinations.
2.5 Semantic Analytics
Semantic analytics, also known as semantic association
analysis, is introduced by Sheth et al. to discover new insights
and actionable knowledge from large amounts of
heterogeneous content. It is ssentially a graph-theoretic based
approach that represents, discovers and interprets complex
relationships between resources[5]. By modeling RDF database
as directed graph, relationships between entities in knowledge
base are represented as graph paths consisting of a sequence
of links. Search algorithms for semantic associations such as
breadth first and heuristics-based search are discussed in.
Effective ranking algorithms are indispensable because the
number of relationships between entities in a knowledge base
might be much larger than the number of entities. In [2] the
ranking evaluates a number of parameters: context,
subsumption, trust, rarity, popularity, and association length.
2.6 Mining-based Search
Effectiveness of the semantic search depends largely on the
quality and coverage of the underlying knowledge base. The
search methodologies discussed so far either utilise explicit
knowledge, which is asserted in the knowledge base, or implicit
knowledge, which is derived using logical inference with
rules[6]. Another kind of knowledge, which we refer to as
“hidden knowledge”, cannot not be easily observed using
techniques such as information extraction, natural language
processing, logical inference, and semantic analytics. For
example, “who are the experts in semantic web research
community?”, “Which institutions ranks highly in the machine
learning research area?”. Such knowledge can only be derived
from large amount of data by using some sort of sophisticated
data analysis techniques. We refer to approaches that utilise
techniques to infer hidden knowledge as mining-based
semantic search.
3. CONCLUSION AND FUTURE WORK
Research of semantic search aims to expand the scope and
improve retrieval quality of conventional IR techniques. I have
investigated a number of existing systems, and classified them
into several categories in accordance with their methodologies,
scope, functionalities, as well as most distinctive features. The
main finding is: though varieties of systems have been
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
developed, a logical semantic search framework is not
formalized.
REFERENCES
[1] H Alani, K O’Hara and N Shadbolt, Ontocopi: Methods
and tools for identifying communities of practice.
Intelligent Information Processing 2002, Vol. 221, pp. 225–
236.
[2] B Aleman-Meza, C Halaschek-Wiener, I B Arpinar, C
Ramakrishnan and A P Sheth, Ranking complex
relationships on the semantic web. IEEE Internet
Computing, Vol. 9, No. 3, 2005, pp. 37–44.
[3] B Aleman-Meza, M Nagarajan, C Ramakrishnan, L Ding,
P Kolari, A P Sheth, I B Arpinar, A Joshi and T Finin,
46
Semantic analytics on social networks: experiences in
addressing the problem of conflict of interest detection..
WWW 2006, ACM, pp. 407–416.
[4] K Anyanwu, A Maduko and A P Sheth, Semrank: ranking
complex relationship search results on the semantic web.
WWW 2005, ACM, pp. 117–127.
[5] K Anyanwu and A P Sheth, _-Queries: Enabling Querying
for Semantic Associations on the Semantic Web. WWW
2003, pp. 690–699.
[6] D Artz and Y Gil, A survey of trust in computer science
and the semantic web.. J. Web Sem., Vol. 5, No. 2, 2007,
pp. 58–71.
[7] R A Baeza-Yates and B A Ribeiro-Neto, Modern
Information Retrieval, ACM Press / Addison-Wesley,
1999.
 A SOFT INTRODUCTION TO MACHINE LEARNING
Anurag Sharma
Student, MCA Department
sharmaanurag.236@gmail.com

Abstract– Machine Learning is an important area of Artificial
Intelligence. It involves automating the procurement of
information base required for functioning of expert systems. In
this paper we will be introduced to machine learning in its
softest form and will know about what it is, why its is so important
and what are its various applications in today’s scenario in the
ever going development of artificial intelligence.
INTRODUCTION
Machine Learning is the study of computational methods for
improving performance by mechanizing the acquisition of
knowledge from experience.[1] Evolved from the study of
pattern recognition and computational learning theory in
artificial intelligence, it has now evolved in a subfield of
computer science and an important sector to understand if
one wants to efficiently implement knowledge in a machine. A
machine can be made to learn to respond to a problem in two
ways, manually and automatically. To do it manually is to write
programs which teach the machine how to respond to a
particular situation but wouldn’t it be wonderful if the machine
can understand it by itself and act accordingly? That’s where
machine learning plays its part.
In this paper we will learn the algorithms to implement machine
learning, why it’s so important and what some of its real world
application are.
learning. Example algorithms include: the Apriori algorithm and
k-Means.
Semi-Supervised Learning
Input data is a mixture of labeled and unlabelled examples.
There is a desired prediction problem but the model must learn
the structures to organize the data as well as make predictions.
Example problems are classification and regression. Example
algorithms are extensions to other flexible methods that make
assumptions about how to model the unlabelled data.[2]
Reinforcement Learning
The learner is not told which actions to take, as in most forms
of machine learning, but instead must discover which actions
yield the most reward by trying them. In the most interesting
and challenging cases, actions may affect not only the
immediate reward but also the next situation and, through that,
all subsequent rewards. These two characteristics--trial-and-
error search and delayed reward--are the two most important
distinguishing features of reinforcement learning.[3]
ALGORITHMS OF MACHINE LEARNING

DIFFERENT STYLES OF MACHINE LEARNING

Supervised Learning
Input data is called training data and has a known label or
result such as spam/not-spam or a stock price at a time. A
model is prepared through a training process where it is required
to make predictions and is corrected when those predictions
are wrong. The training process continues until the model
achieves a desired level of accuracy on the training data.
Example problems are classification and regression. Example
algorithms include Logistic Regression and the Back
Propagation Neural Network.
Unsupervised Learning
Input data is not labelled and does not have a known result. A
model is prepared by deducing structures present in the input
data. This may be to extract general rules. It may through a
mathematical process to systematically reduce redundancy, or
it may be to organize data by similarity. Example problems are
clustering, dimensionality reduction and association rule
WHY IS MACHINE LEARNING SO IMPORTANT?
Things like growing volumes and varieties of available data,
computational processing that is cheaper and more powerful,
and affordable data storage have made machine learning
important in today’s scenario.
All of these things mean it's possible to quickly and
automatically produce models that can analyze bigger, more
complex data and deliver faster, more accurate results – even
on a very large scale. The result? High-value predictions that
can guide better decisions and smart actions in real time without
human intervention.

47
Journal of Computer Application, Volume 7, No. 1, January-June 2016
Ajay Kumar Garg Engineering College, Ghaziabad
One key to producing smart actions in real time is automated
model building. Analytics thought leader Thomas H. Davenport
wrote in The Wall Street Journal that with rapidly changing,
growing volumes of data, "... you need fast-moving modeling
streams to keep up." And you can do that with machine learning.
He says, "Humans can typically create one or two good models
a week; machine learning can create thousands of models a
week."
APPLICATIONS OF MACHINE LEARNING
Some real world applications of machine learning are:
z Face Recognition
z Anti virus
z Email Filtering
z Genetics
z Signal Denoising
z Weather Forecast
z Computer Vision
z Internet Fraud Detection
CONCLUSION
Machine learning is a type of artificial intelligence that provides
computers with the ability to learn without being explicitly
programmed. Machine learning focuses on the development
of computer programs that can teach themselves to grow and
change when exposed to new data. The process of machine
learning is similar to that of data mining. Both systems search
through data to look for patterns. However, instead of extracting
48
data for human comprehension -- as is the case in data mining
applications -- machine learning uses that data to improve the
program's own understanding. Machine learning programs
detect patterns in data and adjust program actions accordingly.
It was thus seen that machine learning not only plays an
important part in making a machine more intelligent without
human intervention but it’s also a very elaborate yet interesting
field of computer science. By the help of machine learning, not
only we can make a system which can predict its own actions,
we can make a system which is close to our own mind.
REFERENCES
[1] Pat Langley, “Applications of Machine Learning and Rule
Induction”, Stanford University, Stanford, California
(USA), March 30, 1995, pp. 1.
[2] Jason Brownlee, “A Tour of Machine Learning
Algorithms”, Machine Learning Mastery, November 25,
2013.
[3] Richard S. Sutton and Andrew G. Barto, “Reinforcement
Learning: An Introduction”, The MIT Press, Cambridge,
London (England).
Anurag Sharma is pursuing MCA from
Ajay Kumar Garg Engineering college
Ghaziabad, U.P(India). He has completed
his graduation from CCS university. His
hobbies are traveling and reading.