Refine your search
Collections
Co-Authors
Journals
- Indian Journal of Science and Technology
- Indian Journal of Advances in Computer Sciences and Technology
- National Journal of System and Information Technology
- Wireless Communication
- Software Engineering
- Programmable Device Circuits and Systems
- Digital Signal Processing
- Automation and Autonomous Systems
- ICTACT Journal on Soft Computing
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ravi, T.
- Dynamic Channel Allocation for Multipath Cellular Networks Using MSWF in Wireless Network
Abstract Views :410 |
PDF Views:102
Authors
P. Jesu Jayarin
1,
T. Ravi
2
Affiliations
1 CSE Department, Sathyabama University, Chennai-600119, IN
2 Department of CSE, KCG College of Technology, Chennai-600097, IN
1 CSE Department, Sathyabama University, Chennai-600119, IN
2 Department of CSE, KCG College of Technology, Chennai-600097, IN
Source
Indian Journal of Science and Technology, Vol 3, No 12 (2010), Pagination: 1202-1207Abstract
In multi-hop cellular networks, a channel that contributes the lowest relaying delay is proposed to the current node on the path. The current node itself does not receiving on the time-slot of the proposed channel that enhance the capacity and coverage problems of cellular networks. They also allow faster and cheaper deployment of cellular networks. A fundamental issue of these networks is packet delay because multi-hop relaying for signals is involved. An effective channel assignment is the key for the reducing delay. It proposes an optimal and a heuristic channel assignment scheme, called OCA and minimum slot waiting first (MSWF) respectively, for a time division duplex (TDD) wideband code division multiple access (W-CDMA) MCN. OCA provides an optimal solution in minimizing packet delay and can be used as an unbiased or benchmark tool for comparison among different network conditions or networking schemes. However, OCA is computationally expensive and thus, inefficient for large real-time channel assignment problem. In this case, MSWF is more appropriate. Simulation results show that MSWF achieves on average 95% of the delay performance of OCA and is effective in achieving high throughput and low packet delay in conditions of different cell sizes. For improving more on quality of service we can propose channel reuse. Using FDMA and TDMA we can reuse the channels. The novel feature of the proposed technique is that co-coordinated, prioritized TDMA is supported for clusters of access points (AP's) using measurement based time slot assignments.Keywords
Cellular Network, MSWF, CSMA, OCA, Channel AssignmentFull Text
References
- Aggelou GN and Tafazolli R (2001) On the relaying capacity of next generation GSM cellular networks. IEEE Personal Comm. 8(1), 40-47.
- Al-Ayyoub M and Gupta H (2010) Joint routing, channel assignment and scheduling for throughput maximization in general interference models. IEEE Trans. Mobile Computing. 9(4), 553-565.
- Al-Riyami M, Safwat AM and Hassanein HS (2005) Channel assignment in Multi-Hop TDD W-CDMA cellular networks. Proc. IEEE Intl. Conf. Comm. (ICC ’05). pp: 428-1432.
- Bre´laz D (1979) New methods to colour the vertices of a graph. Comm. ACM. 22(4), 251-256.
- Chafekar D and Maratge M (2008) Approximation algorithm for computing capacity of wireless networks with SINR constraints. Proc. IEEE INFOCOM.
- De S, Tonguz O, Wu H and Qiao C (2002) Integrated cellular and ad hoc relay (iCAR) systems: Pushing the performance limits of conventional wireless networks. Proc. IEEE Hawaii, Int. Conf. System Sci. (HICSS ’02), pp: 3899-3906.
- Fu X, Bourgeois AG, Fan P and Pan Y (2006) Using a genetic algorithm approach to solve the dynamic channel-assignment problem. Int. J. Mobile Comm. 4(3), 333-353.
- Holma H and Toskala A (2004) WCDMA for UMTS, radio access for third generation mobile communications. 3rd ed. John Wiley & Sons.
- Li XJ and Chong PHJ (2008) A dynamic channel assignment scheme for TDMA-based Multi-hop cellular networks. IEEE Trans. Wireless Comm. 7(6), 1999-2003.
- Li XJ and Chong PHJ (2010) Performance analysis of Multi-hop cellular network with fixed channel assignment. Wireless Networks. 16, 511-526.
- Li XJ, Seet BC and Chong PHJ (2008) Multi-hop cellular networks: Technology and economics. Computer Networks. 52, (9), 1825-1837.
- Lin YD and Hsu YC (2000) Multihop cellular: A new architecture for wireless communications. Proc. IEEE INFOCOM. pp: 1273-1282.
- Noor L and Anpalagan A (2004) Dynamic channel allocation in TDD-CDMA systems. IEEE Canadian Rev. pp:9-11.
- Third generation partnership project (3GPP) (1999) Technical specification group radio access network. Opportunity driven multiple access (ODMA), Sophia Antipolis, Valbbonne (3G TR 25.924 Version 1.0.0).
- An Optimal Technique for Reducing the Effort of Regression Test
Abstract Views :478 |
PDF Views:0
Authors
T. Prem Jacob
1,
T. Ravi
2
Affiliations
1 Sathyabama University, Chennai-119, IN
2 Principal, Srinivasa Institute of Engineering & Technology, Chennai- 56, IN
1 Sathyabama University, Chennai-119, IN
2 Principal, Srinivasa Institute of Engineering & Technology, Chennai- 56, IN
Source
Indian Journal of Science and Technology, Vol 6, No 8 (2013), Pagination: 5065-5069Abstract
Regression test selection techniques are proposed often but are many times inaccurate when used with larger systems. The proposed new selection technique will be safer, more precise, and can handle the object-oriented features even in larger systems through its phases. Selecting the subset of the test case from the existing test suite is an important problem in regression testing and is addressed in the regression test selection technique. Safe regression test selection technique selects and identifies the program parts that are affected by the change. The test selection is performed by matching the identified change information with the coverage information. A tool is implemented that reduces the testing effort efficiently and the result shows that it can achieve considerable savings in the regression testing time.Keywords
Test Selection, Testing, Software Maintenance, Regression Testing, Software EvaluationFull Text
References
- Rothermel G, Untch R H et al. (1999). Test case prioritization: an empirical study, Proceedings of the International Conference on Software Maintenance, 179–188.
- Jacob T P (2013). Regression testing: Tabu search technique for code coverage, Indian Journal of Computer Science and Engineering, vol 4, No.3, 208–215.
- Elbaum S, Rothermel G et al. (2004). Selecting a cost-effective test case prioritization technique, Software Quality Control, vol 12, No. 3, 185–210.
- Jacob T P, and Ravi T (2013). Optimal regression test case prioritization using genetic algorithm, Life Science Journal, vol 10(3), 1021–1033.
- Rothermel G, and Harrold M J (1997). A safe, efficient regression test selection technique. ACM TOSEM, vol 6(2), 173–210.
- Bible J, Rothermel G et al. (2001). A comparative study of coarse and fine-grained safe regression test selection techniques. ACM TOSEM, vol 10(2), 149–183.
- Walcott K R, Soffa M L et al. (2006). Time-aware test suite prioritization, International Symposium on Software Testing and Analysis, 1–11.
- Do H, Elbaum S G et al. (2005). Supporting controlled experimentation with testing techniques: an infrastructure and its potential impact, Empirical Software Engineering, vol 10(4), 405–435.
- Li Z, Harman M et al. (2007). Search algorithm for regression test case prioritization, IEEE Transactions on Software Engineering, vol 33, No. 4, 5–7.
- Jeffrey D, and Gupta N (2007). Improving fault detection capability by selectively retaining test cases during test suite reduction, IEEE Transactions on software Engineering, vol 33, No. 2, 122–127.
- Li Z, Harman M et al. (2007). Search algorithms for regression test case prioritization, IEEE Transactions on Software Engineering, vol 33, No. 4, 225–237.
- Kim J M, and Porter A (2002). A history-based test prioritization technique for regression testing in resource constrained environments, Proceedings of the 24th International Conference on Software Engineering, 119–129.
- A Novel Approach for Test Suite Prioritization using Clustering
Abstract Views :561 |
PDF Views:0
Authors
T. Prem Jacob
1,
T. Ravi
2
Affiliations
1 CSE, Sathyabama University, Chennai, IN
2 Srinivasa Institute of Engineering & Technology, Chennai, IN
1 CSE, Sathyabama University, Chennai, IN
2 Srinivasa Institute of Engineering & Technology, Chennai, IN
Source
Indian Journal of Advances in Computer Sciences and Technology, Vol 1, No 1 (2013), Pagination: 59-66Abstract
Software testing is an expensive, time consuming and important part of the software development life cycle. In testing the time is spend mainly for generating test cases and to test them. The test case prioritization will reduce the testing effort. Different techniques for test case prioritization are proposed in the past decades and still requires further improvement. The clustering based test case prioritization is proposed in this paper. The results achieved shows that prioritization of the test case has improved the effectiveness of the test case.Keywords
Test Case, Test Suite, Cluster, APFD
References
- Islam, M.M , A tool for the prioritization of test cases based on a sorting genetic algorithm and La-tent Semantic Indexing Software Maintenance (ICSM), 2012.
- Smith(2009). An empirical study of incorporating cost into test suite reduction and prioritization. In Proceedings of the 24th Symposium on Applied Computing, 2009.
- T.Prem Jacob et al.(2013), Detecting of Software Source Code Defects using Test Case Prioritization Rules, 2nd International Conference on Latest Computational Technologies.
- Zhong(2008). An experimental study of four typical test suite reduction techniques. Information and Software Technology, 50(6).
- Sampath(2008). Prioritizing user-session-based test cases for web applications testing. In Proceedings of the 2nd International Conference on Software Testing, Verification, and Validation.
- T.Prem Jacob. et al.(2013), Regression Testing : Tabu Search Technique for Code Coverage, Indian Journal of Computer Science and Engineering, Vol. 4 No.3.
- Kapfhammer(2007). A Comprehensive Framework for Testing Database- Centric Applications. PhD thesis, University of Pittsburgh, Pittsburgh, Pennsylvania.
- Semantics Guided Regression Test Cost Reduction David Binkley, Loyola College in Maryland.
- Prioritizing Test Cases For Regression Testing Gregg Rothermel, Member IEEE Computer Society, Roland H. Untch, Member, IEEE Computer Society, Chengyun Chu, and Mary Jean Harrold, Member, IEEE Computer Society.
- G. Rothermel,(1996), Analyzing the regression test selection techniques. IEEE Trans. Softw. Eng., 22(8):529–551.
- O. Strichman (2008) Regression Verification – A Practical Way to Verify Programs. Springer-Verlag, Berlin,Heidelberg.
- R. H. Hardin et al.(1996) Efficient regression verification. In Proc. WODES, pages 147–150.
- Channel Sharing Scheme for Cellular Networks Using MDDCA Protocol in WLAN
Abstract Views :304 |
PDF Views:2
Authors
Source
National Journal of System and Information Technology, Vol 3, No 1 (2010), Pagination: 59-69Abstract
In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another cell, to provide uninterrupted service, the new cell should have enough channels to support the ongoing communication of the mobile hosts that moved into the cell. If channels are statically allocated, a cell may run out of channels when large number of mobile hosts moves to a cell, thus degrading the quality of service. To overcome this problem, dynamic channel allocation approaches have been proposed which allocate channels to cells on demand, thus increasing channel utilization and hence improving the quality of service. A distributed dynamic channel allocation algorithms gained a lot of attention due to their high reliability and scalability. The cell that wants to borrow a channel has to wait for replies from all its interference neighbors and hence, is not fault-tolerant. This work aims to propose a Distributed dynamic channel allocation algorithm to make use of the available channel efficiently. It can tolerate the failure of mobile nodes as well as static nodes and enhance the quality of service by making efficient reuse of channels. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.References
- Agrawal, D., Zeng, Q.-A., 2003. Introduction to Wireless and Mobile Systems, first ed.Thomson Asia Pvt. Ltd., Singapore.
- Bedell, P., 2002. Wireless Crash Course, second ed. Tata McGraw-Hill, New York.
- Boukerche, A., Huang, T., Abrougui, K., Williams, J., 2005. A fault-tolerant dynamic channel allocation protocol for cellular networks. In: IEEE International Conference on Wireless Networks, Communications and Mobile Computing,pp. 342–347.
- Boukerche, A., Huang, T., Abrougui, K., 2005. Design and performance evaluation of a QoS-based dynamic channel allocation protocol for wireless and mobile networks. In: 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 445–452.
- Chen, S.L., Chong, P., 2004. Dynamic channel assignment with flexible reuse partitioning in cellular systems. In: IEEE International Conference on Communications, vol. 7, pp. 4275–4279.
- ]Garg, V., Wilkes, J., 2003. Principles and Applications of GSM, second ed. Pearson Education.Kahwa, T.J., Georganas, N.D., 1978. A hybrid channel assignment scheme in largescale cellular-structured mobile communication systems. IEEE Transactions on Communications COM-26 (4), 432–438.
- Katzela, I., Naghshineh, M., 1996. Channel assignment schemes for cellular mobile telecommunication systems.
- Kim, S., Chang, K., 1994. Optimal channel allocation for cellular mobile systems with nonuniform traffic distribution. Information Systems and Operational Research 32, 202–213.
- Wang, J., Zeng, Q.-A., Agrawal, D.P., 2001. Performance analysis of integrated wireless mobile networks with queuing handoff scheme. In: Proceedings of GLOBECOM 2001.
- A Novel 8 Bit Digital Comparator for 3x3 Fixed Kernel Based Modified Shear Sorting
Abstract Views :303 |
PDF Views:0
Authors
Affiliations
1 Department of E.E.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
2 Department of E.C.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
1 Department of E.E.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
2 Department of E.C.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 7, No 4 (2014), Pagination: 452-462Abstract
The need for an optimized area, speed and power plays a vital role for any median filter is good at removing impulse noise without degrading the image details. The main operation of the median is Rank ordering. It is a computationally complex operation, so it is hard to implement it in real time. This paper introduces a new sorting technique called for Snake like sorting. The proposed Sorting technique is implemented as a parallel architecture. This algorithm is a Mesh based sorting that require less number of comparators for rank ordering. The proposed architecture is compared with other Rank Ordering algorithm on the basis of power, speed, and area and found to exhibit good results. The proposed architecture is implemented on parallel and pipelined schemes and is targeted for Spartan 3e Device with gate capacity 5000 using Xilinx 7.1i compiler version. The pipelined scheme has an operating frequency of 81 Mhz occupying 283 slices with a gate count of 5,640.Keywords
Borrow Look Ahead Select Comparator, Median Filter, Modified Shear Sorting, Salt And Pepper NoiseFull Text
- Channel Assignment Scheme for Reusability Technique Using Prioritized Algorithm
Abstract Views :186 |
PDF Views:1
Authors
P. Jesu Jayarin
1,
T. Ravi
2
Affiliations
1 Sathyabama University, Chennai-119
2 Department of CSE, KCG College of Technology, Chennai, IN
1 Sathyabama University, Chennai-119
2 Department of CSE, KCG College of Technology, Chennai, IN
Source
Wireless Communication, Vol 3, No 6 (2011), Pagination: 440-445Abstract
In this paper we use the randomized algorithm for solving the channel allocation problem in the network. Minimum Slot Waiting First (MSWF) is used for overcome the problem which is caused by randomized algorithm, where the node whose is not first prioritized because it allocates the channel randomly. By using channel reuse technique we can improve the quality of service. Then we reuse the channel by using the given methods FDMA and TDMA.Here we propose an optimal channel allocation scheme which can give the best performance for improving the Quality of service and throughput. By using the given technique multihop cooperative transmission, the system throughput can be improved. The multiple expand path links reduces outage probability. Channel allocation architecture provides better reliability and maintains cell capacity for high bandwidth using throughput values. The channel assignment problem in a class of wireless cellular networks form as such regular grids which can be obtained by adding two edges to connect two pair of diagonal vertices of every square cell in the square grids. Simulation results show that allocation algorithm is effective to improve the bandwidth efficiency of the networks.Keywords
Channel Allocation, Frequency Reuse, MSWF and Throughput Calculation.- An Efficient Method for Regression Test Selection
Abstract Views :157 |
PDF Views:3
Authors
T. Prem Jacob
1,
T. Ravi
2
Affiliations
1 Sathyabama University, Research Scholar, Chennai, IN
2 Srinivasa Institute of Engineering & Technology, Chennai, IN
1 Sathyabama University, Research Scholar, Chennai, IN
2 Srinivasa Institute of Engineering & Technology, Chennai, IN
Source
Software Engineering, Vol 5, No 6 (2013), Pagination: 218-222Abstract
Regression technique which is an expensive and necessary activity used to show that the code was not affected by the change that has been made. However the software is well written and well conceived there will be inevitable change that may occur in it. Repairs have to be made if the operational failures may expose the faults. Major reason for the software product for rework is due to the changed and mistaken requirements. The new use for the old software product yields the new functionality that is not conceived originally at the requirement. This management for the change will be critical for continuing the utility of the software product. Regression testing is testing the software in order to make sure that the modification made on the program lines does not affect the other parts of the software, it is in maintenance phase and accounts for 75% of the maintenance cost and thus optimizing regression testing is one of the prime motives of software testers. Regression testing that reuses the tests from the test suite that exists to test the program which has been modified .The regression testing is performed to ensure the changes that has been made due to adding new functionality and fixing the bugs in the modified software have not affected the functionality that is inherited to the earlier version. The issues that are relevant to the selective retest approach are outlined in this paper and for evaluating these approaches we present an efficient framework.Keywords
Regression Testing, Test Case, Algorithms.- Design and Analysis of N-Type CNTFET Single Edge Triggered D Flip-Flop Based Shift Registers
Abstract Views :181 |
PDF Views:2
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu-600119, IN
2 Department of VLSI Design, Sathyabama University, Chennai, Tamilnadu, 600119, IN
1 Sathyabama University, Chennai, Tamilnadu-600119, IN
2 Department of VLSI Design, Sathyabama University, Chennai, Tamilnadu, 600119, IN
Source
Programmable Device Circuits and Systems, Vol 3, No 9 (2011), Pagination: 475-480Abstract
This paper enumerates the efficient design and analysis of shift registers like Serial in serial out (SISO), Serial in Parallel out (SIPO), Parallel in parallel out (PIPO), Parallel in serial out (PISO) using N-type CNTFET Single Edge Triggered D Flip-flop. The Flip flop is designed using Ballistic CNTFET (VHDL-AMS model) with the diameter of cnt is 1nm in resistive load inverter logic. There are many issues facing while integrating many number of transistors like short channel effect, power dissipation, scaling of the transistors. To overcome these problems by considering the carbon nano tube have promising application in the field of electronics. The transient and power analysis are obtained with operating voltage at 0.6V for the single edge triggered D flip-flop and shift registers using system vision tool. The simulation results are presented, and the power consumptions are compared with the conventional MOSFET design. The power consumption of D-Flipflop using mosfet has 9.136uw, whereas for the cntfet based design it was obtained as 0.15uw. Similarly when the shift registers were designed using cntfet power consumption values are 60% better than that of mosfet designs. The comparison of results indicated that the CNTFET based design is capable of efficient power savings.Keywords
CNT, CNTFET, Single Edge Triggered D Flip Flop, Shift Registers, Design Constraints, Circuit Simulation.- Effect of CNTFET on 4 to 2 Compressor
Abstract Views :153 |
PDF Views:3
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu, IN
2 Jeppiaar Institute of Technology, Kunnam, Tamilnadu, IN
1 Sathyabama University, Chennai, Tamilnadu, IN
2 Jeppiaar Institute of Technology, Kunnam, Tamilnadu, IN
Source
Digital Signal Processing, Vol 4, No 6 (2012), Pagination: 254-259Abstract
This paper enumerates the efficient design and Abstract---This paper enumerates the efficient design and analysis of a 4 to 2 compressor using Full Adder cell. The Full Adder is designed using Stanford University CNTFET model and proposed 10nm CNTFET model. There are many issues facing while integrating more number of transistors like short channel effect, power dissipation, scaling of the transistors. To overcome these problems by Considering the carbon nano tube have promising application in the field of electronics. The carbon nanotube is emerging as a viable replacement to the MOSFET. The transient and power analyses are obtained with operating voltage at 0.9V. The simulation results are presented and the analyses are compared with circuits designed using 32nm MOSFET. The comparison of results indicated that the proposed 10nm CNTFET based design is more efficient in power savings and speed.
Keywords
CNT, CNTFET, Full Adder Cell, Compressor, Design Constraints and Circuit Simulation.- A Comparative Analysis of Low Power D Flip Flop Using Leakage Power Reduction Techniques
Abstract Views :387 |
PDF Views:4
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu, IN
1 Sathyabama University, Chennai, Tamilnadu, IN
Source
Automation and Autonomous Systems, Vol 4, No 6 (2012), Pagination: 237-242Abstract
This paper proposes a new topology to low power approaches for very large scale integration (VLSI) design. Power dissipation is one of the major concerns when designing a VLSI system. Until recently, dynamic power was the only concern. However, as the technology feature size shrinks, static power, which was negligible before, becomes an issue as important as dynamic power. Since static power increases dramatically in nanoscale silicon VLSI technology, the importance of reducing leakage. This paper describes a low-leakage technique. We are doing comparable analysis of different low power, leakage current reduction techniques like SLEEP approach, STACK, SLEEPY–STACK, SLEEPY KEEPER, SLEEPY–STACK with KEEPER, LEAKAGE FEEDBACK and LEAKAGE FEEDBACK with STACK techniques. Which reduces leakage power while saving exact logic state. Based on simulation results a conventional D Flip flop with the Full sleep approach achieves up to 95 % less power consumption.
Keywords
Conventional D Flip Flop, Low Power Dissipation Techniques, Circuit Simulation.- Effect of CNTFET on Carry Skip Adder
Abstract Views :228 |
PDF Views:6
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu, IN
1 Sathyabama University, Chennai, Tamilnadu, IN
Source
Automation and Autonomous Systems, Vol 4, No 6 (2012), Pagination: 243-247Abstract
This paper enumerates the efficient design and analysis of a Carry Skip Adder using Full Adder cell. The Full Adder is designed using Stanford University CNTFET model and proposed 10nm CNTFET model. There are many issues facing while integrating more number of transistors like short channel effect, power dissipation, scaling of the transistors. To overcome these problems by considering the carbon nano tube have promising application in the field of electronics. The carbon nanotube is emerging as a viable replacement to the MOSFET. The transient and power analyses are obtained with operating voltage at 0.9V. The simulation results are presented and the analyses are compared with circuits designed using 32nm MOSFET. The comparison of results indicated that the proposed 10nm CNTFET based design is more efficient in power savings and speed.
Keywords
CNT, CNTFET, Full Adder Cell, Carry Skip Adder, Design Constraints and Circuit Simulation.- A Comparative Study of CSA Design Using CNTFET and MOSFET
Abstract Views :379 |
PDF Views:4
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu, IN
1 Sathyabama University, Chennai, Tamilnadu, IN
Source
Automation and Autonomous Systems, Vol 4, No 6 (2012), Pagination: 248-252Abstract
This paper enumerates the design and analysis of a Carry Select Adder (CSA) using Full Adder cell. The Full Adder is designed using MOSFET 32nm model, Stanford University CNTFET model and proposed 10nm CNTFET model. There are many issues facing while integrating more number of transistors like short channel effect, power dissipation, scaling of the transistors. Inorder to overcome these problems and still reduce transistor size, Carbon Nano Tube Field Effect Transistors or CNTFETs have promising applications in the field of electronics. The carbon nanotube is emerging as a viable replacement to the MOSFET. The transient and power analyses in this paper are obtained with operating voltage at 0.9V. The simulation results are presented and the analyses are compared with circuits designed using 32nm MOSFET. The comparison of results indicated that the proposed 10nm CNTFET based design is more efficient in power savings and speed.Keywords
CNT, CNTFET, Full Adder Cell, Carry Select Adder, Design Constraints, Circuit Simulation, CSA, 32nm, 10nm, Ballistic CNTFET Model, HSPICE, TSPICE.- A Novel Technique for Multi-Class Ordinal Regression-APDC
Abstract Views :208 |
PDF Views:0
Authors
Affiliations
1 Sathyabama University, Rajiv Gandhi Road, Jeppiaar Nagar, Chennai - 600119, Tamil Nadu, IN
2 Karapagam College of Engineering, Myleripalayam Village, Othakkal Mandapam Post, Coimbatore - 641032, Tamil Nadu, IN
3 Madanapalle Institute of Technology and Science, P.B. No:14, Kadiri Road, Angallu Village, Chittoor District, Madanapalle - 517325, Andhra Pradesh, IN
1 Sathyabama University, Rajiv Gandhi Road, Jeppiaar Nagar, Chennai - 600119, Tamil Nadu, IN
2 Karapagam College of Engineering, Myleripalayam Village, Othakkal Mandapam Post, Coimbatore - 641032, Tamil Nadu, IN
3 Madanapalle Institute of Technology and Science, P.B. No:14, Kadiri Road, Angallu Village, Chittoor District, Madanapalle - 517325, Andhra Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 9, No 10 (2016), Pagination:Abstract
Objectives: Ordinal regression is one which is used in Multiclass classification where there is an essential ordering among the classes. The training dataset is initially classified depending on the Random threshold values θ. Based on these values, the distance between the different class labels are predicted by one against one technique. Method: All Pairs Distance Calculation using one against one technique [APDC_1 AG 1] is Proposed to validate the work. But in the referred previous work, distance is calculated using adjacent classes, but here all pairs distance calculation is used to find the class label distance to all class label pairs. Findings: On the whole, New trained data are in the form of one dimensional representation. Here, with the knowledge of proposed work, testing data is tested with New trained data set and the results are produced. The Proposed method is seen to be ambitious when compared with previous work. Beside this, an additional set of experiments is done to study the potential quantifiability and illustratability of the proposed method when using APDC as base methodology. Improvements: Proposed work is analyzed with Kernel discriminant analysis, Logistic Regression, Classification via Regression, Multiclass Classifier and found APDC has attained better results according to all measures.Keywords
All Pairs Distance Calculations, Hyper Line, Latent Space Representation, Multi-Class Ordinal Regression, One Against One Method, Ordinal Classification, ProjectionFull Text
- Named Entity Recognition from Biomedical Text-An Information Extraction Task
Abstract Views :154 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN
2 Department of Computer Science and Engineering, Madanapalle Institute of Technology and Science, IN
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN
2 Department of Computer Science and Engineering, Madanapalle Institute of Technology and Science, IN
Source
ICTACT Journal on Soft Computing, Vol 6, No 4 (2016), Pagination: 1302-1307Abstract
Biomedical Text Mining targets the Extraction of significant information from biomedical archives. Bio TM encompasses Information Retrieval (IR) and Information Extraction (IE). The Information Retrieval will retrieve the relevant Biomedical Literature documents from the various Repositories like PubMed, MedLine etc., based on a search query. The IR Process ends up with the generation of corpus with the relevant document retrieved from the Publication databases based on the query. The IE task includes the process of Preprocessing of the document, Named Entity Recognition (NER) from the documents and Relationship Extraction. This process includes Natural Language Processing, Data Mining techniques and machine Language algorithm. The preprocessing task includes tokenization, stop word Removal, shallow parsing, and Parts-Of-Speech tagging. NER phase involves recognition of well-defined objects such as genes, proteins or cell-lines etc. This process leads to the next phase that is extraction of relationships (IE). The work was based on machine learning algorithm Conditional Random Field (CRF).Keywords
Information Extraction, Information Retrieval, Text Mining, Named Entity Recognition, Data Mining.- Alleviate the Parental Stress in Neonatal Intensive Care Unit using Ontology
Abstract Views :143 |
PDF Views:0
Authors
A. Velmurugan
1,
T. Ravi
2
Affiliations
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Department of Computer Science and Engineering, Madanapallee Institute of Technology and Science, Andhra Pradesh, IN
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Department of Computer Science and Engineering, Madanapallee Institute of Technology and Science, Andhra Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 9, No 28 (2016), Pagination:Abstract
Parents of preterm infants are facing difficulties in lack of information, lack of understanding of medical terminologies, preterm infant’s risk factors and their feelings of emotional stress in Neonatal Intensive Care Unit (NICU). In order to release their stress, need to develop an automatic system that generates a clear and brief summary about the infant process and also generate a meaning of medical terms which is used at NICU. To accomplish the system properly, there is a necessity of ontology. In this paperwork, we present an ontology which holds few main concepts in NICU domain. This ontology was constructed through protégé 4.3. This ontology predominantly covers classes, data properties, object properties, individuals, existential restriction, and cardinality restriction on the relationship between classes and other description. At the end of this paper, HermiT Reasoner was used to examine inconsistencies and unsatisfiability.Keywords
Infant, Medical Terminology, Neonatal Intensive Care Unit, Ontology, Protege.Full Text