CARBON MONOXIDE CONCENTRATION CAUSED BY TRAFFIC IN COIMBATORE CITY USING GEOTECHNIQUES

¹ G.Noushad, ² Dr. A.Ilandhirayan
¹, Assistant Professor, Department of Civil Engineering, Ranganathan Engineering Colleges, Thondamuthur, Coimbatore, Tamilnadu, India.
^2, Assistant Professor, Department of Geography, Karur Govt. Arts College, Karur, Tamilnadu , India.

     The environment has an impact on every aspect of human life and every human activity affects the environment with social, technological and economic development. Abnormal consumption of various natural resources has increased the level of pollutants such as air pollution, chemical pollution, thermal pollution and radioactive pollution etc., which is increasing at an exponential rate, thus endangering our country’s rich ecology and environment. The major sources of air pollutants are man’s industrial manufacturing and motor vehicle operation activities, both of them have been concentrated in urban areas. Study area Coimbatore district is the second most populous city in Tamilnadu and spread over an area of 105.60 sq.km. Study area is well connected with other centres of the country by road, rail and air routes. The National highways are passes through the city. The study area for the present work deals with Carbon Monoxide from vehicular emission due to heavy traffic flow. Vehicular data were collected from 6 sample traffic junctions were selected and the vehicles running time, based on the peak hours of the traffic junctions. Geographic information systems (GIS) as management and supporting systems enable us to integrate and analyze air pollutants on environment. Finally spatial analysis such as overlay, buffering and IDW have been performed studied for carbon monoxide pollution in the city.

View full abstract...

ROLE OF SOCIAL NETWORKS TO LINK PERSONAL HEALTH RECORDS USING ATTRIBUTE BASED ENCRYPTION

¹ C.Kalaivani, ² Mrs.J.V.Anchitaalagammai

¹ PG student- Department of CSE - Velammal college of Engineering and technology, Madurai, Tamilnadu, India.
² Assistant Professor - Department of CSE- Velammal college of Engineering and technology, Madurai, Tamilnadu, India.

     Personal health record (PHR) is a rising patient-centric model of health information exchange which is often stored at a third party. Major problem in this scenario is the privacy of records. To assure the patients control over access to their own PHRs, it is a promising method to encrypt the PHRs before outsourcing. A new cryptosystem for fine grained sharing of encrypted data is developed based on Attribute Based Encryption technique (ABE) in a social networking environment. We propose an assurance of providing security for the PHR records. Not only providing security also provides scalability and flexible access to the records. To achieve fine-grained and scalable data access control for PHRs and to reduce the key distribution complexity, we divide the system into multiple security domains where each domain manages only a subset of the users. In this way, each patient can have full control of their PHR file and the key management complexity is reduced dramatically. Our proposed scheme is also flexible as it supports efficient random-demand revocation of user access rights and break-glass access under emergency scenarios.

View full abstract...

CONTEMPORARY ROUTING CHANNEL HOPPING FOR COGNITIVE RADIO NETWORK

P.Venkatesh

M.E - Department of Computer Science and Engineering Srividhya college of Engineering and technology, Virudhunagar, Tamilnadu, India.

     Recently, cognitive radio (CR) has become a key technology for addressing spectrum scarcity. In CR networks, spectrum access should not interfere the colocate incumbent networks. Due to the requirement above, common control channel approaches, which are widely used in traditional multichannel environments, may face serious CR long-time blocking problem and control channel saturation problem. Although channel-hopping-based approaches can avoid these two problems, existing works still have significant drawbacks including long time-to-rendezvous, unbalance channel loading, and low channel utilization. In this paper, we introduce three channel-hopping approaches, RCCH, ARCH, and SARCH for synchronous and asynchronous environments, respectively. Compared with previous works, our schemes outperform the state of the art in terms of these metrics.

View full abstract...

AN EFFICIENT INDEXING SCHEME TO IMPROVE ACCURACY AND SPEED OF IRIS RECOGNITION SYSTEMS

