| Abstract: | Any automatically measurable, robust and distinctive physical characteristic or personal trait that can be used to identify an individual or verify the claimed identity of an individual, referred to as biometrics, has gained significant interest in the wake of heightened concerns about security and rapid advancements in networking, communication and mobility. Multimodal biometrics is expected to be ultra-secure and reliable, due to the presence of multiple and independent—verification clues. In this study, a multimodal biometric system utilising audio and facial signatures has been implemented and error analysis has been carried out. A total of one thousand face images and 250 sound tracks of 50 users are used for training the proposed system. To account for the attempts of the unregistered signatures data of 25 new users are tested. The short term spectral features were extracted from the sound data and Vector Quantization was done using K-means algorithm. Face images are identified based on Eigen face approach using Principal Component Analysis. The success rate of multimodal system using speech and face is higher when compared to individual unimodal recognition systems |
| Description: | International Journal of Computer Science and Communication Vol. 2, No. 1, January-June 2011, pp. 143-147 |
| URI: | http://dyuthi.cusat.ac.in/purl/3879 |
| Files | Size |
|---|---|
| A PROTOTYPE FOR ... STEM BASED ON FACE AND.pdf | (501.0Kb) |
| Abstract: | In recent years, reversible logic has emerged as one of the most important approaches for power optimization with its application in low power CMOS, nanotechnology and quantum computing. This research proposes quick addition of decimals (QAD) suitable for multi-digit BCD addition, using reversible conservative logic. The design makes use of reversible fault tolerant Fredkin gates only. The implementation strategy is to reduce the number of levels of delay there by increasing the speed, which is the most important factor for high speed circuits. |
| Description: | Advanced Computing and Communications, 2007. ADCOM 2007. International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/3876 |
| Files | Size |
|---|---|
| Quick Addition ... ble Conservative Logic.pdf | (264.0Kb) |
| Abstract: | Cyber Physical systems (CPS) connect the physical world with cyber world. The events happening in the real world is enormous and most of it go unnoticed and information is lost. CPS enables to embed tiny smart devices to capture the data and send it to Internet for further processing. The entire set-up call for lots of challenges and open new research problems. This talk is a journey through the landscape of research problems in this emerging area. |
| URI: | http://dyuthi.cusat.ac.in/purl/4151 |
| Files | Size |
|---|---|
| Research Directions in Cyber Physical Systems.pdf | (475.1Kb) |
| Abstract: | One of the major applications of underwater acoustic sensor networks (UWASN) is ocean environment monitoring. Employing data mules is an energy efficient way of data collection from the underwater sensor nodes in such a network. A data mule node such as an autonomous underwater vehicle (AUV) periodically visits the stationary nodes to download data. By conserving the power required for data transmission over long distances to a remote data sink, this approach extends the network life time. In this paper we propose a new MAC protocol to support a single mobile data mule node to collect the data sensed by the sensor nodes in periodic runs through the network. In this approach, the nodes need to perform only short distance, single hop transmission to the data mule. The protocol design discussed in this paper is motivated to support such an application. The proposed protocol is a hybrid protocol, which employs a combination of schedule based access among the stationary nodes along with handshake based access to support mobile data mules. The new protocol, RMAC-M is developed as an extension to the energy efficient MAC protocol R-MAC by extending the slot time of R-MAC to include a contention part for a hand shake based data transfer. The mobile node makes use of a beacon to signal its presence to all the nearby nodes, which can then hand-shake with the mobile node for data transfer. Simulation results show that the new protocol provides efficient support for a mobile data mule node while preserving the advantages of R-MAC such as energy efficiency and fairness. |
| Description: | PROCEEDINGS OF SYMPOL-2011 |
| URI: | http://dyuthi.cusat.ac.in/purl/4143 |
| Files | Size |
|---|---|
| RMAC-M Extendin ... mobile data mule node.pdf | (649.3Kb) |
| Abstract: | The recent trends envisage multi-standard architectures as a promising solution for the future wireless transceivers to attain higher system capacities and data rates. The computationally intensive decimation filter plays an important role in channel selection for multi-mode systems. An efficient reconfigurable implementation is a key to achieve low power consumption. To this end, this paper presents a dual-mode Residue Number System (RNS) based decimation filter which can be programmed for WCDMA and 802.16e standards. Decimation is done using multistage, multirate finite impulse response (FIR) filters. These FIR filters implemented in RNS domain offers high speed because of its carry free operation on smaller residues in parallel channels. Also, the FIR filters exhibit programmability to a selected standard by reconfiguring the hardware architecture. The total area is increased only by 24% to include WiMAX compared to a single mode WCDMA transceiver. In each mode, the unused parts of the overall architecture is powered down and bypassed to attain power saving. The performance of the proposed decimation filter in terms of critical path delay and area are tabulated. |
| Description: | Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE |
| URI: | http://dyuthi.cusat.ac.in/purl/3869 |
| Files | Size |
|---|---|
| RNS based Programmable Multi-mode Decimation.pdf | (293.6Kb) |
| Abstract: | In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum. |
| Description: | TENCON 2008-2008 IEEE Region 10 Conference |
| URI: | http://dyuthi.cusat.ac.in/purl/4136 |
| Files | Size |
|---|---|
| Routing Protoco ... reless Sensor Networks.pdf | (245.2Kb) |
| Abstract: | In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum. |
| Description: | TENCON 2008-2008 IEEE Region 10 Conference |
| URI: | http://dyuthi.cusat.ac.in/purl/3862 |
| Files | Size |
|---|---|
| Routing Protocol Enhancement for handling.pdf | (245.2Kb) |
| Abstract: | In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum. |
| URI: | http://dyuthi.cusat.ac.in/purl/4175 |
| Files | Size |
|---|---|
| Routing Protoco ... reless Sensor Networks.pdf | (246.2Kb) |
| Abstract: | The modern telecommunication industry demands higher capacity networks with high data rate. Orthogonal frequency division multiplexing (OFDM) is a promising technique for high data rate wireless communications at reasonable complexity in wireless channels. OFDM has been adopted for many types of wireless systems like wireless local area networks such as IEEE 802.11a, and digital audio/video broadcasting (DAB/DVB). The proposed research focuses on a concatenated coding scheme that improve the performance of OFDM based wireless communications. It uses a Redundant Residue Number System (RRNS) code as the outer code and a convolutional code as the inner code. The bit error rate (BER) performances of the proposed system under different channel conditions are investigated. These include the effect of additive white Gaussian noise (AWGN), multipath delay spread, peak power clipping and frame start synchronization error. The simulation results show that the proposed RRNS-Convolutional concatenated coding (RCCC) scheme provides significant improvement in the system performance by exploiting the inherent properties of RRNS. |
| Description: | Networks, 2008. ICON 2008. 16th IEEE International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/3878 |
| Files | Size |
|---|---|
| RRNS-Convolutio ... Wireless Communication.pdf | (714.9Kb) |
| Abstract: | Embedded systems, especially Wireless Sensor Nodes are highly prone to Type Safety and Memory Safety issues. Contiki, a prominent Operating System in the domain is even more affected by the problem since it makes extensive use of Type casts and Pointers. The work is an attempt to nullify the possibility of Safety violations in Contiki. We use a powerful, still efficient tool called Deputy to achieve this. We also try to automate the process |
| Description: | 2009 International Conference on Advances in Recent Technologies in Communication and Computing |
| URI: | http://dyuthi.cusat.ac.in/purl/4180 |
| Files | Size |
|---|---|
| Safe Contiki OS ... Safety for Contiki OS.pdf | (361.1Kb) |
| Abstract: | Embedded systems, especially Wireless Sensor Nodes are highly prone to Type Safety and Memory Safety issues. Contiki, a prominent Operating System in the domain is even more affected by the problem since it makes extensive use of Type casts and Pointers. The work is an attempt to nullify the possibility of Safety violations in Contiki. We use a powerful, still efficient tool called Deputy to achieve this. We also try to automate the process |
| Description: | 2009 International Conference on Advances in Recent Technologies in Communication and Computing |
| URI: | http://dyuthi.cusat.ac.in/purl/4144 |
| Files | Size |
|---|---|
| Safe Contiki OS ... Safety for Contiki OS.pdf | (360.9Kb) |
| Abstract: | An Overview of known spatial clustering algorithms The space of interest can be the two-dimensional abstraction of the surface of the earth or a man-made space like the layout of a VLSI design, a volume containing a model of the human brain, or another 3d-space representing the arrangement of chains of protein molecules. The data consists of geometric information and can be either discrete or continuous. The explicit location and extension of spatial objects define implicit relations of spatial neighborhood (such as topological, distance and direction relations) which are used by spatial data mining algorithms. Therefore, spatial data mining algorithms are required for spatial characterization and spatial trend analysis. Spatial data mining or knowledge discovery in spatial databases differs from regular data mining in analogous with the differences between non-spatial data and spatial data. The attributes of a spatial object stored in a database may be affected by the attributes of the spatial neighbors of that object. In addition, spatial location, and implicit information about the location of an object, may be exactly the information that can be extracted through spatial data mining |
| Description: | Asian Journal of Computer Science And Information Technology 3: 1 (2013) 1 - 8. |
| URI: | http://dyuthi.cusat.ac.in/purl/3901 |
| Files | Size |
|---|---|
| SPATIAL CLUSTERING ALGORITHMS-AN OVERVIEW..pdf | (483.4Kb) |
| Abstract: | The present work is an attempt to explain particle production in the early univese. We argue that nonzero values of the stress-energy tensor evaluated in squeezed vacuum state can be due to particle production and this supports the concept of particle production from zero-point quantum fluctuations. In the present calculation we use the squeezed coherent state introduced by Fan and Xiao [7]. The vacuum expectation values of stressenergy tensor defined prior to any dynamics in the background gravitational field give all information about particle production. Squeezing of the vacuum is achieved by means of the background gravitational field, which plays the role of a parametric amplifier [8]. The present calculation shows that the vacuum expectation value of the energy density and pressure contain terms in addition to the classical zero-point energy terms. The calculation of the particle production probability shows that the probability increases as the squeezing parameter increases, reaches a maximum value, and then decreases. |
| Description: | International Journal of Theoretical Physics, Vol. 39, No. 2, 2000 |
| URI: | http://dyuthi.cusat.ac.in/purl/4173 |
| Files | Size |
|---|---|
| Squeezed Cohere ... n in the EarlyUniverse.pdf | (75.28Kb) |
| Abstract: | The present work is an attempt to explain particle production in the early univese. We argue that nonzero values of the stress-energy tensor evaluated in squeezed vacuum state can be due to particle production and this supports the concept of particle production from zero-point quantum fluctuations. In the present calculation we use the squeezed coherent state introduced by Fan and Xiao [7]. The vacuum expectation values of stressenergy tensor defined prior to any dynamics in the background gravitational field give all information about particle production. Squeezing of the vacuum is achieved by means of the background gravitational field, which plays the role of a parametric amplifier [8]. The present calculation shows that the vacuum expectation value of the energy density and pressure contain terms in addition to the classical zero-point energy terms. The calculation of the particle production probability shows that the probability increases as the squeezing parameter increases, reaches a maximum value, and then decreases. |
| Description: | International Journal of Theoretical Physics, Vol. 39, No. 2, 2000 |
| URI: | http://dyuthi.cusat.ac.in/purl/4148 |
| Files | Size |
|---|---|
| Squeezed Cohere ... in the Early Universe.pdf | (75.28Kb) |
| Abstract: | As the popularity of digital videos increases, a large number illegal videos are being generated and getting published. Video copies are generated by performing various sorts of transformations on the original video data. For effectively identifying such illegal videos, the image features that are invariant to various transformations must be extracted for performing similarity matching. An image feature can be its local feature or global feature. Among them, local features are powerful and have been applied in a wide variety of computer vision aplications .This paper focuses on various recently proposed local detectors and descriptors that are invariant to a number of image transformations. |
| Description: | International Journal of Scientific & Engineering Research, Volume 4, Issue 9, september 2013 |
| URI: | http://dyuthi.cusat.ac.in/purl/4319 |
| Files | Size |
|---|---|
| State-of-the-Ar ... Invariant Descriptors.pdf | (1.365Mb) |
| Abstract: | This paper proposes a content based image retrieval (CBIR) system using the local colour and texture features of selected image sub-blocks and global colour and shape features of the image. The image sub-blocks are roughly identified by segmenting the image into partitions of different configuration, finding the edge density in each partition using edge thresholding, morphological dilation. The colour and texture features of the identified regions are computed from the histograms of the quantized HSV colour space and Gray Level Co- occurrence Matrix (GLCM) respectively. A combined colour and texture feature vector is computed for each region. The shape features are computed from the Edge Histogram Descriptor (EHD). A modified Integrated Region Matching (IRM) algorithm is used for finding the minimum distance between the sub-blocks of the query and target image. Experimental results show that the proposed method provides better retrieving result than retrieval using some of the existing methods |
| Description: | International Journal of Computer Science Issues (IJCSI) |
| URI: | http://dyuthi.cusat.ac.in/purl/3887 |
| Files | Size |
|---|---|
| A Sub-block Bas ... grated Region Matching.pdf | (443.6Kb) |
| Abstract: | Due to the emergence of multiple language support on the Internet, machine translation (MT) technologies are indispensable to the communication between speakers using different languages. Recent research works have started to explore tree-based machine translation systems with syntactical and morphological information. This work aims the development of Syntactic Based Machine Translation from English to Malayalam by adding different case information during translation. The system identifies general rules for various sentence patterns in English. These rules are generated using the Parts Of Speech (POS) tag information of the texts. Word Reordering based on the Syntax Tree is used to improve the translation quality of the system. The system used Bilingual English –Malayalam dictionary for translation. |
| Description: | 2012 International Conference on Data Science & Engineering (ICDSE) |
| URI: | http://dyuthi.cusat.ac.in/purl/4108 |
| Files | Size |
|---|---|
| Syntactic Based ... m English to Malayalam.pdf | (134.8Kb) |
| Abstract: | In Statistical Machine Translation from English to Malayalam, an unseen English sentence is translated into its equivalent Malayalam translation using statistical models like translation model, language model and a decoder. A parallel corpus of English-Malayalam is used in the training phase. Word to word alignments has to be set up among the sentence pairs of the source and target language before subjecting them for training. This paper is deals with the techniques which can be adopted for improving the alignment model of SMT. Incorporating the parts of speech information into the bilingual corpus has eliminated many of the insignificant alignments. Also identifying the name entities and cognates present in the sentence pairs has proved to be advantageous while setting up the alignments. Moreover, reduction of the unwanted alignments has brought in better training results. Experiments conducted on a sample corpus have generated reasonably good Malayalam translations and the results are verified with F measure, BLEU and WER evaluation metrics |
| URI: | http://dyuthi.cusat.ac.in/purl/4187 |
| Files | Size |
|---|---|
| Techniques to I ... m English to Malayalam.pdf | (368.5Kb) |
| Abstract: | Page 1. Towards Web 3.0... • Web 1.0 • Web 2.0 • Web 3.0 • Technology hype? • Internet as seen by our kids? Page 2. Random Trivia: Brazil has more Orkut users than citizens Page 3. The war is over. Platforms have won. Applications have lost Page 4. Page 5. Blogosphere • The blogosphere is made up of all blogs and their interconnections Page 6. Social bookmarking Page 7. Page 8. Page 9. Page 10. Page 11. Page 12. Page 13. Page 14. Towards Web 3.0 Page 15. Page 16. Wolfram Alpha Page 17. Page 18. Page 19. Page 20. Page 21. Page 22 |
| URI: | http://dyuthi.cusat.ac.in/purl/4171 |
| Files | Size |
|---|---|
| Towards Web 3.0....pdf | (2.563Mb) |
| Abstract: | Extensive use of the Internet coupled with the marvelous growth in e-commerce and m-commerce has created a huge demand for information security. The Secure Socket Layer (SSL) protocol is the most widely used security protocol in the Internet which meets this demand. It provides protection against eaves droppings, tampering and forgery. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL. But recent attacks against RC4 and HMAC have raised questions in the confidence on these algorithms. Hence two novel cryptographic algorithms MAJE4 and MACJER-320 have been proposed as substitutes for them. The focus of this work is to demonstrate the performance of these new algorithms and suggest them as dependable alternatives to satisfy the need of security services in SSL. The performance evaluation has been done by using practical implementation method. |
| URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2077 |
| Files | Size |
|---|---|
| Use of novel algorithms MAJE4 and MACJER-320...pdf | (326.2Kb) |
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.