Escolar Documentos
Profissional Documentos
Cultura Documentos
Vol. 6, 2013
2013. All rights reserved. No part of this publication may be produced, stored
in retrieval system or transmitted in any form or by any means, electronic and
mechanical, photocopying or otherwise without the prior permission of the publishers.
The responsibility for information, opinions, and facts reported in these papers rests
exclusively with the authors.
PUBLISHED BY
40, GST Road, St. Thomas Mount, Chennai 600 016, Tamil Nadu, India.
PATRONS:
Dr. ANAND JACOB VERGHESE
Mr. ASHOK VERGHESE
EDITORIAL TEAM
Chief Editor: Dr. R. DEVANATHAN
Associate Editors: Ms. P. RANJANA & Ms. AL. VALLIKANNU
English Editor: Dr. C. INDIRA
PRINTED BY
REVIEW PROCEDURE
PANEL OF ADVISORS
PANEL OF REVIEWERS
APPLIED SCIENCES
Dr. C.Indira
Dr. K.Nithyanandam
Dr. S. SHANMUGAVEL
Dr. I.Sasirekha
BUILDING SCIENCES
Dr. V.Subbiah
Dr. R.Angeline Prabhavathy
Dr. A. ALPHONES
Dr. P. RAMESHAN
COMPUTING SCIENCES
Dr. E.R.Naganathan
Chancellor,
K.L. University, Vijayawada
Dr. S.Nagarajan
Ms. P.Ranjana
Emeritus Professor,
Electrical & Computer Engineering,
University of Canterbury, Chirstchurch,
New Zealand.
Ms. S.Vijayalakshmi
ELECTRICAL SCIENCES
Dr. R.Devanathan
Dr. M.J.S.Rangachar
MECHANICAL SCIENCES
Dr. A.K.Parvathy
Ms. Manjula Pramod
Honorary Professor,
Madras School of Economics, Chennai.
Dr D.Dinakaran
Dr. T.Jeyapovan
Dr. Hyacinth J. Kennady
Dr. A.Anitha
iii
Dr. R.DEVANATHAN
Chief Editor
iv
Contents
BUILDING SCIENCES
Shear Strengthening of RC Beam Using Carbon
Fiber Reinforced Polymer Sheet
15
Ar . Thulasi Gopal
21
D. Karthigeyan
COMPUTING SCIENCES
HMAC Filtering Scheme for Data Reporting in Wireless Sensor
Network26
E.Kodhai, P.Bharathi and D.Balathiripurasundari
36
42
C.T.Sree Vidhya
50
ELECTRICAL SCIENCES
Improving the Efficiency of Impulse Noise Estimation
55
61
67
MECHANICAL SCIENCES
Evaluation of Evaporative Heat Transfer Characteristics
of CO2/Propane Refrigerant Mixtures in a Smooth
Horizontal Tube using CFD
71
78
83
88
97
P Bhaskaran Nair
101
FORTHCOMING CONFERENCES
106
vi
I. Introduction
Carbon Fiber composites and reinforced polymer
offer unique advantages in many applications where
conventional materials cannot provide satisfactory
service life. Carbon fiberreinforced polymer (CFRP) is
a very strong and light fiber reinforced polymer which
contains carbon fiber. The polymer which is most often
used is epoxy, but other polymers such as polyester,
vinyl ester or nylon are sometimes used. The composite
may contain other fibers such as Kevlar, aluminum,
glass fibers as well as carbon fibers. The use of CFRP
is advantageous, because it is easier to maintain a
relatively uniform epoxy thickness throughout the
bonding length. By using CFRP wrap, the shear
strength and stiffness increase substantially reducing
shear cracking.
This paper provides the results of an experimental
investigation on using CFRP sheets to prevent local
cracks around shear region in reinforced concrete
beams.
20 mm
Grade of concrete:
M30
A. Properties of Nitowrap
Tables 2 to 4 show the properties of Nitowrap CF,
Nitrowrap 30(primer), and Nitrowrap 410 (Saturant)
respectively.
Table 2. Nitowrap CF
Fibre orientation
Unidirectional
Weight of fibre
200 g/m2
Density of fibre
1.80g/cc
Fibre thickness
0.30mm
1.5
Tensile strength
3500 N/mm2
Tensile modulus
Types
beam
of beam
Control
beam
Full side
wrap
Testing
of beam
(days)
Reinforcement in beam
Longitudinal
Stirrups
CB
FSW
SUWS
shear
wrap
2-10# @ top
28
Vertical
IWS
and 2-12# @
bottom
8mm #
stirrups @
160mm
C/C
stirrups
Inclined
wrap
Application
temperature
150C - 400C
Viscosity
Thixotropic
Density
Pot Life
2 hours at 300C
Cure time
5 days at 300C
1.14 g/cc
Pot life
25 min. @ 270C
Full cure
7 days
B. Surface preparation
Side U
wrap at
VWS
stirrups
V. Material Properties
The concrete used in the experimental program is M20
and steel with nominal yield strength of 415 N/mm2 is
used as the longitudinal reinforcement.
Si. No.
Specimen
First
Crack
Load (kN)
Ultimate
Load (kN)
Maximum
Deflection
(mm)
CB
33.5
123.9
32.6
FSW
51.8
158.8
14.3
SUWS
41.9
122.5
32.4
IWS
22.6
122.4
22.4
VWS
54
134.8
26.8
B. Failure Pattern
Fig. 7 shows the cracking pattern of a control beam.
The initial crack occurs at 33.5 kN and final crack at
123.9 kN. The ultimate load is 123.9 kN.
Fig. 4. Bar chart of final crack
C
ompared to all other specimens deflection of FSW
specimen is less and load bearing capacity is more.
However brittle failure occurs.
I n SUWS beam, the initial crack occurs at 41.9 kN
which is 25% higher than that of the control beam.
The ductility ratio is also higher in SUWS beam
which is desirable in earthquake prone areas.
References
[1] T
om Norris et al. (1997), Shear And Flexural
Strengthening Of RC Beams With Carbon Fiber
Sheets. Journal of Structural Engineering 123,
903-911.
[2] O
. Chaalla. et al. (1998), Shear Strengthening
Of RC Beams by Externally Bonded Side CFRP
Strips. Journal of Composites for Construction,
2, 111-113.
[3] A
lex Li, et al. (2001), Shear Strengthening Of RC
Beams With Externally Bonded CFRP Sheets.
Journal of Structural Engineering,127, 374-380.
[4] G
. Spadea et al. (2001), Strength And Ductility
Of RC Beams Repaired With Bonded CFRP
Laminates, Journal of Bridge Engineering, 6,
349-355.
[5] C
arlo Pellegrino et al. (2002), Fiber Reinforced
Polymer Shear Strengthening of Reinforced
Concrete Beams with Transverse Steel
Reinforcement. Journal of Composites for
Construction, 6, 104-111.
VII. Conclusion
Tests were performed in externally applied epoxybonded CFRP. Based on the test results the following
conclusions are drawn.
[6] M
. Tavakkolizadeh, et al.(2003), Strengthening of
Steel-Concrete Composite Girders Using Carbon
Fiber Reinforced Polymers Sheets. Journal of
Structural Engineering, 129, 30-40.
[7] G
yamera Kesse et al., (2007), Experimental
Behavior of Reinforced Concrete Beams
Strengthened with Prestressed CFRP Shear
Straps. Journal of Composites for Construction,
11, 375-383.
I. Introduction
Research gathered over recent years has highlighted
the countless benefits to people, wildlife and the
environment that come from planting trees and creating
new woodland habitat. It is obvious trees are good
things, says Clive Anderson.
R.V. Nagarajan and Ravi K. Bhargava are in School
of Architecture, Hindustan University, Chennai, India,
(e-mail: rvnagarajan@hindustanuniv.ac.in)
V. Interior Plants
When plants were added to the interior space, the
participants were more productive (12% quicker
reaction time on the computer task) and less stressed
(systolic blood pressure readings lowered by one to
four units). Immediately after completing the task,
participants in the room with plants present reported
feeling more attentive (an increase of 0.5 on a selfreported scale from one to five) than people in the room
with no plants [14].
Regardless of the physical air quality benefits, people
generally have an affinity to being around plants. Many
studies have proven a link to plants and their beneficial
psychological effects on people, including increases in
productivity and decreases in stress levels [15].
for
carbon
6. C
hrysanthemum morifolium (Excellent
trichloroethylene, good for benzene
formaldehyde)
for
and
7. D
endrobium Orchid (Excellent for acetone,
ammonia, chloroform, ethyl acetate, methyl
alcohol, formaldehyde and xylene)
8. Dieffenbachia maculate (Good for formaldehyde)
9. D
racaena deremensis (Excellent for benzene and
trichloroethylene, good for formaldehyde)
10. Dracaena marginata (Excellent for benzene, good
for formaldehyde and trichloroethylene)
11. Dracaena
Massangeana
formaldehyde)
(Excellent
Fig. 1. Occupation
for
Fig. 2. Age
(b)
Fig. 3. Time
(c)
Fig. 4. Gender
(d)
(e)
Fig. 6. Sub categories of fig. 5.
(a)
3. A
s most of the previous researches proved, 45%
of the people surveyed preferred flowering plants
in their vicinity and they expressed that they felt
relaxed compared to the people who were not
having flowering plants in their rooms.
4. E
qually, 40% of people preferred earth walkway
and also lawn in the open space of the premises.
5. 6 5% of people complained that the process of
shedding leaves of trees is irritable than the
problems of insects over it (32% complained of
insects).
6. A
mong the people surveyed, 75% of patients, 65%
of non - patients and 78% of staff members of
hospital prefer to rest under the tree during midday.
7. A
ge wise, 82% of above 55 age people preferred
noiseless area than the active / noisy area.
8. A
lmost 95% of the women prefer to rest inside the
building than resting under trees, street-benches or
anywhere in open spaces.
9. A
lmost 88% of the men patients whose rooms were
not having plants felt boredom and wanted to move
around, when the same feeling was felt by only
15% of the men patients whose rooms had plants.
10. Almost 90%of all age group men and women who
are patients prefer to have a walk in either in the
morning or in the evening in the road which has
trees, than the road which does not have them.
XI. Conclusion
[10] S
ynnveCaspari, (2006), The aesthetic
dimension in hospitals - an investigation into
strategic plans, International Journal of Nursing
Studies 43 pp.851859.
References
[11] U
lrich, R., (1991), Effects of interior design on
wellness. Theory on recent scientific research,
Journal of Health Care and Interior Design, 3.
[1] U
lrich, R. S. and R. Parsons (1992), Influences
of passive experiences with plants on individual
well-being and health. In D. Relf (Ed.), The
role of horticulture in humanwell-being and
social development, Portland, Timber Press, pp.
93-105.
[2] D
ejanaNeduin,
Milena
Krklje,
NaaKurtovi-Foli, Hospital Outdoor
Spaces - Therapeutic Benefits And Design
[12] G
reen Guide for Health Care, Version 2.2, SS
Credit 5.1., Site Development: Protect or Restore
Open Space or Habitat, 2007, www.gghc.com,
p.6 23.
[13] Ulrich,
R.S., Cooper-Marcus, C., Barnes, M.
(Eds.), (1999), Effects of Gardens on Health
Outcomes: Theory and Research, in Healing
Gardens: Therapeutic Benefits and Design
I.
Introduction
II. Constraints
The Silk and other textile industries are still community
driven i.e. a particular community is confined to these
industries. The idea of the Silk parks with appropriate
infrastructure is to create awareness among a lot of
others to take up this profession. This in turn keeps
the industry in the head front of Indian economic
development and increases the demand for Indian
textiles in International markets.
III. Objectives
The objectives of the project are
To design a prime handloom hub
T
o re-establish the traditional and cultural value of
ancient silk weaving which is the prime occupation
of the temple city and its surrounding villages and
village hamlets of Kanchipuram.
T
o encourage the occupation, by providing the
workers with better functioning environment and
resources that would take the economy of the rural
sector to a superior stature.
T
o bring back the lost platform for the weavers
to market their products, avoid duplicate market
players and also to showcase the culture.
IV. Methodology
The methodology proposed to be adopted are
Understanding the site surroundings and services.
Understanding the occupation and workplace.
Weavers needs/opinions through questionnaires.
Comparison of history against recent happenings.
T
echniques in the field to choose the best for
todays scenario.
Requirement framing in detail.
C
ase study- comparative study of Ayangarkulam
(weaving village and Pillayarpalayam weaving
town).Analysis of the common and the contrasting
features and characteristics.
Formulating conceptual ideas.
D
evelopment of concepts into schemes and into
final design output.
V.
VIII. CONCLUSION
Combination of traditional and contemporary
architecture is done which targets site planning level to
weaving machine design customized for the weavers.
Macro level to micro level planning is undertaken.
Material from site is used for construction which can
involve local dwellers who can be benefited apart from
the main target - the weavers. Dyeing areas which were
earlier inside the Kanchipuram towns causing pollution,
will be shifted here where the CETP is set up to solve the
issue of pollution. Considering the hot humid climate,
features like courtyard have been adopted to give a
natural day lighting and stack effect thus maintaining
a suitable indoor environment. Better workspace is
created which will result in better productivity. Efficient
usage of energy, water, and other resources is seen.
Measures are taken to protect occupants health and
improve employee productivity. Maximum reduction
in waste, pollution and environmental degradation is
seen into. CSEB blocks, which are green materials are
extensively used in the construction.
BIBILIOGRAPHY
http://www.silkclick.com
http://www.csapl.co.in/industrial.asp
http://www.thehindu.com/todays-paper/tp-national/
tp-tamilnadu/site-identified-for-silk-park-inkancheepuram/article168017.ece
http://www.kanchipuramdistrict.com/
http://smehorizon.sulekha.com/advancementmade-panipat-weaving-industry-sustain_textilesviewsitem_8253
http://www.oldandsold.com/articles04/textiles16.shtml
http://environmental_impact_assessment
I. Introduction
High-speed railis a type ofrail transportthat operates
significantly faster than traditional rail traffic, using
an integrated system of specialized rolling stock and
dedicated tracks. The first such system began operation
in Japan in 1964 and was widely known as the bullet
train. Even though India has one of the worlds largest
railway networks, it is yet to find itself a place in the
D. Karthigeyan is in School of Architecture, Hindustan
University, Chennai, India, (e-mail: dkarthikeyan@
hindustanuniv.ac.in)
A
pricing structure adapted to the needs of
customers,
In India, high speed trains are often referred to as bullettrains. One of the first proposals by the Government of
India to introduce high-speed trains was mooted in the
mid-1980s by then Railway Minister. A high speed rail
line between Delhi and Kanpur via Agra was proposed.
An internal study found the proposal unviable at that
time due to the high cost of construction and inability of
travelling passengers to bear much higher fares than what
was changed for normal trains. The Railways instead
introduced Shatabdi trains which ran at 130 km/h.
The Indian Ministry of Railways in its whitepaper Vision 2020 submitted to the Parliament on
December 2009 envisages the implementation of
regional high-speed rail projects to provide services at
250-350km/h, and planning for corridors connecting
commercial, tourist and pilgrimage hubs. Six corridors
have already been identified and feasibility studies
have been started,
1. Delhi-Chandigarh-Amritsar,
2. Pune-Mumbai-Ahmadabad,
3. Hyderabad-Dornakal-Vijayawada-Chennai,
4. Howrah-Haldia,
5. Chennai-Bangalore-Coimbatore-Ernakulam,
6. Delhi-Agra-Lucknow-Varanasi-Patna.
These high-speed rail corridors will be built as
elevated corridors in keeping with the pattern of
habitation and the constraint of land.
Two new routes were later proposed by Indian
Railways, namely
A
hmadabad - Dwarka, via Rajkot, Jamnagar and
the other from RajkottoVeravalviaJunagadh [4]
A. Approach to High-Speed
Indian Railways approach to high-speed is on
incremental improvement on the existing conventional
lines for up to 200km/h, with a forward vision of speed
above 250 km/h on new tracks with state-of-the-art
technology.
D. Project Execution
The cost of building high speed rail tracks is about Rs
70 crore/km (U$15.6m/km), compared with Rs 6 crore/
km of normal rail tracks.
VI.Conclusion
Once the Indian government decides, it should not take
more than 4-5 years to have high-speed trains running
References
[1] M
undrey, Tracking for High speed trains in
India, January, 2010, RITES Journal.
[2] h ttp://zeenews.india.com/news/world/china-shigh-speed-bullet-train-network-exceed-10-000km_879426.html
[3]
h ttp://www.globalresearch.ca/eurasian-economicboom-and-geopolitics-china-s-land-bridge-toeurope-the-china-turkey-high-speed-railway
[4] h ttp://www.mapsofindia.com/railways/highspeed-rail-corridors.html
[5] h ttp://www.ibtimes.com/next-stop-bangalorejapan-may-help-south-india-build-high-speedrail-system-1408542
[6]
h ttp://www.indianexpress.com/news/india-japanto-study-highspeed-rail-feasibility/1134280/
I. Introduction
Sensor networks are dense wireless networks which
are small in size, very low-cost and which collect and
disseminate environmental data. Wireless Sensor
Networks (WSNs) facilitates monitoring and controlling
of physical environments from remote locations with
better accuracy. They have applications in a various
fields such as environmental usage, military requirement
and gathering sensing information in inhospitable places.
Sensor nodes have various energy and calculating
constraints because of their inexpensive nature and ad
hoc method of deployment.
The number of nodes in a WSN is usually much
larger than that in an ad hoc network. Sensor nodes
are more resource constrained in terms of power,
computational capabilities, and memory. Sensor nodes
are typically randomly and densely deployed (e. g., by
aerial scattering) within the target sensing area. The postdeployment topology is not predetermined. Although in
many cases the nodes are static in nature, the shape and
size might change frequently because the sensor nodes
and the wireless channels are prone to failure.
A. Introduction
IV. Design
B. Problem Formulation
The vast targeted terrain where the sensor nodes are
deployed is divided into multiple cells after network
deployment. We assume that sensor nodes within a cell
form a cluster which contains n nodes. In each cluster
of a cell a node is randomly selected as a cluster head
as in figure 2. When an event of interest happens in any
of these cells, the sensing nodes of that particular cell
detects the event and broadcasts it to the cluster head.
The cluster head aggregates the reports and forwards
the aggregated report through the report authentication
area down to the sink. The topologies of WSNs change
frequently either because nodes are prone to failure or
because they need to switch their states between Active
and Sleeping for saving energy. As sensor networks
are not tamper-resistant, it can be compromised
by adversaries. Each cluster may contain some
compromised nodes, which may in turn collaborate
with each other to generate false reports by sharing the
secret key information. In this project work we intend
to provide solutions for attacks like bogus data injection
and denial of services (selective forwarding attack &
report disruption) that can be launched by adversaries
to degrade nodes life time and the critical information
carried by them.
We consider
N- Total no. of nodes present in the targeted terrain
n- Average no. of nodes in each cell
D. Algorithm
2. T
o verify the authenticity of the authentication
keys in K (t), j checks if each authentication
key it stored can be generated by hashing a
corresponding key in K (t) in a certain number of
times. If not, it is either replayed or forged and K
(t) should be dropped.
V. Verification Process
1. T
o verify the validity of K (t), j checks if K (t) is
in correct format and contains t distinct indexes of
z- keys (secret keys picked randomly from global
key pool Z). If not, it drops K (t).
3. T
o verify the integrity and validity of reports R1,
R2 j checks the MACs in these reports using
the disclosed authentication key that it decrypts
from K (t).
STEP 5: If the reports are valid, j sends an OK
message to j +1. Otherwise it informs j +1
to drop invalid reports.
STEP 6: Similar to step 2, j +1 forwards the reports
to next hop.
STEP 7: Similar to step 3, after overhearing the
broadcast from j +1, j discloses K (t) to j
+1.
STEP 8: Every forwarding node repeats step 4 to step
7 until the reports are dropped or delivered to
the base station.
B. Simulation Tool
3. C
onfiguration of Phenomenon nodes pulse rate
and phenomenon type.
4. Configuration of Sensor nodes.
5. Attaching sensor agents.
6. A
ttaching UDP agent and sensor application to
each node.
1. C
onfiguration of Phenomenon channel and Data
channel.
2. C
onfiguration of Phenomenon nodes with the
PHENOM routing protocol.
Simulation Environment
The proposed secure scheme of Dynamic enroute
filtering is implemented in NS-2.27 simulator. The
simulation consists of 24 sensor nodes out of which
4 nodes in green color are cluster heads; some nodes
are configured to be attackers and a base station. The
network is randomly deployed in a terrain dimension
of 600m X 600m with the following simulation
environment shown in Table 1.
Table 1. Simulation Environment
PARAMETER
Channel
Propagation
VALUE
Channel/Wireless
channel
Radio Propagation
Ray Ground
Model
Phy/WirelessPhy
MAC
Mac/802_11
Interface Queue
Queue/Drop Tail
Link Layer
LL
Interface Queue
Size
Channel Type
Propagation/Two
Network Interface
Antenna
DESCRIPTION
Antenna/Omni
Antenna
5000(in packets)
Network Interface
Type
Medium Access
Control Type
Interface Queue
Type
Link Layer
Antenna Model
Maximum packet
in interface Queue
Routing Protocol
AODV
Routing Protocol
Data Rate
11Mbps
Interface Queue
Size
50
Terrain Dimension
600m X 600m
Simulation Time
100 Seconds
Packet Size
1026Bytes
Number of Nodes
25
Reception- rx
Energy Model
Power 0. 3(J/bits)
Transmission- tx
Power 0. 5(J/bits)
Maximum packets
in Interface Queue.
Terrain Dimension
of the network
Total duration of
the simulation
Size of the CBR
traffic packet
Number of nodes
in the Scenario
Power
Consumption
Model
VII.Conclusion
A major challenge for a Wireless Sensor Network lies
in the energy constraint at each node, which poses
a fundamental limit on the network life time. Even
though there are many enroute filtering schemes
available in the literature they either fail to support the
dynamic nature of the sensor networks or they cannot
efficiently mitigate the adversarys activities. Hence
this enroute filtering scheme is currently an area of
much research among the security professionals.
Generally AODV performs better than many other ondemand protocols under high mobility, large network
scenarios. When the size of the network is large and
highly mobile the frequency of the link failure is
also high. Due to this, latency and control load of the
network is also increased. Also due to the attackers
References
[1] Y
un Zhou, Yuguang Fang, and Yanchao Zhang,
Securing wireless sensor networks: a survey,
IEEE Communications Surveys & Tutorials, Vol.
10, No. 3, pp. 6-28, 2008.
[2] A
l-Sakib Khan, Pathan,Hyung-Woo Lee, and
Choong Seon Hong, Security in Wireless Sensor
Networks: Issues and Challenges, International
Conference
on
Advanced
Computing
Technologies, Vol. 4, No. 1, pp. 1043-1045,
2006.
[3] Z
oron S. Bojkovic, Bojan M. Bakmaz, Miodrag,
and R. Bakmaz, Security Issues in Wireless
Sensor Networks, International journal of
Communications, Vol. 2, no. 1, pp. 106-114,
2008.
[4] K
arlof and D. Wagner, Secure Routing
in Wireless Sensor Networks: Attacks and
Countermeasures, Proceedings of First IEEE
International Workshop of Sensor Network
Protocols and Applications, Vol. 1, pp. 113-127
2003.
[5] H
. Fang, F. Ye, Y. Yuan, s. Lu, and W. Arbaugh,
Toward resilient security in wireless sensor
[17] A
drian Perrig, Robert Szewczyk, Victor Wen,
David Culler, and J. D. Tygar SPINS: Security
Protocols for Sensor Networks, Proceedings of
Mobicom 2001, Vol 8, No. 5, pp. 521-534, 2002.
[16] N
or Surayati Mohamad Usop, Azizol Abdullah,
and Ahmad Faisal Amri Abidin Performance
Evaluation of AODV, DSDV & DSR Routing
Protocol in Grid Environment International
Journal of Computer Science and Network
Security, Vol. 9 No. 7, pp 261-268, 2009.
[18] G
owrishankar. S, SubirKumarSarkar T. G.
Basavaraju Scenario Based Simulation Study of
Adhoc Routing Protocols Behavior in Wireless
Sensor Networks, International Conference on
Future Computer and Communication, Vol. 5,
No. 4, pp 527-532, 2009.
I. Introduction
With the current medical procedures and the healthy
lifestyles of many, the average lifetime expectancy is
ever increasing. Technical advances incorporated with
wide and accurate knowledge of the human anatomy
have allowed healthcare professionals the ability to
handle almost any scenario that they encounter in
individuals at hospitals and emergency treatment
G. Thiyagarajan is Assistant professor, Dept of
Computer Science, P.B College of Engineering, Chennai,
Tamilnadu, India, (e-mail: sivashankaripitam@gmail.
com).
C.M. Rasika, B. Sivasankari and S. Sophana
Jennifer are PG students, Dept of Computer Science
and Engineering, P.B college of Engineering, Chennai,
Tamilnadu, India.
II. Background
Collective Anomalies: If the collection of related data
instances is anomalous with respect to the entire data set,
then it is termed a collective anomaly. The single data
instances in a collective anomaly may not be anomalies
by themselves, but their existences together as a group is
1. T
he pattern between the different layers of neurons
is interconnected
2. T
he learning process used to update the weights of
the interconnections
3. T
he activation function which converts a neurons
weighted input to its output activation.
A. Internal Evaluation
When a clustering result is evaluated based on the data
that was clustered itself, this is called internal evaluation.
These methods usually assign the best score to the
algorithm that produces clusters with a high similarity
within a cluster and a low similarity between clusters.
One drawback of using internal criteria in cluster
evaluation is that high scores on an internal measure do
not necessarily result in effective information retrieval
applications. Additionally, this evaluation is biased
towards algorithms that use the same cluster model. For
example k-means clustering naturally optimizes object
distances, and a distance-based internal criterion will
likely overrate the resulting clustering.
Therefore, the internal evaluation measures are
best suited to get some insight into situations where
one algorithm performs better than another, but this
shall not imply that one algorithm produces more valid
results than another. Validity as measured by such an
index depends on the claim that this kind of structure
exists in the data set. An algorithm designed for certain
kinds of models will not perform well if the data set
contains a radically different set of models, or if the
evaluation measures a radically different criterion.
For example, k-means clustering can only find convex
clusters, and many evaluation indexes assume convex
clusters. On a data set with non-convex clusters neither
the use of k-means, nor of an evaluation criterion that
assumes convexity, is sound. The following methods
can be used to assess the quality of clustering algorithms
based on internal criterion:
B. DaviesBouldin Index
The DaviesBouldin index can be calculated by the
following formula:
i + j
1 n
max
j
n i =1
d (ci , c j )
d (i, j )
D = min min
1 i n 1 j n , i j max
1 k n d ( k )
TP + TN
TP + FP + FN + TN
P=
TP
TP + FP
R=
TP
TP + FN
( + 1) P R
2 P + R
C. Clustering Axioms
A B
TP
=
A B TP + FP + FN
TP
TP
TP + FP TP + FN
V. Conclusion
In this paper, we proposed a collective anomaly and autoassociative Neural Network to detect anomalies in patient
healthcare .The proposed approach achieves both spatial
and temporal analysis for anomaly detection. We have
[8] A
. S. Raghuvanshi, R. Tripathi, and S. Tiwari
(2011), Machine Learning Approach for
Anomaly Detection in Wireless Sensor Data,
International Journal of Advances in Engineering
& Technology, vol. 1, no. 4, pp.4761.
References
[9] P
oonam Dabas and Rashmi Chaudhary, Survey
of Network Intrusion Detection Using K-Mean
Algorithm.
[1] O
sman Salem, Alexey Guerassimov and Ahmed
Mehaoua (2013), Sensor Fault and Patient
Anomaly Detection and Classification in Medical
Wireless Sensor Networks, in University of
Paris Descartes LIPADE Division of ITCE,
POSTECH, Korea.
[2] M
argarita Sordo (2002), Introduction to Neural
Networks in HealthCare, in Open clinical
knowledge for Medical care.
[3] K
enneth L. Ingham, Anil Somayaji (2009), A
Methodology for Designing Accurate Anomaly
Detection Systems.
[4] V
arun Chandola, Arindam Banerjee, and Vipin
Kumar (2009), Anomaly Detection: A Survey,
University of Minnesota.
[5] S
aman A. Zonouz, Himanshu Khurana, William
H. Sanders, and Timothy M. Yardley (2013),
RRE: A Game-Theoretic Intrusion Response
and Recovery Engine.
[10] S
ushil Kumar Chaturvedi, Prof. Vineet Richariya,
Prof. Nirupama Tiwari, Anomaly Detection in
Network using Data mining Techniques
[11] M
ooi Choo Chuah, ECG Anomaly Detection
via Time Series Analysis, in Lehigh University.
[12] A
. J. Barsky, E. J. Orav, and D.W. Bates (2006),
Distinctive patterns of medical care utilization in
patients who somatize, Med Care., 44(9):803811.
[13] L
. Breiman, J. Friedman, R. Olshen, and C. Stone
(1984), Classification and Regression Trees,
CRC Press, Boca Raton.
[14] L
eo Breiman (2001), Random forests, Machine
Learning, 45(1):532.
[6] A
nimesh Patcha and Jung-Min Park, An
Overview of Anomaly Detection Techniques:
Existing Solutions and Latest Technological
Trends
[15] H
. V. D. Bussche, G. Schon, T. Kolondo, H.
Hansen, K.Wagscheider, G. Glaeske, and D.
Koller (2011), Patterns of ambolatory smedical
care utilization in elderly patients with special
reference to chronic diseases and multimorbidityresults from a clams data based observational
study in germanuy, BMC Geriatrics, 11(1).
[16] V
. Chandola, A. Banerjee, and V. Kumar (2007),
Anomaly detection: A survey, Technical Report
TR 07-017, Dept. of Computer Engineering,
Univ. Minnesota.
I. Introduction
A. Text Mining
Text mining or knowledge discovery from text (KDT)
for the first time mentioned in Feldman et al.[1]
deals with the machine supported analysis of text. It
uses techniques from information retrieval, information
extraction as well as natural language processing (NLP)
and connects them with the algorithms and methods
of KDD, data mining, machine learning and statistics
[7]. Thus, one selects a similar procedure as with the
KDD process, whereby not data in general, but text
documents are in focus of the analysis.
Text mining essentially corresponds to information
extraction the extraction of facts from texts. Text
mining can be also defined similar to data mining as
the application of algorithms and methods from the
fields of machine learning and statistics to texts with
the goal of finding useful patterns. For this purpose, it
is necessary to pre-process the texts accordingly. Many
authors use information extraction methods, natural
language processing or some simple pre-processing
steps in order to extract data from texts. To the extracted
data, data mining algorithms can then be applied.
B. Cluster Analysis
Cluster analysis is a technique for breaking data down into
related components in such a way that patterns and order
becomes visible. It aims at sifting through large volume of
data in order to reveal useful information in the form of new
relationships, patterns, or clusters, for decision making by a
user. Clusters are natural groupings of data items based on
similarity metrics or probability density models. Clustering
algorithms map a new data item into one of several
known clusters. In fact, cluster analysis has the virtue of
strengthening the exposure of patterns and behaviour as
(1)
Here,
is he fuzzy membership value for the element
s is the fuzzy set
x is the value from the underlying domain.
Fuzzy sets provide a means of defining a
series of overlapping concepts for a model variable
through degrees of membership. The values from the
complete universe of discourse for a variable can have
memberships in more than one fuzzy set.
B. Fuzzy Clustering
The central idea in fuzzy clustering is the non-unique
partitioning of the data in a collection of clusters. The
where
(2)
i j ( xi ) mx
i j ( xi ) m
Cj is the centre of the j-th cluster
(3)
( xi ) = 1
j =1 j
(4)
max (d j ) d ji
max (d j )
(5)
where
j ( xi ) is the membership of the xi in the jth cluster
V. Proposed Method
The proposed method incorporates the idea of using a
simple expression (5) to detect outliers.
(cluster centers)
Sum=0
Count=0
For i=1 to n :
If (xi) is maximum in Ck then
If (xi)>=
Sum=Sum+xi
count=count + 1
Ck=Sum/count
2.Determine small clusters and consider the points
that belong to these clusters as outliers.
3.For the rest of the points,
For each point i
DO
remove a point, pi,
re-calculate the objective function applying (5)
If (xi)>= : then classify point pi as an outlier and
return
it back to the set;
End DO
End
VI. Methodology
An expert system which employs fuzzy c Means for the
diagnosis of diabetes is developed in an environment
characterized by Microsoft Window XP professional
Operating System and the idea is implemented and
executed using Weka Data Mining tool.
An approach for analyzing clusters to identify
meaningful pattern for determining whether a
patient suffers from diabetes or not is presented. The
system provides a guide for diagnosis of diabetes
within a decision making framework. The process
for the medical diagnosis of diabetes starts when an
SYMPTOMS
Number of Instances: 75
Number of Attributes: 11
The different form of symptoms of diabetes constitutes
the parameters of the knowledge base. The fuzzy set of
parameters represented by P which is defined as {P1,P2 ... Pn}
Often Thirst
Excessive Hunger
Frequent Urination
Blurred Vision
Heart
Numbness
Vision
Kidney
Nerves
Gums or Teeth
10
Age
A. Diabetes Datasets
The database used for this work is Diabetes Database.
The data sets are obtained from one of the Diabetes
Health care organization in Chennai called SS Diabetes
Diagnostic Centre.
In this section, we examine performance of proposed
algorithm and compare it with FCM algorithm on the
Final Cluster
Centers
Outlier Membership
C1 - 2.79 , 47.65
.37
C2 - 3.29 , 204.4
.63
New
C1 - 1.52,166.20
Method
C2 - 5.49,172.11
C Means
CLUSTERED INSTANCES
Heart
17(23%)
Vision
26(35%)
Kidney
14(19%)
Nerves
15(20%)
3(4%)
VIII. Conclusion
A good clustering algorithm produces high quality
clusters to yield low inter cluster similarity and high
intra cluster similarity. Many conventional clustering
algorithms like k-means and fuzzy c-means algorithm
achieve this on crisp and highly structured data. But
they have difficulties in handling unstructured data
which often contain outlier data points. The proposed
new fuzzy clustering algorithm combines the positive
aspects of both crisp and fuzzy clustering algorithms. It
is more efficient in handling the natural data with outlier
points than both k-means and fuzzy c-means algorithm.
It achieves this by assigning very low membership
values to the outlier points. But the algorithm has
limitations in exploring highly structured crisp data
which is free from outlier points. The efficiency of the
algorithm has to be further tested on a comparatively
larger data set.
References
[1] A
hmed, S. R. (2004), Applications of data mining
in retail business, Information Technology:
Coding and Computing, 2, 455459.
[2] C
arrier, C. G., & Povel, O. (2003), Characterising
data mining software, Intelligent Data Analysis,
7, 181192.
[3] K
racklauer, A. H., Mills, D. Q., & Seifert,
D. (2004), Customer management as the
origin of collaborative customer relationship
management,
Collaborative
Customer
Relationship Management - taking CRM to the
next level, 36.
[4] M
itra, S., Pal, S. K., & Mitra, P. (2002), Data
mining in soft computing framework: A survey,
IEEE Transactions on Neural Networks, 13,
314.
[5] P
arvatiyar, A., & Sheth, J. N. (2001), Customer
relationship management: Emerging practice,
process, and discipline, Journal of Economic &
Social Research, 3, 134.
[6] M
.-S. Chen, J. Han, and P. S. Yu (1996),
Data mining: an overview from a database
perspective, IEEE Transaction on Knowledge
and Data Engineering.
[7] T
. Hastie, R. Tibshirani, and J. Friedman (2001),
The Elements of Statistical Learning, Springer.
[8] R
. Maitra (2002), A statistical perspective on
data mining, J. Ind. Soc. Prob. Statist.
[9] M
. B. and D. J. Hand (eds.) (1999), Intelligent
data analysis, Springer-Verlag New York, Inc.
[10] U
. M. Fayyad, G. Piatetsky-Shapiro, and P. Smyth
(1996), Knowledge discovery and data mining:
Towards a unifying framework, Knowledge
Discovery and Data Mining, pages 8288.
[11] R
ichard, L.S., and Ronald M.E. (2008), Lessons
from Theory & Research on Clinician-Patient
Communication, Karen G., Barbara K.R, K.
Viswanth (eds.) Health Behavior and Health
Education; Theory, Research, and Practice 4th
edition, (11) p 236-269.
[12] P
avel Berkhin, Survey of Clustering Data
Mining Techniques.
[13] U
. Fayyad and R. Uthurusamy (1996), Data
mining and knowledge discovery in databases,
Commn. ACM, vol. 39, pp. 2427.
[14] E
. Cox (2005), Fuzzy Modeling And Genetic
Algorithms For Data Mining And Exploration,
Elsevier.
[15] M
aria Halkidi, Quality assessment and
Uncertainty Handling in Data Mining Process.
[16] R
. Cruse, C. Borgelt, Fuzzy Data Analysis
Challenges and Perspective
[22] A
lmeida, J., L. Barbosa, A. Pais and S. Formosinho,
(2007), Improving Hierarchical Cluster
Analysis: A New Method with Outlier Detection
and Automatic Clustering, Chemometrics and
Intelligent Laboratory Systems 87: 208217.
[23] Y
oon, K., O. Kwon and D. Bae, (2007), An
approach to Outlier Detection of Software
Measurement Data using the K-means Clustering
Method, First International Symposium
on Empirical Software Engineering and
Measurement (ESEM 2007), Madrid.
[24] I mianvan A.A. and Obi J.C. (2011), Fuzzy
Cluster Means Expert System for the Diagnosis
of Tuberculosis, Vol 11 Issue Version 1.0 April,
Global Journals Inc. (USA).
[25] T
homas Binu, Raju, (2009), A Novel Fuzzy
Clustering Method for Outlier Detection in Data
Mining, International Journal of Recent Trends
in Engineering, Vol. 1, No. 2.
I. Introduction
As generations of Web applications and technologies
arise, different types of web service providers arise
in relation to these new technologies. To allow these
applications or services to perform in a heterogeneous
operating system, numerous Web services specifications
were developed. These stipulations include WSDL,
XML, SOAP, and the UDDI data argument standard
linking to Web services, the one that finds Web services
based on ones desires. The extra web services are
obtainable, but it is more difficult to find the most suitable
service for an unambiguous solicitation. Although Web
services deliver a universal data conversation platform
and offer methods that characterize the service recovery
interfaces, a service supplicant may not be able to find
appropriate Web services basically by consuming
search keywords. Even if a service is created that
caters to the functional necessities, it is indistinct if the
quality routine of that service can satisfy the requesters
needs. Though the existing UDDI structure does not yet
deliberate the quality of service (QoS) when searching
for services, there is a need to consider the QoS [1].
Though previous studies have largely focused on the
quality of a single provision, much work has previously
been done in the field of Web services. But, real-world
requests frequently need to incorporate facilities into
a workflow [2]. This study seeks to control a path for
service activists to find the service arrangement that
delivers the expected QoS. Once a service is collected
comprising of several sub-tasks, each sub-task will
disturb the general tendency of the overall service.
Though many models have been devised for Web
service selection, making a composite Web service not
only correct and reliable but also with an optimal QoS
remains a significant challenge.
Text
Ontology-based
Semancs
Semancs
Keyword
Tree
Semancs
WSMO
String
Graph
Semancs
OWL-S
IR model
Signature
Semancs
WSDL-S
B. Genetic algorithm
Service
Requester
Request
QoS
Service Provider
GA
XML
Web Service
QoS Monitoring
No
IV. Conclusion
Service
Sasfacon
V. Future Work
The proposed evaluation model has shown that the
performance of the new genetic algorithm may not
be as stable as that of the testing of the web service
and that it considers only the front end of the system.
Future work will focus on improving the performance
of new genetic algorithm with database connectivity
and testing functionalities.
References
[1] B
Benatallah, LZ Zeng, QoS-Aware Middleware
for Web Services Composition, IEEE
Transactions on Software Engineering, 30(5),
2004, pp- 311-327.
[2] W
Gaaloul, S Bhiri, and M Rouached, (2010)
Event-Based Design and Run time Verification
Composite Service Transactional Behavior,
IEEE - Transactions on Services Computing, vol.
3, pp. 32-45.
[3] L
Aversano, MD Penta, and K Taneja- A genetic
programming approach to support the design of
service compositions, International Journal of
Computer Systems Science & Engineering, vol.
21, pp:247- 254, 2006.
[4] E
Silva, PL Ferreira, and M van Sinderen,
Supporting Dynamic Service Composition at
Runtime based on End-user Requirements, Proc.
of 1st International Workshop on User-Generated
Services Stockholm, Sweden-2009.
[5] F
Lcu, A Lger (2006) A formal model for Web
service composition, Proc. of 13th International
Conference on Concurrent Engineering, pp. 3746.
[6] K
Fujii, T Suda (2009) Semantics-based
context-aware dynamic service composition,ACM Transactions on Autonomous and Adaptive
Systems,-2009 vol. 4, pp. 1-31.
[7] K
Fujii and T Suda (2006) Semantics-based
dynamic Web Service composition, International
Journal of Cooperative Information Systems, pp.
293-324
[8] S
Lajmi, C Ghedira, and K Ghedira (2009)CBR
Method for Web Service Composition, Advanced
Internet Based Systems and Applications.
vol. 4879, E. Damiani Eds.: Springer Berlin/
Heidelberg, pp-314-326.
[9] J unli Wang, Zhijun Ding, Changjun Jiang
(2006)GAOM: Genetic Algorithm based
Ontology Matching, Proc. of the IEEE Asia
Pacific Conference on Services Computing, pp617-620.
[10] F
uyong Yuan, Jian Liu, Chunxia Yin, Yulian
Zhang (2008) A Novel Methodology for Web
Services Discovery in Gnutella like Networks,
IEEE-Third International Conference on Signal
Image Technologies and Internet Based System,
pp-231-238.
[11] E
yhab Al-Masri and Qusay H. Mahmoud, (2007)
WSCE: A Crawler Engine for Large-Scale
Discovery of Web Services, IEEE International
Conference on Web Services, pp- 1104-1111.
[12] U
ddam Chukmol, Acha-Nabila Benharkat,
Youssef Amghar, (2008) Enhancing Web Service
Discovery by using Collaborative Tagging
System, IEEE 4th International Conference on
Next Generation Web Services Practices, pp.5459.
[13] C
olin Atkinson, Philipp Bostan, Oliver Hummel,
Dietmar Stoll, A Practical Approach to Web
Service Discovery and Retrieval, IEEE
[18] F
uyong Yuan, Jian Liu, Chunxia Yin, Y Zhang
(2008) A Novel Methodology for Web Services
Discovery in Gnutella-like Networks, Third
International IEEE Conference on Signal Image
Technologies and Internet Based System, pp231-238.
[19] E
yhab Al-Masri, Qusay H. Mahmoud (2007)
WSCE-A Crawler Engine for Large-Scale
Discovery of Web Services, IEEE International
Conference on Web Services, pp. 1104-1111.
[20] Chengwen
Zhang, Y Ma, (2009) Dynamic
Genetic Algorithm for Search in Web Service
Compositions Based on Global QoS Evaluations,
Eighth IEEE International Conference on
Embedded Computing,
[21] M
ohamed Gharzouli, M Boufaida (2009)
A Generic P2P Collaborative Strategy for
Discovering and Composing Semantic Web
services, 4th International Conference on
Internet and Web Applications and Services,
pp.449-454.
I. Introduction
The image statistics proposed by Yiqiu Dong et al [1] was
efficient to detect the random valued impulse noise even
if the image is corrupted by 60% noise and a two stage
algorithm was used to denoise the images. A universal
S.V. Priya is
3
W = {(i 2, j 2), (i 1, j 2), (i 1, j 1), (i , j 2),
i, j
(i , j 1), (i + 1, j 2), (i + 1, j 1), (i + 2, j 2)}
4
W = {(i 2, j 2), (i 2, j 1), (i 2, j ), (i 2, j + 1),
i, j
(i 2, j + 2), (i 1, j 1), (i 1, j ), (i 1, j + 1)}
5
W = {(i + 1, j 1), (i + 1, j ), (i + 1, j + 1),
i, j
(i + 2, j 1), (i + 2, j ), (i + 2, j + 1)}
6
W = {(i 1, j 1), (i 1, j ), (i 1, j + 1),
i, j
(i 2, j 1), (i 2, j ), (i 2, j + 1)}
7
W = {(i 1, j + 1), (i 1, j + 2), (i , j + 1),
i, j
(i , j + 2), (i + 1, j + 1), (i + 1, j + 2)}
8
W = {(i 1, j 1), (i 1, j ), (i 1, j + 1), (i , j 1),
i, j
(i , j + 1), (i + 1, j 1), (i + 1, j ), (i + 1, j + 1)}
9
W = {(i 1, j 2), (i 1, j 1), (i , j 2),
i, j
(i , j 1), (i + 1, j 2), (i + 1, j 1)}
10
W
= {(i 2, j + 1), (i 2, j + 2), (i 1, j ),
i, j
(i 1, j + 1), (i 1, j + 2), (i , j + 1)}
11
W = {(i , j 1), (i + 1, j 2), (i + 1, j 1),
i, j
(i + 1, j ), (i + 2, j 2), (i + 2, j 1)}
12
W
= {(i , j + 1), (i + 1, j ), (i + 1, j + 1),
i, j
(i + 1, j + 2), (i + 2, j + 1), (i + 2, j + 2)}
13
W = {(i 2, j 2), (i 2, j 1), (i 1, j 2),
i, j
(i 1, j 1), (i 1, j ), (i , j 1)}
Table 1. Noise
Noise
level
6, 7
5%
22.85
39.65
64.15
85.24
97.31
99.10
10%
22.80
39.06
62.32
82.49
95.08
97.20
15%
22.46
38.40
60.25
79.63
93.13
95.51
20%
22.11
37.64
58.34
76.95
91.36
94.18
25%
21.35
36.40
55.93
73.92
89.44
92.82
30%
20.51
34.63
53.20
70.87
87.52
91.29
35%
19.57
33.04
50.64
68.00
85.62
89.77
40%
18.61
31.19
47.92
65.06
83.55
87.87
45%
17.70
29.20
45.18
62.33
81.49
86.06
50%
16.79
27.15
42.48
59.66
79.27
84.01
55%
16.11
25.68
40.39
57.69
77.44
82.12
60%
15.51
24.08
38.22
55.75
75.34
79.97
65%
14.93
22.85
36.61
54.15
73.30
77.74
70%
14.41
21.64
34.95
52.41
70.99
75.16
75%
14.26
21.12
34.33
51.79
69.19
73.00
80%
13.98
20.68
34.03
51.10
67.15
70.56
HDROAD with
Bets CR
S-Estimate with
Dynamic Kernel
5%
99.10
99.33
10%
97.20
98.02
15%
95.51
96.21
20%
94.18
95.30
25%
92.82
93.27
30%
91.29
92.31
35%
89.77
90.56
40%
87.87
89.03
45%
86.06
87.29
50%
84.01
85.32
55%
82.12
83.75
60%
79.97
81.92
65%
77.74
78.99
70%
75.16
77.07
75%
73.00
75.76
80%
70.56
72.43
VII. Conclusion
The noise estimation algorithm based on HDROAD
with best CR and the estimation based on S-Estimate
are compared. S-Estimate is applied for all the
directional sub-windows and the best known value
and hence the best decision taken is considered further.
Certainly, the S-Estimate applied for various directional
kernels improve the efficiency of noise estimation.
The improvement in the noise etimation efficiency
gives more freedom to improve the efficiency of the
noise removal filters. The calculation of S-Estimate
is a computationally heavy process and needs to
be optimized to make it suitable for fast estimation
intended for real-time scenarios.
References
[1] Y
iqiu Dong; Chan, R.H.; Shufang Xu, A
Detection Statistic for Random-Valued Impulse
Noise IEEE Transactions on Image Processing,
Vol.16, No.4, pp.1112-1120, 2007
[2] G
arnett, R.; Huegerich, T.; Chui, C.; Wenjie He,
A universal noise removal algorithm with an
impulse detector IEEE Transactions on Image
Processing, Vol.14, No.11, pp.1747-1754, 2005.
[3] X
uming Zhang; Youlun Xiong, Impulse Noise
Removal Using Directional Difference Based
Noise Detector and Adaptive Weighted Mean
Filter IEEE Signal Processing Letters, Vol.16,
no.4, pp.295-298, April 2009
[4] G
hanekar, U.; Singh, A.K.; Pandey, R., A
Contrast Enhancement-Based Filter for Removal
of Random Valued Impulse Noise IEEE Signal
Processing Letter , Vol.17, No.1, pp.47-50, 2010
[5] C
ivicioglu, P., Removal of random-valued
impulsive noise from corrupted images IEEE
Transactions on Consumer Electronics, Vol.55,
No.4, pp.2097-2104, 2009
[6] C
hih-Hsing Lin; Jia-Shiuan Tsai; Ching-Te Chiu,
Switching Bilateral Filter With a Texture/Noise
Detector for Universal Noise Removal IEEE
Transactions on Image Processing, Vol.19, No.9,
pp.2307-2320, 2010
[7] T
ripathi, A.K.; Ghanekar, U.; Mukhopadhyay,
S., Switching median filter: advanced boundary
discriminative noise detection algorithm IET
Image Processing, Vol.5, No.7, pp.598-610, 2011
[8] B
o Xiong; Zhouping Yin, A Universal Denoising
Framework With a New Impulse Detector and
Nonlocal Means Image Processing, IEEE
Transactions on, Vol.21, No.4, pp.1663-1675,
2012
[9] C
hih-Yuan Lien; Chien-Chuan Huang; PeiYin Chen; Yi-Fan Lin, An Efficient Denoising
Architecture for Removal of Impulse Noise
in Images IEEE Transactions on Computers,
Vol.62, No.4, pp.631-643, 2013
[10] Y
uan, S. -Q; Tan, Y. -H, Difference-type noise
detector for adaptive median filter Electronics
Letters, Vol.42, No.8, pp.454-455, 2006
[11] H
amed Vahdat-Nejad, Behrouz Tork-Ladani,
Kamran Zamanifar, Nasser Nematbakhsh, A
Novel Algorithm for Impulse Noise Classification
in Digital Images, International Review on
Computers and Software, Vol. 4. No. 6, pp. 627632, 2009
[12] P
. G. Kuppusamy, R. Rani Hemamalini, A VLSI
Based Framework for Iterative and Adaptive
Based Image Filter for Impulse Noise Removal,
International Review on Computers and Software,
Vol. 8, No. 1, pp. 235-242, 2013
[13] S
.V.Priya, R.Seshasayanan, A Robust Noise
Detector for High Density Noise Removal,
International Review on Computers and
Softwares, Vol.8, No.11, pp 2727-2732. 2013
[14] Y
uksel, M.E., A hybrid neuro-fuzzy filter for
edge preserving restoration of images corrupted
by impulse noise, Image Processing, IEEE
Transactions on , vol.15, no.4, pp.928,936, 2006
[15] G
hanekar, U.; Singh, A.K.; Pandey, R., A
Contrast Enhancement-Based Filter for Removal
of Random Valued Impulse Noise, Signal
Processing Letters, IEEE, Vol.17, No.1, pp.4750, Jan. 2010
[16] A
izenberg, I.; Butakoff, C.; Paliy, D., Impulsive
noise removal using threshold Boolean filtering
based on the impulse detecting functions, Signal
I. Introduction
CRC [1] is a very powerful and easily implemented
technique to obtain data reliability. The CRC technique
is used to verify the integrity of blocks of data called
Frames. Using this technique, the transmitter appends an
extra n bit sequence to every frame called Frame Check
Sequence (FCS). FCS holds redundant information
about the frame that helps the receiver detect errors
in the frame. CRC is one of the most commonly used
techniques for error detection in data communications.
The CRC was invented by W. Wesley Peterson in
1961; the 32-bit polynomial used in the CRC function
of Ethernet and many other standards is the work of
several researchers and was published in 1975.Cyclic
redundancy codes (also known sometimes as cyclic
redundancy checks) have a long history of use for error
detection in computing. Book [2][3] are among the
commonly cited standard reference works for CRCs.
A treatment more accessible to non-specialists can
be found in book [4]. A CRC can be thought of as a
(non-secure) digest function for a data word that can
Prakash V R and Kumaraguru Diderot P are in
School of Electrical Sciences, Hindustan University,
Chennai, India, (e-mail: pkguru@hindustanuniv.ac.in,
vrprakash@hindustanuniv.ac.in).
0+0 = 0-0 = 0
0+1 = 0-1 = 1
Figure
1+0 = 1-0 = 1
1+1 = 1-1 = 0
1-0=1
1-1=0
In fact, both addition and subtraction in CRC
arithmetic are equivalent to the XOR operation, and
the XOR operation is its own inverse. This effectively
reduces the operations of the first level of power
(addition, subtraction) to a single operation that is its
own inverse. This is a very convenient property of the
arithmetic.
By collapsing of addition and subtraction, the
arithmetic discards any notion of magnitude beyond
the power of its highest one bit. While it seems clear
that 1010 is greater than 10, it is no longer the case that
1010 can be considered to be greater than 1001. To see
this, note that you can get from 1010 to 1001 by both
adding and subtracting the same quantity:
1010 = 1010 + 0011
1010 = 1010 - 0011
This makes nonsense of any notion of order. Having
defined addition, we can move to multiplication and
division. Multiplication is absolutely straightforward,
being the sum of the first number, shifted in accordance
with the second number.
1101
x
1011
-------1101
1101.
0000
1101.
---------1111111 Note: The sum uses CRC addition
----------Division is a little messier as we need to know when
a number goes into another number. To do this, we
invoke the weak definition of magnitude defined earlier:
that X is greater than or equal to Y iff the position of
the highest 1 bit of X is the same or greater than the
position of the highest 1 bit of Y. In dealing with CRC
multiplication and division, it is worth getting a feel for
the concepts of MULTIPLE and DIVISIBLE.
1. C
hoose a width W and a polynomial G (of width
W).
3. D
ivide M by G using CRC arithmetic. The
remainder is the checksum.
T
o compute an n-bit binary CRC, line the bits
representing the input in a row, and position the
(n+1)-bit pattern representing the CRCs divisor
(called a generator polynomial) underneath the
left-hand end of the row.
V.CRC Implementation
S
tart with the message to be encoded: 10001110 =
X7 + x 3 + x 2 +x 1
T
his is first padded with zeroes corresponding to the
bit length n of the CRC. Here is the first calculation
for computing a 16-bit CRC:
<---
divisor
(17
bits)
--------------------------------------------
Three Steps
reg[23:0] data_in1;
T
he validity of a received message can easily be
verified by performing the above calculation again,
this time with the check value added instead of
zeroes.
else
end
begin
r1 = {r1[15:0], data_in1[i]};
if (r1[16] == 0)
r1 = r1;
r1 = r1 ^ poly;
end
VIIConclusion
References
[1] H
ardware Design and VLSI Implementation
of a Byte-wise CRC Generator Chip. IEEE
Transactions on consumer Electronics, 41 (1):
195-200, February 1995.
[2] P
eterson, W. & E. Weldon, Error-Correcting
Codes, MIT Press, Second Edition, 1972.
[3] L
in, Shu & D. Costello, Error Control Coding,
Prentice-Hall, 1983.
[4] W
ells, R., Applied coding and information theory
for engineers, Prentice-Hall, 1999.
[5] T
. B. Pei and C. Zukowski (1992), HighSpeed Parallel CRC Circuits in VLSI, IEEE
Transaction on Communications, vol. 40, no. 4.
[6] M
. Braun, J. Friedlich, J. Lembert, and Grun,
Parallel CRC computation in FPGAs, FPL96
Workshop on Field Programmable Logic
and Applications, Darmstadt, Germany, Sep.
1996.
[7] P
. Hlavka, V. Rehak, A. Smrcka, P. Simecek, D.
Safranek, and T. Vojnar, 2011, supported by the
CESNET activity Programmable hardware.
Formal Verification of the CRC Algorithm
Properties.
[8] A
n approach for a Standard Polynomial for
Cyclic.
[9] R
edundancy Check. International Journal of
Computer.
[10] Applications (0975 8887), December 2011.
[11] L
attice semiconductorCorporation, April 2011
Reference Design RD1105. Cyclic Redundancy
Checks in USB.
I. Introduction
Ad-hoc networks are formed without any predefined
architecture [14, 15]. The ad-hoc network is dynamic,
distributed [7] and provides multi-hop routing between
D. Helen is Research Scholar, Department of
Information Technology, AMET University , Chennai.
(e-mail: helensaran15@gmail.com).
D. Arivazhagan is HOD, Department of Information
Technology, AMET University , Chennai. (e-mail: it_
manager@ametindia.com).
the host and the network. The TORA [1] is an adhoc network, where it is planned to recreate the route
whenever the topology has altered. TORA guarantees
that the routes are created loop-free, and provide
numerous routes between source to destination [2].
TORA can also perform more efficiently at the point
of link flops and it can propagate the data packets from
the point of link failure. TORA works more reliably in
a larger network whenever the topology modification
has ensued. The network shape may vary whenever the
topological changes have to occur. This may degrade the
network parameters such as network size, bandwidth
and connection. If the network size is expanded then the
bandwidth availability will be reduced in the network.
In the proposed paper, the bandwidth utilization is
enhanced by using multiple channel in the ad-hoc
network. This can be achieved by applying the TORA
in Medium Access Control (MAC). The MAC is widely
accepted by IEEE 802.11 [17]. The MAC protocol is
used to share the medium by several hosts. The paper
plans to use multiple channel according to the MAC
protocol which allows the increase of the throughput
without delay in packet delivery.
Fig. 2. (a) Foot creation (showing link direction assignment) (b) Route maintenance in TORA.
Bandwidth Utilization
V. Applicability of TORA
Whenever the topological deviation has occurred it
may affect the following parameters of the network.
Network Size.
Bandwidth.
Network Connection.
TORA is able to work more effectively in a larger
network. If the network structure changes due to the
arrival of a new entering node it leads to increase in the
size of the network, decrease in the available bandwidth
usage and makes alteration in the network connection.
One of the unique characters of ad-hoc network is the
limited bandwidth. If the network size is increased
or network connection is extended then the available
bandwidth usage may decrease and it may lead to delay
in packet delivery. TORA can apply Medium Access
Control (MAC), to run in a multi-hop environment. To
overcome the delay in packet delivery in the proposed
paper, we propose multiple channels with different
bandwidths. Using multiple channels allows maximum
utilization of bandwidth in the network. The utilization
can be measured as
Utilization=pkt_size * successful_pkt time * no_channel
where pkt_size refers the total number of bits in the
packet, successful_pkt determines number of packets
received by destination, time represents the average
time to deliver the packet and no_channel is the total
number of channels in the network.
VII. Conclusion
This paper suggested the extreme distributed routing
algorithm TORA. The algorithm is well matched for a
ad-hoc network. The protocol is scheduled to recreate
the network whenever the links get fragmented. The
TORA combines with link reversal algorithm and DAG
to sustain the route at the destination. The paper has
proposed the use of the TORA along with MAC to
increase the network utilization to overcome the limited
usage of bandwidth.
References
[1] R
oyer, E.; Toh C.K. (1999) A review of current
routing protocols for ad hoc mobile wireless
networks, IEEE Personal communications,
pp.46-55
[8] A
nuj K. Gupta, Dr. Harsh Sadawarti and Dr.
Anil K. Verma, Performance analysis of AODV,
DSR & TORA Routing Protocols, International
Journal of Engineering and Technology, Vol.2,
No.2, 2010.
[9] S
uresh
Kumar
and
Jogendra
Kumar,
Comparative Analysis of Proactive and Reactive
Routing Protocols in Mobile Ad-Hoc Networks
(Manet), Journal of Information and Operations
Management, Vol. 3, Issue 1, 2012.
[10] D
. Bertsekas and R. Gallager, Data Networks
(Prentice-Hall, 1982).
[11] V
. Park and M. S. Corson, A Highly Adaptive
Distributed Routing Algorithm for Mobile
Wireless Networks, Proc. of IEEE INFOCOM
97, Kobe, Japan.
[12] M
.S. Corson and A. Ephremides, A distributed
routing algorithm for mobile wireless networks,
Wireless Networks 1, 1995.
[13] Charles
E. Perkins, Ad hoc networking, 2000,
Addison-Wesley Professional.
[14] P
ark, V.; Corson, M. S: Internet draft; Temporally
ordered Routing Algorithm (TORA), version 1,
Functional Specification, 2001.
[15] IEEE Computer Society. IEEE 802.11 Standard,
IEEE Standard For Information Technology.
I. Introduction
Conventional refrigerants such as CFC, HCFC, and HFC
with good chemical and thermophysical characteristics
Jeya Pratha.S and Mahendran.S are in School of
Mechanical Sciences, Hindustan University, Chennai,
India, (e-mail: sjayap@hindustanuniv.ac.in)
where
Q Heat Transfer rate in Kw
As surface area of the test section in m2
Tf Inlet fluid temperature in K
Ts Saturation temperature of the refrigerant
mixture at the corresponding mass compositions in
liquid phase in K.
Note:
The saturation temperature of the refrigerant mixtures
are chosen from REFPROP for its corresponding mass
composition and its pressure.
References
[1] J in Min Cho, Yong Jin Kim, Min Soo Kim (2010),
Experimental studies on the characteristics of
evaporative heat transfer and pressure drop of
CO2/propane mixtures in horizontal and vertical
smooth and micro-fin tubes, in International
Journal of Refrigeration 33, 170 179.
Fig. 10. Graph showing variation of heat transfer coefficient with inlet temperature 100c
VIII. Conclusion
This paper presents the measured heat transfer coefficients
during evaporation process of carbon dioxide in a
horizontal smooth tube. Carbon dioxide among natural
refrigerants has gained considerable attention as an
alternative refrigerant due to its excellent thermophysical
properties. In tube evaporation heat transfer characteristics
of carbon dioxide were experimentally investigated and
analyzed as a function of evaporating temperature, heat
flux and tube geometry. Heat transfer coefficients show
a tendency to decrease at the beginning of evaporating
process for pure CO2 and mixture with high composition
[2] Jin Min Cho, Yong Jin Kim, Min Soo Kim
(2010), Experimental studies on the evaporative
heat transfer and pressure drop of CO2 and CO2/
propane mixtures flowing upward in smooth and
micro-fin tubes with outer diameter of 5 mm
for an inclination angle of 450, in international
Journal of Refrigeration 33, 922 931.
[3] J in Min Cho, Min Soo Kim (2007), Experimental
studies on the evaporative heat transfer and
pressure drop of CO2 in smooth and micro-fin
tubes of the diameters of 5 and 9.52 mm, in
International Journal of Refrigeration 30, 986
994 .
[4] S
.H. Yoon, E.S. Cho, Y.W. Hwang, M.S. Kim,
K.D. Min, Y.C. Kim (2004), Characteristics of
evaporative heat transfer and pressure drop of
carbon dioxide and correlation development,
International Journal of Refrigeration 27, 111 119.
[5] J ung, D.S., Lee, H.S., Bae, D.S., Ha, J.C., (2005),
Nucleate boiling heat transfer coefficients of
flammable refrigerants on various enhanced
tubes, International Journal of Refrigeration 28,
451455.
[6] K
im, J.H., (2005), Studies on the vapor-liquid
equilibria of carbon dioxide/propane mixture and
their performance in an airconditioning system,
Ph.D. thesis, School of Mechanical and Aerospace
Engineering, Seoul National University, Korea.
[7] K
im, Y.J., Cho, J.M., Kim, M.S., (2008),
Experimental study on the evaporative heat
transfer and pressure drop of CO2 flowing
upward in vertical smooth, and micro-fin tubes
with the diameter of 5 mm. International Journal
of Refrigeration 31, 771779.
[8] L
ee, H.S., Phan, T.T., Yoon, J.I., (2006),
Characteristics of hydrocarbon refrigerants on
evaporating heat transfer and pressure drop.,
International Journal of Air-Cond. Ref. 14, 102
109.
[9] M
athur, G.D., (1998), Heat transfer coefficient
for propane (R-290), isobutene (R600), and 50/50
mixture of propane and isobutene, ASHRAE
Trans.: Symp., 11591172.
[10] K
im, Y.J., Cho, J.M., Kim, M.S., (2008),
Experimental study on the evaporative heat
transfer and pressure drop of CO2 flowing
upward in vertical smooth and micro-fin, tubes
with the diameter of 5 mm. International Journal
of Refrigeration 31, 771779.
[11] Y
.C. Kim, K.J. Seo, J.T. Chung (2002),
Evaporation heat transfer characteristics of
R-410A in 7 and 9.52 mm smooth/micro-fin
tubes, International Journal of Refrigeration 25,
716 - 730.
[12] E
.W. Lemmon, M.O. McLinden, M.L. Huber
(2002), Reference Fluid Thermodynamic
and Transport Properties (PEFPROP), NIST
Standard Reference Database 23, Version 7.0.
Gaithersburg (MD, USA):National Institute of
standard and Technology.
[13] G
. Lorentzen (1994), Revival of carbon dioxide
as a refrigerant, International Journal of
Refrigeration 17 (5) 292 - 301.
[14] D
.S. Jung, M. McLinden, R. Radermacher,
D. Didion (1989), A study of flow boiling
heat transfer with refrigerant mixtures,
International Journal of Heat Mass Transfer
32, 1751 1764.
I. Introduction
A cascade refrigeration system can be considered to
be equivalent to two independent vapor-compression
systems linked together in such a way that the
evaporator of the high-temperature system becomes the
condenser of the low-temperature system. However, the
working media of the two systems are separated from
each other. This therefore, allows the use of different
refrigerants working at different temperature ranges
to achieve the desired effect, which would otherwise,
need to be achieved by a single refrigerant working at a
T. S. Ravikumar and S. Saravanan are in School of
Mechanical Sciences, Hindustan University, Chennai,
India (email: mech@hindustanuniv.ac.in)
A. Subsystem 1:
Refrigerant: R134A, reciprocating compressor, air
cooled condenser, capillary tube & tube in tube heat
exchanger1.
B. Subsystem 2:
Refrigerant: R404A, reciprocating compressor, air
cooled condenser, capillary tube & tube in tube heat
exchanger 2.
C. Main System:
Refrigerant: R23, reciprocating compressor, air cooled
condenser, capillary tube, evaporator coil & fan.
A. Evaporator Calculation:
(Before Fabrication)
Available data:
1. Evaporator load = 3. 516 KW
2. Shell and coil evaporator
3. Internal diameter of the copper pipe = 7. 9375 x
10-3 m
4. Outer diameter of the copper pipe = 9. 525 x 10-3 m
hi 7.9375 10 3
= 23115.59 kJ/kg
0.073
h0 =23115. 59 w/ m2k
Thermal conductivity
Prandtl number
K(w/m K)
-Pr-
-65
0. 073
-35
0. 073
3. 5
To find U:
U =
1
= 11505. 022W/m 2 k
1 1
+
hi ho
To find Q:
Q =m CP T Watts
Solution:
Inside flow:
Q=51271. 5 W
32.546 7.9375 10 3
= 1.168 106
Re=di/ =
0.211 10 3
To find AREA:
hi = 22905. 46 w/ m2k
32.546 9.525 10
0.198 10 6
Outside flow:
Re =do/=
Q =UA T Watts
L =4. 964 5m
3
= 1.56 106
Fig. 3. Pressure(P)-Enthalpy(H)diagram
COP2 =
C. Subsystem1 (R134A):
R404A
R134A
temperature
pressure
bar
KJ/kg
KJ/kg
238
8. 5
340. 7
293
30. 7
365. 6
208. 6
253
3. 071
355. 16
303
14. 28
378. 14
244. 03
263
2. 006
244. 52
323
13. 85
276. 01
149. 41
Solution:
COPR23
COP2 COPR134 A
2.347 3.02
=
= 1.11
COP2 + COPR134 A + 1 2.347 + 3.02 + 1
h h
340.7 208.6
= 1 4 =
= 5.30
h2 h1 365.6 340.7
COPR 404 A =
h5 h8 355.16 244.03
=
= 4.83
h6 h5 378.14 355.16
COPR134 A =
h9 h12
244.52 149.41
=
= 3.02
h10 h11 276.01 244.52
Re=di/
(1)
Nusselt number=hiDi/K
(2)
(4)
Nusselt number=hoD0/K
(5)
R23
Inside flow:
B. Subsystem2 (R404A):
refrigerant
1
( W/m 2 k )
1 1
+
hi ho
Q =m CP T watts
U=
(7)
(8)
Q =UA T Watts
h h
COPR23 = 1 4
h2 h1
COPR 404 A
(10)
h h
= 5 8
h6 h5
COPR134 A =
COP2 =
(9)
(11)
h9 h12
h10 h11
(12)
(13)
COPZ COPR134 A
COPZ COPR134 A + 1 (14)
VI.Abbreviations
Re = Reynolds Number (non-dimensional)
= velocity (m/s)
=kinematic viscosity(m2/s)
di=internal diameter of copper pipe(m)
hi =inner heat transfer coefficient(W/ m2k)
K= Thermal conductivity (W/m K)
Pr= Prandtl number (non-dimensional)
VII.Conclusions
In this paper the design and fabrication of an ultimate
cooling system carried out has been described. The result
obtained from the project reported in this paper is:
Conditioned space temperature= -60C
Coefficient of performance =1. 11
References
[1] A
SHRAE, (1990) Refrigeration Systems and
Applications Handbook, ASHRAE Inc. Atlanta.
[2] A
rora (2002), Refrigeration and Air
conditioning, 2nd edition, Tata McGraw Hill,
New Delhi.
[3] C
ourse In Refrigeration & Air-conditioning by
Sc Arora, Domkundwar.
[4] D
evanshu pyasi (2010), Performance analysis
of 404a/508b Cascade Refrigeration cycle for
low temperature, International Journal of
Engineering Science and Technology (IJEST),
Vol. 2, No. 8, pp. 302-306.
[5] H
ossein Amooie (2012), performance analysis
of co2/nh3 cascade refrigeration system using
ANNs. Journal of Advanced Computer Science
and Technology, Vol. 5, No. 4, pp. 222-225.
[6] K
apadia (2011), Comparative Assessment of
a Cascade refrigeration cycle with different
refrigerant pair, International Conference on
Current Trends in Technology, Vol. 7, No. 5, pp.
106-116.
[7] M
urat HOS_ OZ (2005), Performance
Comparison of Single-Stage and Cascade
Refrigeration Systems using R134a as the
Working Fluid, Turkish Journal of Engineering
Environmental Science, Vol 2, No. 15, pp. 27-32.
[8]
[9] S
tocker WF, Industrial refrigeration handbook,
McGraw Hill, New York, 1998.
[10] T
ailor (2012), Thermodynamic Analysis of
R507A-R23Cascade Refrigeration System,
International Journal of Aerospace and Mechanical
Engineering, Vol. 9, Vo. 24, pp. 22-27.
I. Introduction
Conventional machining such as turning, milling
and drilling show ineffectiveness in machining of
advanced materials, like composites, ceramics, super
alloys as it results in poor MRR, excessive TWR and
A. Die Sinking
In Die Sinking EDM process, the tool electrode is the
replica of the machined profile of the work material [12]
.This process enables manufacturing of accurate and
complex shaped cavities. Die Sinking EDM consists
of an electrode and workpiece submerged in dielectric
fluids. Figure 2 shows the schematic diagram of Die
Sinking EDM, electrode and workpiece are connected
to a suitable power supply, which generates an electric
potential between both the parts [8]. As electrode
approaches the work piece, dielectric breakdown occurs
in fluids forming a plasma channel and spark jumps.
As base metal is eroded, spark gap increases. Hence
electrode is lowered automatically so that process is
continued [12].
B. Wire EDM
Fig. 1. Schematic diagram of EDM
[Bhavesh A. Patel et al, 2013]
C. Dry EDM
Dry EDM uses gas-liquid mixture as the two phases
of the dielectric fluid. It has the advantage of the
concentration of liquid and properties of dielectric
fluid to meet the desired performance responses. In
dry EDM, tool electrode is formed to be thin walled
pipe [10]. High MRR can be obtained cutting high
strength engineering materials in the presence of
oxygen high-pressure gas or air supplied through
the pipe. The role of the gas is to remove the debris
from the gap and to cool the inter electrode gap. The
technique was developed to decrease the pollution
caused by the use of liquid dielectric that leads to
production of vapour during machining and the cost
to manage the waste. Helium and argon gas can be
used as a dielectric medium to drill holes using copper
electrodes [14]. Introducing oxygen gas into the
discharge gap increases the material removal rate in
water as a dielectric medium.
VI. Conclusion
EDM has emerged as the most cost effective and
high precision machining process in the past years.
The machining capacity to remove hard and difficult
to machine parts has made EDM as one of the most
important machining processes. A review of the
research trends for the last 50 years in EDM process;
its applications and influence of critical parameters
have been presented. EDM plays a significant role in
medical, optical, jewellery, automotive and aeronautic
industry. Such applications require machining of high
strength temperature resistant (HSTR) materials, which
demand strong research and development and prompt
EDM machine tool manufacturers to improve the
machining characteristics. Hence, further research is
required to explore effective means of improving the
performance of the EDM process.
References
[1] S
engottuvel, P., Satishkumar, S. and Dinakaran,
D., Optimization of Multiple Characteristics of
EDM Parameters Based on Desirability Approach
[11] M
aradiaa U, Boccadorob M, Stirnimannc
J, Beltramib I, Kustera, and Wegenera K, Diesink EDM in meso-micro machining Proc. of
5th Conference on High Performance Cutting.
Institute of Machine Tools and Manufacturing,
ETH Zurich, Zurich 8092, Switzerland, 2012.
[12] S
ingh S, Maheshwari S. and Pandey P.C,
Investigations into the electric discharge
machining of hardened tool steel using different
I. Introduction
Hindustan Group of Institutions has taken an initiative
to provide need-based and skill-based education to
the adolescents who have been deprived of higher
Aby Sam is Director, Hindustan University, Chennai,
India, (e-mail: abysam@hindustanuniv.ac.in)
Akkara Sherine is in Department of Applied Sciences,
Hindustan University, Chennai, India, (e-mail:
sherinej@hindustanuniv.ac.in)
.
Fig. 5. Drop-out rates in school --2001
XVI. Conclusion
This research paper concludes highlighting the
importance of community college and its unique
feature in giving skills training to students empowering
the target learners in life coping skills and working
skills. The teaching methodology, the curriculum and
the assessment methods adopted in this institution
are unique and beneficial to the students. The study
shows that the majority of the students belonging to
the economically backward groups of society, and
the school drop outs transcending the social barriers,
are the beneficiaries of the programme offered by the
community college. It is noteworthy to mention that a
student of HCC was selected for one year training in the
USA as part of the Indo-US Community Scholarship
scheme initiated by the US Consulate in New Delhi,
India. Hindustan Community College fulfills the needs
of the students and has successfully conducted the
courses for three years. The institution has a record of
91.5% placement of students and the remaining 8.5%
have opted for higher education.
If one Institution can reach out to 200 300
deprived and excluded section of youth, empowering
them with required skills and helping them to come out
their societal and economic barriers to a world of new
hope, new status and life style, think of the changes,
countless organisations, institutions and corporate-big
or small, can make.
References
[1] V
ictor Luckerson, Can Community Colleges Put
Americans Back to Work Time.com. 28 Nov.
2012. Web 4 Feb. 2013. <http://business.time.
com/2012/11/28/can-community-colleges-putamericans-back-to-work/#ixzz2JDwgXqw2>.
[2] G
lenn, Robert and Katheryn Keene.Smyth
County Industry Council. Workforce Demand
Profile 2003. The Issues Management Group.
25 Jan. 2004.
[3] N
ational Collaborative on Workforce and
Disability for Youth, Helping Youth Develop
Soft Skills for Job Success: Tips for Parents and
Families. Web 4 Feb. 2013. <http://www.ncwdyouth.info/information-brief-28>.
[4] C
hugh, Sunita. Dropout in Secondary
Education: A Study of Children Living in
Slums of Delhi NUEPA Ocassional Paper
37, 2011. http://www.nuepa.org/Download/
Publications/Occasional%20Paper%20
No.%2037.pdf
[5] B
ryk and Thum, (1989): The Effects of High
School Organization on Dropping out: An
Exploratory Investigation, American Educational
Research Journal 26(3) 353-383.
[6] India to set up 100 community colleges: Sibal
Press Trust of India / New Delhi September 06,
2012, Web. 6 Feb. 2013. <http://www.businessstandard.com/generalnews/news/india-toset100-community-colleges-sibal/53051/>.
[7] C
hristian Manager Community Colleges as an
Alternative System of Education Interview with
Fr. Xavier Alphonse. Christian Manager. http://
www.cimindia.in/cm/Au-sp20-28.pdf
[8] Building American Skills through Community
Colleges.
http://www.whitehouse.gov/sites/
default/files/100326-community-college-factsheet.pdf .
[9] E
lizabeth Redden, The Community College
Internationally, Web. June 16, 2010 http://www.
insidehighered.com/news/2010/06/16/intl
[15] A
kkara Sherine, A Rajkumar and N. Jose Pravin,
Study on People Skills Enhances Learning
Outcomes and Peps up Job Placement using
Combined Overlap Block Fuzzy Cognitive
Maps (COBFCMS) http://www.ijcaonline.org/
archives/volume57/number8/9136-3336
[10] R
esearch study on Impact & Prospects of
the Community College system in India
Aug 2003--Madras Centre for Research and
Development of Community EducationChennai
[16] M
artin Luther King Jr., The Purpose Of Education.
Morehouse College Student Paper, The Maroon
Tiger, 1947. http://www.drmartinlutherkingjr.
com/thepurposeofeducation.htm
V. Research / CPD
The pedagogic functioning of the university
department which offers the integrated programme
proposed above does not end with producing a
professional who is expected to meet the challenges of
the profession well. It further demands the department
to promote academic research in the field of TESL
along with the conventional areas such as literature
and cultural studies. It must also sponsor ongoing (and,
never ending) academic events leading to continuous
professional development (CPD) in the form of inservice teacher education, action research and so on.
That is to say, it is the departments duty to provide a
permanent platform for its former students who have
entered the teaching profession to periodically meet
and discuss issues related to the teaching-learning of
English. Such periodic events can be in the form of
workshops, conferences, self help groups (SHGs),
special interest groups(SIGs), non-governmental
organizations (NGOs) and so on.
References
[1] B
hat, Hemraj, (2010), The Diary of a School
Teacher, Tr. Sharada Jain. Bangalore, Azim
Premji Foundation.
[2] B
urns, Anne. (1999), Collaborative Action
Research, Cambridge, Cambridge University
Press.
[3] B
urns, Anne and J.C. Richards. (2009), Second
Language Teacher Education, Cambridge,
Cambridge University Press
[4] C
ostella, Patrick.J.M. (2003), Action Research,
London, Continuum Publishers.
[5] L
eung, Contant. (2009), Second Language
Teacher Professionalism. In Burns, Anne and
J.C.
[6] R
ichards. (2009), Second Language Teacher
Education, Cambridge, Cambridge University
Press.
[7] T
udor, Ian. (1996), Learner-centredness as
English Language Education, Cambridge,
Cambridge University Press.
I. Introduction
Most people believe that internet can replace the library
and they can get all types of informational sources from
it. Therefore, the librarians should take on the challenge
of guiding the users on how to evaluate and identify
the accurate and correct sources using the right method.
E. Boopalan, K. Nithyanandam and I. Sasirekha are
in School of Applied Sciences, Hindustan University,
Chennai, India (e-mail: boopalan6@gmail.com, cl@
hindustanuniv.ac.in, i.sasirekha@gmail.com)
A. Internet, WWW:
Openness
C
reating home pages,
downloading techniques;
content
conversion,
Transparency
Interoperability
Representation
A
rchiving digital documents, locating digital
sources;
WEB authoring.
communications
and
C
ataloguing and classification of digital documents,
digital content;
S
earching and retrieval of text, images and other
multimedia objects;
Speech recognition, image visualization;
A
dvanced processing capabilities exploiting digital
medium;
C
onferencing
techniques
teleconferencing, video conferencing.
including
I
nterfacing online and off-ramps, twists and turns
of digital knowledge;
Privacy/Confidentiality
Development of digital information sources;
Technology Challenges
Digitization of print collections;
Manpower
Competency to manage CD-ROM network station;
D
evelopment of machine readable catalogue
records;
Organizational structure
Design and development of databases;
D
esign and development of software agents for
digital libraries;
Conversion of print media into digital media;
Knowledge in digital knowledge structures.
Copyright Act
Online/Virtual Crimes and Security
X. Conclusion
The digital librarian will become the guardian of
digital information and will be the vehicle to preserve
democratic access to information. The digital librarians
role will be increasingly towards offering consultancy
to the users in their efforts in providing digital reference
services, electronic information services, navigating,
searching and retrieval of digitized information through
Web documents that span the Universal Digital Library
or the Global Digital Library. The digital librarian will
be an embodiment of a digital information professional
or digital knowledge worker, who will ensure that the
digital libraries are used effectively and with ease.
Digital librarians with newly acquired skills can
References
[1] B
orgman, C. L., Bates, M. J., Cloonan, M. V.,
Efthimoadis, E. N., Gilliland- Swetland, A. J.,
Kafai, Y. B., et al. (1996). Social aspects of
digital libraries. Retrieved 2012 from http://dlis.
gseis.ucla.edu/DL/UCLA_DL_Report.html
[2] E
guavoen, O. E. L. (2011). Attitudes of Library
Staff to the Use of ICT: The Case of Kenneth
[4] G
reen, C. (2009). Rethinking how and where
digital knowledge is stored, shared, tagged
and licensed in the 21st century: New role for
librarians? Retrieved 2012, from http://www.
slideshare.net/CollegeLibrarians/new-role-forlibrarians-1486401
[5] H
awkins, B. L. (2001). Information access in
the digital era. Retrieved 2012 from http://net.
educause.edu/ir/library/pdf/erm0154.pdf
[6] W
illiam, B.K. and Saffady, S. (1995), Digital
library concepts and technologies for the
management of collections: an analysis of
methods and costs, Library Technology Reports,
Vol. 31, May-June, pp. 221.
Forthcoming Conferences
1. I CICT 2014 : International
Conference on Information and
Communication Technologies
(Proceedings - Elseviers
Procedia Computer Science)
3rd to 5th December 2014
Kochi, Kerala, India
Website:http://icict.cusat.ac.in/
2. 2014 International Conference
on Circuits, Devices and
Systems
(ICCDS 2014)
13th to 14th December 2014
Xiamen, China
Website:http://www.iccds.org/
3. 2014 International Conference
on Mechanical Properties of
Materials (ICMPM 2014)
18th to 20th December 2014
Barcelona, Spain
Website:http://www.icmpm.org/
4. International Science and
Technology Conference
18th to 20th December 2014
Doha, Qatar
Website: http://iste-c.net/
5. Twelfth AIMS
International Conference
on Management
2nd to 5th January 2015
Kozhikode, Kerala, India
Website: http://www.aimsinternational.org/aims12
6. 2015 3rd International
Conference on Communication
and ElectronicsInformation
(ICCEI 2015)
5th to 6th January 2015
Bali, Indonesia
Website:http://www.iccei.org/
7. International Conference on
Pervasive Computing
8th to 10th January 2015
Pune, Maharashtra, India
Website: http://www.icpc2015.org
8. Second International
Conference on Recent Trends
in Engineering and Technology
2015
10th to 11th January 2015 Cochin,
Kerala, India
Website: http://www.ijbrmm.org/
ICRTET_cochin
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
Engineering (ICOCEE
Cappadocia 2015)
20th to 23rd May 2015 Nevsehir,
Turkey
Website: http://www.icocee.org/
31. 19th International Symposium
VLSI Design and Test VDAT2015
26th to 29th June 2015
Ahmedabad, India,
Gujarat, India
Website: http://vdat2015.org
32. ERES 2015 - 10th International
Conference on Earthquake
Resistant Engineering
Structures
29th June to 1st July 2015
Opatija, Croatia (Hrvatska)
Website:http://www.wessex.
ac.uk/eres2015
33. International Conference
on Renewable Energy and
Sustainable Environment
(RESE 2015)
3rd to 5th August 2015 Pollachi,
Tamilnadu, India Website: http://
www.drmcet.ac.in/conference
34. IEEE Technically Co-Sponsored
Science and Information
Conference 2015
28th to 30th July 2015 London,
United Kingdom Website:http://
thesai.org/SAIConference2015
35. BIM 2015 - International
Conference on Building
Information Modelling in
Design, Construction and
Operations
9th to 11th September 2015
Bristol, United Kingdom
Website:http://www.wessex.
ac.uk/bim2015
36. International Conference
on Innovations in Intelligent
Systems and Computing
Technologies (ICIISCT2015)
18th to 20th September 2015
37.
38.
39.
40.
41.
42.