¹ K.M.Rajshree, ² Ms. G.Pramila, ³ Dr.A.Askarunisa, ⁴ Mr.A.Athiraja
¹ PG Student, ² Assistant Professor, ³ Professor & Head, 4 Assistant Professor
Department of Computer Science and engineering, Vickram College Of Engineering, Enathi, Sivagangai, India.

     In video analysis and image processing, the most successful application of iris authentication. In this project, several novel approaches are proposed to improve the overall performance of iris recognition systems. First, to achieve a low rate of eyelash misclassification, a new eyelash detection algorithm based on directional filter is proposed. Second, fusion method proposes a multiscale and multiorientation data method is introduced to reduce the edge effect, and to increase matching criteria. Finally, to accelerate exhausted the search in a huge iris database performed, using an iris indexing method on the basis of corner detection is presented, and matching process is performed by using hamming distance. The performance evaluations are carried out on two popular iris databases (CASIA IRIS INTERVAL) and (CASIA IRIS TWIN), and the test results are experimentally more accurate with less elapsed time compared with most existing methods.

View full abstract...

AUTOMATIC LATENT FINGERPRINT SEGMENTATION BASED ON ORIENTATION AND FREQUENCY FEATURES

¹ T.Revathy, ² Ms.G.Pramila, ³ Dr.A.Askarunisa, ⁴ Mr.A.Athiraja
¹ PG Student, ² Assistant Professor, ³ Professor & Head, ⁴ Assistant Professor
Department of Computer Science and engineering, Vickram College Of Engineering, Enathi, Sivagangai, India.

     Latent fingerprints are lifted from crime scenes in a routine procedure that is extremely important to forensics and law enforcement agencies. Since it contains as small regions of fingerprint, latents have a significantly smaller number of minutiae points compared to full (rolled or plain) fingerprints. The small number of minutiae and the noise characteristic of latents make it extremely difficult to automatically match latents to their mated full prints that are stored in law enforcement databases. To overcome this problem, the automatic segmentation is used. An important step in an automatic fingerprint recognition system is the process of automatically segmenting the fingerprint images. In this paper, the segmentation process consists of the three blocks namely (i) segmentation of Orientation feature, (ii) Segmentation of Frequency feature and (iii) Post processing. The Orientation Feature process is used to obtain the fingerprint ridge orientations, the Frequency Feature process is used to obtain the local ridge frequencies of the fingerprint. The Post Processing method combine these two results to find the candidate fingerprint regions (foreground).The proposed scheme achieves accurate segmentation for latent matching of fingerprint. This system improves the accurate segmentation of foreground and background regions from latent fingerprint images. This system gives 77% of accuracy to detect a foreground region from latent fingerprint images.

View full abstract...

TIME OPTIMIZATION IN TEXTILE MILL BY USING TABU SEARCH ALGORITHM

¹ R.Karthikeyan, ² R.Rajkumar, ³ P.Immanuel

¹ Assistant Professor, Department of Mechanical Engineering, Einstein College of Engineering, Tirunelveli, Tamilnadu, India.

² Professor, Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India.

³ Assistant Professor, Department of Mechanical Engineering, Einstein College of Engineering, Tirunelveli, Tamilnadu, India.

     The objective of this paper is to make a traditional process called scheduling much more finite and easy to use in textile industry. In textile industry, complex equipments are to be used precisely in such a way that the product being produced is completely finished within the given time. Also, when dealing with fewer counts of yarns, the process is quite easy to handle. But, if a huge sum of yarn counts are present in the situation, the process becomes quite complex and leads to more processing time. In order to reduce such complexity, time optimization, Tabu search algorithm is used. Main problem is decomposed into independent sub problems so that the algorithm can be parallelized on multiple processors. Each sub problem is solved on a different processor. With the algorithm being processed, corresponding programs are created with help of the programming language JAVA. The output of the program are obtained and validated with actual results.

View full abstract...