| Abstract: | This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications |
| Description: | International Journal of Computer Science and Applications, Vol. 5, No. 4, pp 11 - 25, 2008 |
| URI: | http://dyuthi.cusat.ac.in/purl/4021 |
| Files | Size |
|---|---|
| Jerim-320 A New ... With Parallel Branches.pdf | (96.80Kb) |
| Abstract: | Cooperative caching in mobile ad hoc networks aims at improving the efficiency of information access by reducing access latency and bandwidth usage. Cache replacement policy plays a vital role in improving the performance of a cache in a mobile node since it has limited memory. In this paper we propose a new key based cache replacement policy called E-LRU for cooperative caching in ad hoc networks. The proposed scheme for replacement considers the time interval between the recent references, size and consistency as key factors for replacement. Simulation study shows that the proposed replacement policy can significantly improve the cache performance in terms of cache hit ratio and query delay |
| Description: | Advance Computing Conference (IACC), 2013 IEEE 3rd International |
| URI: | http://dyuthi.cusat.ac.in/purl/3885 |
| Files | Size |
|---|---|
| A key based cac ... mobile ad hoc networks.pdf | (177.3Kb) |
| Abstract: | On-line handwriting recognition has been a frontier area of research for the last few decades under the purview of pattern recognition. Word processing turns to be a vexing experience even if it is with the assistance of an alphanumeric keyboard in Indian languages. A natural solution for this problem is offered through online character recognition. There is abundant literature on the handwriting recognition of western, Chinese and Japanese scripts, but there are very few related to the recognition of Indic script such as Malayalam. This paper presents an efficient Online Handwritten character Recognition System for Malayalam Characters (OHR-M) using K-NN algorithm. It would help in recognizing Malayalam text entered using pen-like devices. A novel feature extraction method, a combination of time domain features and dynamic representation of writing direction along with its curvature is used for recognizing Malayalam characters. This writer independent system gives an excellent accuracy of 98.125% with recognition time of 15-30 milliseconds |
| Description: | 2010 First International Conference on Integrated Intelligent Computing |
| URI: | http://dyuthi.cusat.ac.in/purl/4095 |
| Files | Size |
|---|---|
| k-NN based On-L ... cterrecognition system.pdf | (577.8Kb) |
| Abstract: | Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies |
| Description: | Advanced Infocomm Technology (ICAIT), 2013 6th International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/3900 |
| Files | Size |
|---|---|
| A Location Aide ... Mobile Ad hoc Networks.pdf | (254.6Kb) |
| Abstract: | The focus of this work is to provide authentication and confidentiality of messages in a swift and cost effective manner to suit the fast growing Internet applications. A nested hash function with lower computational and storage demands is designed with a view to providing authentication as also to encrypt the message as well as the hash code using a fast stream cipher MAJE4 with a variable key size of 128-bit or 256-bit for achieving confidentiality. Both nested Hash function and MAJE4 stream cipher algorithm use primitive computational operators commonly found in microprocessors; this makes the method simple and fast to implement both in hardware and software. Since the memory requirement is less, it can be used for handheld devices for security purposes. |
| Description: | Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/3881 |
| Files | Size |
|---|---|
| Message Integri ... d a Fast Stream Cipher.pdf | (1.288Mb) |
| Abstract: | MicroRNAs are short non-coding RNAs that can regulate gene expression during various crucial cell processes such as differentiation, proliferation and apoptosis. Changes in expression profiles of miRNA play an important role in the development of many cancers, including CRC. Therefore, the identification of cancer related miRNAs and their target genes are important for cancer biology research. In this paper, we applied TSK-type recurrent neural fuzzy network (TRNFN) to infer miRNA–mRNA association network from paired miRNA, mRNA expression profiles of CRC patients. We demonstrated that the method we proposed achieved good performance in recovering known experimentally verified miRNA–mRNA associations. Moreover, our approach proved successful in identifying 17 validated cancer miRNAs which are directly involved in the CRC related pathways. Targeting such miRNAs may help not only to prevent the recurrence of disease but also to control the growth of advanced metastatic tumors. Our regulatory modules provide valuable insights into the pathogenesis of cancer |
| Description: | Gene 515 (2013) 385–390 |
| URI: | http://dyuthi.cusat.ac.in/purl/4097 |
| Files | Size |
|---|---|
| MicroRNA–mRNA i ... t neural fuzzy network.pdf | (862.0Kb) |
| Abstract: | Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol. |
| Description: | ADCOM 2008 |
| URI: | http://dyuthi.cusat.ac.in/purl/3857 |
| Files | Size |
|---|---|
| Mobility Metric based LEACH-Mobile Protocol.pdf | (272.3Kb) |
| Abstract: | Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol. |
| Description: | Advanced Computing and Communications, 2008. ADCOM 2008. 16th International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/4135 |
| Files | Size |
|---|---|
| Mobility Metric based LEACH-Mobile Protocol.pdf | (272.3Kb) |
| Abstract: | In Safety critical software failure can have a high price. Such software should be free of errors before it is put into operation. Application of formal methods in the Software Development Life Cycle helps to ensure that the software for safety critical missions are ultra reliable. PVS theorem prover, a formal method tool, can be used for the formal verification of software in ADA Language for Flight Software Application (ALFA.). This paper describes the modeling of ALFA programs for PVS theorem prover. An ALFA2PVS translator is developed which automatically converts the software in ALFA to PVS specification. By this approach the software can be verified formally with respect to underflow/overflow errors and divide by zero conditions without the actual execution of the code. |
| Description: | 2009 International Conference on Advances in Recent Technologies in Communication and Computing |
| URI: | http://dyuthi.cusat.ac.in/purl/4147 |
| Files | Size |
|---|---|
| Modeling of ALF ... ing PVS Theorem Prover.pdf | (395.4Kb) |
| Abstract: | In Safety critical software failure can have a high price. Such software should be free of errors before it is put into operation. Application of formal methods in the Software Development Life Cycle helps to ensure that the software for safety critical missions are ultra reliable. PVS theorem prover, a formal method tool, can be used for the formal verification of software in ADA Language for Flight Software Application (ALFA.). This paper describes the modeling of ALFA programs for PVS theorem prover. An ALFA2PVS translator is developed which automatically converts the software in ALFA to PVS specification. By this approach the software can be verified formally with respect to underflow/overflow errors and divide by zero conditions without the actual execution of the code |
| Description: | 2009 International Conference on Advances in Recent Technologies in Communication and Computing |
| URI: | http://dyuthi.cusat.ac.in/purl/4179 |
| Files | Size |
|---|---|
| Modeling of ALF ... ing PVS Theorem Prover.pdf | (395.1Kb) |
| Abstract: | Diagnosis of Hridroga (cardiac disorders) in Ayurveda requires the combination of many different types of data, including personal details, patient symptoms, patient histories, general examination results, Ashtavidha pareeksha results etc. Computer-assisted decision support systems must be able to combine these data types into a seamless system. Intelligent agents, an approach that has been used chiefly in business applications, is used in medical diagnosis in this case. This paper is about a multi-agent system named “Distributed Ayurvedic Diagnosis and Therapy System for Hridroga using Agents” (DADTSHUA). It describes the architecture of the DADTSHUA model .This system is using mobile agents and ontology for passing data through the network. Due to this, transport delay can be minimized. It is a system which will be very helpful for the beginning physicians to eliminate his ambiguity in diagnosis and therapy. The system is implemented using Java Agent DEvelopment framework (JADE), which is a java-complaint mobile agent platform from TILab. |
| Description: | 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009) |
| URI: | http://dyuthi.cusat.ac.in/purl/4101 |
| Files | Size |
|---|---|
| A model of Dist ... r HridrogaUsing Agents.pdf | (269.1Kb) |
| Abstract: | This paper presents methods for moving object detection in airborne video surveillance. The motion segmentation in the above scenario is usually difficult because of small size of the object, motion of camera, and inconsistency in detected object shape etc. Here we present a motion segmentation system for moving camera video, based on background subtraction. An adaptive background building is used to take advantage of creation of background based on most recent frame. Our proposed system suggests CPU efficient alternative for conventional batch processing based background subtraction systems. We further refine the segmented motion by meanshift based mode association. |
| Description: | IADIS International Conference Computer Graphics and Visualization 2008 |
| URI: | http://dyuthi.cusat.ac.in/purl/4174 |
| Files | Size |
|---|---|
| Motion Segmenta ... ent For Airborne Video.pdf | (234.0Kb) |
| Abstract: | The goal of this work was developing a query processing system using software agents. Open Agent Architecture framework is used for system development. The system supports queries in both Hindi and Malayalam; two prominent regional languages of India. Natural language processing techniques are used for meaning extraction from the plain query and information from database is given back to the user in his native language. The system architecture is designed in a structured way that it can be adapted to other regional languages of India. . This system can be effectively used in application areas like e-governance, agriculture, rural health, education, national resource planning, disaster management, information kiosks etc where people from all walks of life are involved. |
| URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2079 |
| Files | Size |
|---|---|
| A multilingual query processing system ...pdf | (356.2Kb) |
| Abstract: | A new fast stream cipher, MAJE4 is designed and developed with a variable key size of 128-bit or 256-bit. The randomness property of the stream cipher is analysed by using the statistical tests. The performance evaluation of the stream cipher is done in comparison with another fast stream cipher called JEROBOAM. The focus is to generate a long unpredictable key stream with better performance, which can be used for cryptographic applications. |
| Description: | INDICON, 2005 Annual IEEE |
| URI: | http://dyuthi.cusat.ac.in/purl/3865 |
| Files | Size |
|---|---|
| A New Fast Stream Cipher MAJE4.pdf | (1.449Mb) |
| Abstract: | Reversibility plays a fundamental role when logic gates such as AND, OR, and XOR are not reversible. computations with minimal energy dissipation are considered. Hence, these gates dissipate heat and may reduce the life of In recent years, reversible logic has emerged as one of the most the circuit. So, reversible logic is in demand in power aware important approaches for power optimization with its circuits. application in low power CMOS, quantum computing and A reversible conventional BCD adder was proposed in using conventional reversible gates. |
| Description: | System-on-Chip, 2007 International Symposium on |
| URI: | http://dyuthi.cusat.ac.in/purl/3863 |
| Files | Size |
|---|---|
| A new look at r ... ation of decimal adder.pdf | (344.1Kb) |
| Abstract: | Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the mobile clients while retrieving data and to reduce the traffic load in the network. Caching also increases the availability of data due to server disconnections. The implementation of a cooperative caching technique essentially involves four major design considerations (i) cache placement and resolution, which decides where to place and how to locate the cached data (ii) Cache admission control which decides the data to be cached (iii) Cache replacement which makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e. maintaining consistency between the data in server and cache. In this paper we propose an effective cache resolution technique, which reduces the number of messages flooded in to the network to find the requested data. The experimental results gives a promising result based on the metrics of studies. |
| Description: | David C. Wyld (Eds) : ICCSEA, SPPR, CSIA, WimoA - 2013 pp. 203–209, 2013. © CS & IT-CSCP 2013 |
| URI: | http://dyuthi.cusat.ac.in/purl/3886 |
| Files | Size |
|---|---|
| A Novel Cache R ... reless Mobile Networks.pdf | (130.7Kb) |
| Abstract: | Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining |
| Description: | International Journal of Advanced Computing, ISSN:2051-0845, Vol.36, Issue.1 |
| URI: | http://dyuthi.cusat.ac.in/purl/4105 |
| Files | Size |
|---|---|
| A Novel Decisio ... c Datasets - C 4.5Stat.pdf | (183.3Kb) |
| Abstract: | A novel and fast technique for cryptographic applications is designed and developed using the symmetric key algorithm “MAJE4” and the popular asymmetric key algorithm “RSA”. The MAJE4 algorithm is used for encryption / decryption of files since it is much faster and occupies less memory than RSA. The RSA algorithm is used to solve the problem of key exchange as well as to accomplish scalability and message authentication. The focus is to develop a new hybrid system called MARS4 by combining the two cryptographic methods with an aim to get the advantages of both. The performance evaluation of MARS4 is done in comparison with MAJE4 and RSA. |
| Description: | India Conference, 2006 Annual IEEE |
| URI: | http://dyuthi.cusat.ac.in/purl/3909 |
| Files | Size |
|---|---|
| A Novel Fast Hybrid Cryptographic System MARS4.pdf | (191.8Kb) |
| Abstract: | Animportant step in the residue number system(RNS) based signal processing is the conversion of signal into residue domain. Many implementations of this conversion have been proposed for various goals, and one of the implementations is by a direct conversion from an analogue input. A novel approach for analogue-to-residue conversion is proposed in this research using the most popular Sigma–Delta analogue-to-digital converter (SD-ADC). In this approach, the front end is the same as in traditional SD-ADC that uses Sigma–Delta (SD) modulator with appropriate dynamic range, but the filtering is doneby a filter implemented usingRNSarithmetic. Hence, the natural output of the filter is an RNS representation of the input signal. The resolution, conversion speed, hardware complexity and cost of implementation of the proposed SD based analogue-to-residue converter are compared with the existing analogue-to-residue converters based on Nyquist rate ADCs |
| Description: | International Journal of Electronics Vol. 96, No. 6, June 2009, 571–583 |
| URI: | http://dyuthi.cusat.ac.in/purl/4020 |
| Files | Size |
|---|---|
| A novel Sigma–D ... e-to-residue converter.pdf | (707.5Kb) |
| Abstract: | Coded OFDM is a transmission technique that is used in many practical communication systems. In a coded OFDM system, source data are coded, interleaved and multiplexed for transmission over many frequency sub-channels. In a conventional coded OFDM system, the transmission power of each subcarrier is the same regardless of the channel condition. However, some subcarrier can suffer deep fading with multi-paths and the power allocated to the faded subcarrier is likely to be wasted. In this paper, we compute the FER and BER bounds of a coded OFDM system given as convex functions for a given channel coder, inter-leaver and channel response. The power optimization is shown to be a convex optimization problem that can be solved numerically with great efficiency. With the proposed power optimization scheme, near-optimum power allocation for a given coded OFDM system and channel response to minimize FER or BER under a constant transmission power constraint is obtained |
| Description: | International Journal of Scientific and Research Publications, Volume 4, Issue 1, January 2014 |
| URI: | http://dyuthi.cusat.ac.in/purl/4186 |
| Files | Size |
|---|---|
| A Numerically e ... nimum frame error rate.pdf | (208.4Kb) |
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.