Rough sets theory can be applied to the problem of pattern recognition using neural networks in three different stages: preprocessing, learning rule and in the architecture. This paper discusses the use of rough set theory in the architecture of the unsupervised neural network, which is implemented, by the use of rough neuron. The rough neuron consists of two neurons: upper boundary neuron and lower boundary neuron, derived on the upper and lower boundaries of the input vector. The proposed neural network uses the Kohonen learning rule. Problem of character recognition is taken to verify the usefulness of such a network. The data set is formed by the images of English alphabets of ten different fonts. The approximation quality of such a network is better compared to the traditional networks. The number of iterations reduce significantly for such a network and hence the convergence time.
{"title":"Rough Neuron Based Neural Classifier","authors":"A. Kothari, A. Keskar, R. Chalasani, S. Srinath","doi":"10.1109/ICETET.2008.229","DOIUrl":"https://doi.org/10.1109/ICETET.2008.229","url":null,"abstract":"Rough sets theory can be applied to the problem of pattern recognition using neural networks in three different stages: preprocessing, learning rule and in the architecture. This paper discusses the use of rough set theory in the architecture of the unsupervised neural network, which is implemented, by the use of rough neuron. The rough neuron consists of two neurons: upper boundary neuron and lower boundary neuron, derived on the upper and lower boundaries of the input vector. The proposed neural network uses the Kohonen learning rule. Problem of character recognition is taken to verify the usefulness of such a network. The data set is formed by the images of English alphabets of ten different fonts. The approximation quality of such a network is better compared to the traditional networks. The number of iterations reduce significantly for such a network and hence the convergence time.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133639836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless sensor networks (WSNs) have emerged as an interesting research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. The collaborative execution is realized by exchanging messages that are time-stamped using the local clocks on the nodes. Hence, time synchronization becomes indispensable in such distributed systems. For years, protocols such as network time protocol (NTP) have kept the clocks of networked systems in perfect synchronization. However, wireless sensor networks has a large density of nodes and very limited energy resource at every node which leads to improved scalability requirements while limiting the resources. This paper proposes a technique called level-based time synchronization to provide redundant ways for each node to synchronize its clock with the common source, so that it can tolerate partially missing or false synchronization information provided by compromised nodes. The efficacy of this technique is evaluated via simulations.
{"title":"Secure Time Synchronization against Malicious Attacks for Wireless Sensor Networks","authors":"V. Vijayalakshmi, T. G. Palanivelu, N. Agalya","doi":"10.1109/ICETET.2008.224","DOIUrl":"https://doi.org/10.1109/ICETET.2008.224","url":null,"abstract":"Wireless sensor networks (WSNs) have emerged as an interesting research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. The collaborative execution is realized by exchanging messages that are time-stamped using the local clocks on the nodes. Hence, time synchronization becomes indispensable in such distributed systems. For years, protocols such as network time protocol (NTP) have kept the clocks of networked systems in perfect synchronization. However, wireless sensor networks has a large density of nodes and very limited energy resource at every node which leads to improved scalability requirements while limiting the resources. This paper proposes a technique called level-based time synchronization to provide redundant ways for each node to synchronize its clock with the common source, so that it can tolerate partially missing or false synchronization information provided by compromised nodes. The efficacy of this technique is evaluated via simulations.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134000803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 1992, Sakakibara introduced a well-known approach for learning context-free grammars from positive samples of structural descriptions (skeletons). In particular, Sakakibarapsilas approach uses reversible tree automata construction algorithm RT. Here, we introduce a modification of the learning algorithm RT for reversible tree automata. With respect to n, where n is the sum of the sizes of the input skeletons, our modification for RT, called e_RT, needs O(n3) operations and achieves the storage space saving by a factor of O(n) over RT. Using our e_RT, we give an algorithm e_RC to learn reversible context-free grammars from positive samples of their structural descriptions. Furthermore, we modify e_RC to learn extended reversible context-free grammars from positive-only examples. Finally, we present summary of our experiments carried out to see how our results compare with those of Sakakibara, which also confirms our approach as efficient and useful.
{"title":"On Learning Context-Free Grammars Using Skeletons","authors":"G. L. Prajapati, N. Chaudhari, M. Chandwani","doi":"10.1109/ICETET.2008.167","DOIUrl":"https://doi.org/10.1109/ICETET.2008.167","url":null,"abstract":"In 1992, Sakakibara introduced a well-known approach for learning context-free grammars from positive samples of structural descriptions (skeletons). In particular, Sakakibarapsilas approach uses reversible tree automata construction algorithm RT. Here, we introduce a modification of the learning algorithm RT for reversible tree automata. With respect to n, where n is the sum of the sizes of the input skeletons, our modification for RT, called e_RT, needs O(n3) operations and achieves the storage space saving by a factor of O(n) over RT. Using our e_RT, we give an algorithm e_RC to learn reversible context-free grammars from positive samples of their structural descriptions. Furthermore, we modify e_RC to learn extended reversible context-free grammars from positive-only examples. Finally, we present summary of our experiments carried out to see how our results compare with those of Sakakibara, which also confirms our approach as efficient and useful.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115718753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the analytical solution of one-dimensional stresses for a hollow sphere made of functionally graded material. The material properties vary continuously across the thickness, according to power functions of radial direction. The thermal boundary conditions may include conduction, flux, and convection for inside or outside of hollow sphere. Thermoelasticity equation is steady state and include heat source. The aim of this work is considering the effect of heat source on thermal stresses. The heat conduction and Navier equations are solved analytically and a direct method of solution of Navier equation is presented.
{"title":"Analytical Solution for One-Dimensional Stresses in a Hollow FGM Sphere with Heat Source","authors":"Sasan Mohammadi, A. H. Mohazzab, M. Jabbari","doi":"10.1109/ICETET.2008.159","DOIUrl":"https://doi.org/10.1109/ICETET.2008.159","url":null,"abstract":"This paper presents the analytical solution of one-dimensional stresses for a hollow sphere made of functionally graded material. The material properties vary continuously across the thickness, according to power functions of radial direction. The thermal boundary conditions may include conduction, flux, and convection for inside or outside of hollow sphere. Thermoelasticity equation is steady state and include heat source. The aim of this work is considering the effect of heat source on thermal stresses. The heat conduction and Navier equations are solved analytically and a direct method of solution of Navier equation is presented.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129623718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The fundamental issue faced by the developers in todaypsilas environment is how to measure the quality of software modularization. In this paper a new set of metrics are proposed which measure the quality of modularization of an object-oriented software (OOS) system. A set of design principles are proposed to capture the notion of modularity and metrics are defined based on the principles. The coupling-based structural metrics measures the function-call traffic through the APIpsilas of the modules in relation to the overall function-call traffic. It is now widely accepted that the overall quality of a large body of software is enhanced when module interactions are restricted to take place through the published APIpsilas for the modules. The metrics can be tested on some large legacy-code business applications. The metrics can be validated from the results obtained on human-modularized versions of the software.
{"title":"Notice of Violation of IEEE Publication PrinciplesMeasuring the Quality of Software Modularization Using Coupling-Based Structural Metrics for an OOS System","authors":"M. Aruna, M. Devi, M. Deepa","doi":"10.1109/ICETET.2008.76","DOIUrl":"https://doi.org/10.1109/ICETET.2008.76","url":null,"abstract":"The fundamental issue faced by the developers in todaypsilas environment is how to measure the quality of software modularization. In this paper a new set of metrics are proposed which measure the quality of modularization of an object-oriented software (OOS) system. A set of design principles are proposed to capture the notion of modularity and metrics are defined based on the principles. The coupling-based structural metrics measures the function-call traffic through the APIpsilas of the modules in relation to the overall function-call traffic. It is now widely accepted that the overall quality of a large body of software is enhanced when module interactions are restricted to take place through the published APIpsilas for the modules. The metrics can be tested on some large legacy-code business applications. The metrics can be validated from the results obtained on human-modularized versions of the software.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"34 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124334642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Security is of great concern for software engineering community for the development of online systems. To handle all the security issues properly we need to have well defined process for Security engineering and this process should be integrated with software development life cycle (SDLC). For integrating security engineering with SDLC the requirement engineers should have clearly understanding of what security requirements are and he/she is able to distinguish security requirements from various architectural and behavioral constraints. In this paper we go on to define a process for security requirements elicitation presenting techniques for activities like requirements discovery, analysis, prioritization and management. With true security requirements identified as early as possible and systematically identified, Architecture team can choose most appropriate mechanism to implement them.
{"title":"Security Requirements Elicitation Using View Points for Online System","authors":"A. Agarwal, D. Gupta","doi":"10.1109/ICETET.2008.91","DOIUrl":"https://doi.org/10.1109/ICETET.2008.91","url":null,"abstract":"Security is of great concern for software engineering community for the development of online systems. To handle all the security issues properly we need to have well defined process for Security engineering and this process should be integrated with software development life cycle (SDLC). For integrating security engineering with SDLC the requirement engineers should have clearly understanding of what security requirements are and he/she is able to distinguish security requirements from various architectural and behavioral constraints. In this paper we go on to define a process for security requirements elicitation presenting techniques for activities like requirements discovery, analysis, prioritization and management. With true security requirements identified as early as possible and systematically identified, Architecture team can choose most appropriate mechanism to implement them.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125215550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Genetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Genetic algorithms are well applied in procedural software testing but a little has been done in testing of object oriented software. In this paper, we propose a method to generate test cases for classes in object oriented software using a genetic programming approach. This method uses tree representation of statements in test cases. Strategies for encoding the test cases and using the objective function to evolve them as suitable test case are proposed.
{"title":"Using Genetic Algorithm for Unit Testing of Object Oriented Software","authors":"N. Gupta, Mukesh Kumar Rohil","doi":"10.1109/ICETET.2008.137","DOIUrl":"https://doi.org/10.1109/ICETET.2008.137","url":null,"abstract":"Genetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Genetic algorithms are well applied in procedural software testing but a little has been done in testing of object oriented software. In this paper, we propose a method to generate test cases for classes in object oriented software using a genetic programming approach. This method uses tree representation of statements in test cases. Strategies for encoding the test cases and using the objective function to evolve them as suitable test case are proposed.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132381518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A high-speed radix-64 parallel multiplier using novel reduced delay partial product generator is proposed. The use of radix-64 Booth encoder and selector for partial product generation by Sang-Hoon (Sang-Hoon Lee et al., 2002) reduces the number of partial product rows by six fold. The Booth selector selects one among X, 2X, 3X, 4X, 8X, 16X, 24X and 32X where X is the multiplicand. Before selection 3X computation must be completed which accounts for maximum delay because of carry propagation or carry look ahead addition of X and 2X. In this work this fundamental coefficient is generated as 4X-X using redundant binary (RB) arithmetic. This leads to zero delay for 3X computation as well as simplifies the partial product rows accumulation. This novel method of partial product generation decreases delay by 24% in comparison to last high-speed reported parallel multiplier (Sang-Hoon Lee et al., 2002) using radix-64 Booth encoding.
提出了一种基于新型减延迟部分积发生器的高速64根并行乘法器。Sang-Hoon (Sang-Hoon Lee et al.， 2002)使用radix-64 Booth编码器和选择器生成部分产品，将部分产品行数减少了六倍。展台选择器从X、2X、3X、4X、8X、16X、24X、32X中选择一个，其中X为乘数。在选择之前必须完成3X计算，这是由于X和2X的进位传播或进位前瞻相加造成的最大延迟。在这项工作中，这个基本系数是用冗余二进制(RB)算法生成的4X-X。这使得3X计算的延迟为零，并简化了部分乘积行累积。这种新颖的部分积生成方法与上一个高速并行乘法器(Sang-Hoon Lee et al.， 2002)使用基数64 Booth编码相比，延迟减少了24%。
{"title":"A High-Speed Radix-64 Parallel Multiplier Using a Novel Hardware Implementation Approach for Partial Product Generation Based on Redundant Binary Arithmetic","authors":"S. K. Sahoo, Abhijit Ashati, R. Sahoo, C. Shekhar","doi":"10.1109/ICETET.2008.128","DOIUrl":"https://doi.org/10.1109/ICETET.2008.128","url":null,"abstract":"A high-speed radix-64 parallel multiplier using novel reduced delay partial product generator is proposed. The use of radix-64 Booth encoder and selector for partial product generation by Sang-Hoon (Sang-Hoon Lee et al., 2002) reduces the number of partial product rows by six fold. The Booth selector selects one among X, 2X, 3X, 4X, 8X, 16X, 24X and 32X where X is the multiplicand. Before selection 3X computation must be completed which accounts for maximum delay because of carry propagation or carry look ahead addition of X and 2X. In this work this fundamental coefficient is generated as 4X-X using redundant binary (RB) arithmetic. This leads to zero delay for 3X computation as well as simplifies the partial product rows accumulation. This novel method of partial product generation decreases delay by 24% in comparison to last high-speed reported parallel multiplier (Sang-Hoon Lee et al., 2002) using radix-64 Booth encoding.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117005025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Density based clustering technique like DBSCAN finds arbitrary shaped clusters along with noisy outliers. DBSCAN finds the density at a point by counting the number of points falling in a sphere of radius epsi and it has a time complexity of O(n2). Hence it is not suitable for large data sets. The proposed method in this paper is an efficient and fast Parzen-Window density based clustering method which uses (i) prototypes to reduce the computational burden, (ii) a smooth kernel function to estimate density at a point and hence the estimated density is also varies smoothly. Enriched prototypes are derived using counted leaders method. These are used with a special form of the Gaussian kernel function which is radially symmetrical and hence the function can be completely specified by a variance parameter only. The proposed method is experimentally compared with DBSCAN which shows that it is a suitable method for large data sets.
{"title":"An Efficient and Fast Parzen-Window Density Based Clustering Method for Large Data Sets","authors":"V. S. Babu, P. Viswanath","doi":"10.1109/ICETET.2008.166","DOIUrl":"https://doi.org/10.1109/ICETET.2008.166","url":null,"abstract":"Density based clustering technique like DBSCAN finds arbitrary shaped clusters along with noisy outliers. DBSCAN finds the density at a point by counting the number of points falling in a sphere of radius epsi and it has a time complexity of O(n2). Hence it is not suitable for large data sets. The proposed method in this paper is an efficient and fast Parzen-Window density based clustering method which uses (i) prototypes to reduce the computational burden, (ii) a smooth kernel function to estimate density at a point and hence the estimated density is also varies smoothly. Enriched prototypes are derived using counted leaders method. These are used with a special form of the Gaussian kernel function which is radially symmetrical and hence the function can be completely specified by a variance parameter only. The proposed method is experimentally compared with DBSCAN which shows that it is a suitable method for large data sets.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114806208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fuzzy systems offer numerous methods that prove helpful in solving application problems, where the governing parameters bear fuzziness in nature. In particular, many variants of fuzzy decision making models have been successfully explored as vocational guidance systems to assist decision makers in recognition and guidance processes, specially in the Medical diagnostic realm. In the present communication, an attempt is made to unreveal the fact that even the precisely chosen text fragments from a closed world domain incorporate the fuzzy boundaries among their term-to-term associations for machine-assisted acquisition and subsequent evaluation of Natural Language Semantics of that domain. This inspires further, to provide a decision-making tool that assists the Academicians in assessing the online submitted subjective answers at the candidatespsila end.
{"title":"Intelligent Fuzzy Decision Making for Subjective Answer Evaluation Using Utility Functions","authors":"Ani Thomas, M. Kowar, Sanjay Sharma","doi":"10.1109/ICETET.2008.216","DOIUrl":"https://doi.org/10.1109/ICETET.2008.216","url":null,"abstract":"Fuzzy systems offer numerous methods that prove helpful in solving application problems, where the governing parameters bear fuzziness in nature. In particular, many variants of fuzzy decision making models have been successfully explored as vocational guidance systems to assist decision makers in recognition and guidance processes, specially in the Medical diagnostic realm. In the present communication, an attempt is made to unreveal the fact that even the precisely chosen text fragments from a closed world domain incorporate the fuzzy boundaries among their term-to-term associations for machine-assisted acquisition and subsequent evaluation of Natural Language Semantics of that domain. This inspires further, to provide a decision-making tool that assists the Academicians in assessing the online submitted subjective answers at the candidatespsila end.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：