Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141396
S. Tiwari, Aneesh Gupta, Kunwar Singh, Maneesha Gupta
The paper presents a new automated transistor width optimization methodology for SoC. The methodology is based on Logical Effort theory. The proposed methodology is completely automation based and uses different procedural blocks written in TCL (tool command language). The methodology requires SPICE netlist as input and optimizes transistor widths for minimum delay. Both sequential (flip-flop) and combinational (basic logic gates) logic blocks were optimized successfully using the proposed methodology.
{"title":"Logical effort based automated transistor width optimization methodology","authors":"S. Tiwari, Aneesh Gupta, Kunwar Singh, Maneesha Gupta","doi":"10.1109/WICT.2011.6141396","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141396","url":null,"abstract":"The paper presents a new automated transistor width optimization methodology for SoC. The methodology is based on Logical Effort theory. The proposed methodology is completely automation based and uses different procedural blocks written in TCL (tool command language). The methodology requires SPICE netlist as input and optimizes transistor widths for minimum delay. Both sequential (flip-flop) and combinational (basic logic gates) logic blocks were optimized successfully using the proposed methodology.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128890728","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141370
S. Goel, Arpita Sharma, Punam Bedi
A novel, nature inspired, unsupervised classification method, based on the most recent metaheuristic algorithm, stirred by the breeding strategy of the parasitic bird, the cuckoo, is introduced in this paper. The proposed Cuckoo Search Clustering Algorithm (CSCA) yields good results on benchmark dataset. Inspired by the results, the proposed algorithm is validated on two real time remote sensing satellite- image datasets for extraction of the water body, which itself is a quite complex problem. The CSCA makes use of Davies-Bouldin index (DBI) as fitness function. Also a method for generation of new cuckoos used in this algorithm is introduced. The resulting algorithm is conceptually simpler, takes less parameter than other nature inspired algorithms, and, after some parameter tuning, yields very good results.
{"title":"Cuckoo Search Clustering Algorithm: A novel strategy of biomimicry","authors":"S. Goel, Arpita Sharma, Punam Bedi","doi":"10.1109/WICT.2011.6141370","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141370","url":null,"abstract":"A novel, nature inspired, unsupervised classification method, based on the most recent metaheuristic algorithm, stirred by the breeding strategy of the parasitic bird, the cuckoo, is introduced in this paper. The proposed Cuckoo Search Clustering Algorithm (CSCA) yields good results on benchmark dataset. Inspired by the results, the proposed algorithm is validated on two real time remote sensing satellite- image datasets for extraction of the water body, which itself is a quite complex problem. The CSCA makes use of Davies-Bouldin index (DBI) as fitness function. Also a method for generation of new cuckoos used in this algorithm is introduced. The resulting algorithm is conceptually simpler, takes less parameter than other nature inspired algorithms, and, after some parameter tuning, yields very good results.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131068193","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141281
M. Vodel, Mirko Lippmann, W. Hardt
Actual research projects in the fields of wireless communication systems focus on distributed, heterogeneous architectures for advanced sensor-actor-networks (SNETs). Each subsystem provides specific capabilities for measuring or manipulating its environment. At the same time, a huge amount of sensor, status and control data has to be transmitted over different network interfaces and communication standards. During the runtime, the number and the quality of communication channels is changing dynamically. Especially in wireless multi-hop scenarios with multiple radio standards, the maintenance of stable communication paths is critical.
{"title":"Dynamic channel management for advanced, energy-efficient sensor-actor-networks","authors":"M. Vodel, Mirko Lippmann, W. Hardt","doi":"10.1109/WICT.2011.6141281","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141281","url":null,"abstract":"Actual research projects in the fields of wireless communication systems focus on distributed, heterogeneous architectures for advanced sensor-actor-networks (SNETs). Each subsystem provides specific capabilities for measuring or manipulating its environment. At the same time, a huge amount of sensor, status and control data has to be transmitted over different network interfaces and communication standards. During the runtime, the number and the quality of communication channels is changing dynamically. Especially in wireless multi-hop scenarios with multiple radio standards, the maintenance of stable communication paths is critical.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133906776","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141447
I. Khan, O. Shah, M. Beg
In this paper, we compared various different techniques of previously published Single Edge Triggered Flip Flops (SET FFs). Flip Flops are most essential elements in the design of sequential circuits. We did the comparison for their performance and power dissipation and have also compared the transistor count of each Flip Flop.
{"title":"Analysis of different techniques for low power Single Edge Triggered Flip Flops","authors":"I. Khan, O. Shah, M. Beg","doi":"10.1109/WICT.2011.6141447","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141447","url":null,"abstract":"In this paper, we compared various different techniques of previously published Single Edge Triggered Flip Flops (SET FFs). Flip Flops are most essential elements in the design of sequential circuits. We did the comparison for their performance and power dissipation and have also compared the transistor count of each Flip Flop.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134631488","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141259
Shruti Kohli, E. Kumar
Search Engines are always making efforts to better understand their user's need and improve user satisfaction. This research examines the important issue of user dependency (effectively a combination of loyalty and satisfaction) on web search engines, first studying existing dependency and then modeling that dependency. An algorithm developed to find a quantitative value of “user dependency” on Search Engine is presented. Here, the term ‘user dependency’ implies the psychological satisfaction of a user with the search results presented for a search session. It's an indicative measure of user's trust on Search Engine and impacts the user's choice to use the same Search Engine in future. This paper investigates factors that influence a search session and uses a fuzzy based approach to determine the dependency and overall trust the user places on the Search Engine. The proposed algorithm accepts ‘user rating for the search session’ as input and based on the ‘user satisfaction with search’ generates a value for user dependency. The findings have implications for search engines in improving their ranking algorithms based on explicit user feedback on the search experience. The algorithm has been implemented and tested using Visual Basic environment developed for this study. The validity of algorithm and correctness of its result is evaluated using a survey conducted with a sample of users. Results have been validated for accuracy and their conformance to sampled user's satisfaction.
{"title":"Evolution of user dependent model to predict future usability of a search engine","authors":"Shruti Kohli, E. Kumar","doi":"10.1109/WICT.2011.6141259","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141259","url":null,"abstract":"Search Engines are always making efforts to better understand their user's need and improve user satisfaction. This research examines the important issue of user dependency (effectively a combination of loyalty and satisfaction) on web search engines, first studying existing dependency and then modeling that dependency. An algorithm developed to find a quantitative value of “user dependency” on Search Engine is presented. Here, the term ‘user dependency’ implies the psychological satisfaction of a user with the search results presented for a search session. It's an indicative measure of user's trust on Search Engine and impacts the user's choice to use the same Search Engine in future. This paper investigates factors that influence a search session and uses a fuzzy based approach to determine the dependency and overall trust the user places on the Search Engine. The proposed algorithm accepts ‘user rating for the search session’ as input and based on the ‘user satisfaction with search’ generates a value for user dependency. The findings have implications for search engines in improving their ranking algorithms based on explicit user feedback on the search experience. The algorithm has been implemented and tested using Visual Basic environment developed for this study. The validity of algorithm and correctness of its result is evaluated using a survey conducted with a sample of users. Results have been validated for accuracy and their conformance to sampled user's satisfaction.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132297959","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141316
C. Naveena, Manjunath Aradhya
Handwritten character recognition is a difficult problem due to the great variations on writing styles, different size and orientation angle of the characters. In this paper, we propose an unconstrained handwritten Kannada character recognition based on the ridgelet transforms. Ridglets are a powerful instrument in catching and representing mono-dimensional singularities in bi dimensional space [7]. Ridgelet transforms is used to extracts low pass energy of character image and is then fed to PCA for feature extraction. We conducted experiment on very large database of handwritten Kannada character. The size of the class was 200 and encouraging results are obtained.
{"title":"An impact of ridgelet transform in handwritten recognition: A study on very large dataset of Kannada script","authors":"C. Naveena, Manjunath Aradhya","doi":"10.1109/WICT.2011.6141316","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141316","url":null,"abstract":"Handwritten character recognition is a difficult problem due to the great variations on writing styles, different size and orientation angle of the characters. In this paper, we propose an unconstrained handwritten Kannada character recognition based on the ridgelet transforms. Ridglets are a powerful instrument in catching and representing mono-dimensional singularities in bi dimensional space [7]. Ridgelet transforms is used to extracts low pass energy of character image and is then fed to PCA for feature extraction. We conducted experiment on very large database of handwritten Kannada character. The size of the class was 200 and encouraging results are obtained.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114386384","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141374
Ankush Rai, F. Barbhuiya, A. Sur, S. Biswas, Suchetana Chakraborty, Sukumar Nandi
Spanning tree protocol (STP) is a link layer protocol used for link management, prevention of loop formation etc. in the network. Although STP is widely used, it is still prone to many kinds of attacks that exploit the lack of security features both in basic working process and STP packet format. By exploiting STP control packet an attacker can pretend to be the new root in STP domain and perform unauthorized activities that lead to root take-over attack, STP control packet flooding, traffic redirection and so on. In this paper, a coverage based distributed intrusion detection system (DIDS) has been introduced, for the detection of attacks on STP. The proposed scheme computes a set of switches in the network that can cover the STP network completely; where every switch belongs to that set is installed with a small module of IDS. This set of IDSs logically divides the STP network into a set of local zones. All the switches in a zone is directly connected to one switch installed with IDS and thus covered by at least one IDS in STP domain. Each IDS can detect and verify any exploit inside its local zone. Additionally IDSs communicate with each other so that any exploit outside the local zone of a particular IDS can also be detected and verified. The results show that the proposed DIDS approach can detect all the STP based attacks.
{"title":"Exploit detection techniques for STP using distributed IDS","authors":"Ankush Rai, F. Barbhuiya, A. Sur, S. Biswas, Suchetana Chakraborty, Sukumar Nandi","doi":"10.1109/WICT.2011.6141374","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141374","url":null,"abstract":"Spanning tree protocol (STP) is a link layer protocol used for link management, prevention of loop formation etc. in the network. Although STP is widely used, it is still prone to many kinds of attacks that exploit the lack of security features both in basic working process and STP packet format. By exploiting STP control packet an attacker can pretend to be the new root in STP domain and perform unauthorized activities that lead to root take-over attack, STP control packet flooding, traffic redirection and so on. In this paper, a coverage based distributed intrusion detection system (DIDS) has been introduced, for the detection of attacks on STP. The proposed scheme computes a set of switches in the network that can cover the STP network completely; where every switch belongs to that set is installed with a small module of IDS. This set of IDSs logically divides the STP network into a set of local zones. All the switches in a zone is directly connected to one switch installed with IDS and thus covered by at least one IDS in STP domain. Each IDS can detect and verify any exploit inside its local zone. Additionally IDSs communicate with each other so that any exploit outside the local zone of a particular IDS can also be detected and verified. The results show that the proposed DIDS approach can detect all the STP based attacks.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116433316","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141290
N. Rathore, R. Gupta
A large numbers of metrics have been proposed for measuring properties of object-oriented software such as size, inheritance, cohesion and coupling. The coupling metrics presented in this paper exploring the difference between inheritance and interface programming. This paper presents a measurement to measure coupling between object (CBO), number of associations between classes (NASSocC), number of dependencies in metric (NDepIN), number of dependencies out metric (NDepOut) and Number of children (NOC) in object oriented programming. A measurement is done for C# inheritance and interface programs. The metric values of class inheritance and interface prove which program is good to use and beneficial for C# developers.
{"title":"A novel coupling metrics measure difference between inheritance and interface to find better OOP paradigm using C#","authors":"N. Rathore, R. Gupta","doi":"10.1109/WICT.2011.6141290","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141290","url":null,"abstract":"A large numbers of metrics have been proposed for measuring properties of object-oriented software such as size, inheritance, cohesion and coupling. The coupling metrics presented in this paper exploring the difference between inheritance and interface programming. This paper presents a measurement to measure coupling between object (CBO), number of associations between classes (NASSocC), number of dependencies in metric (NDepIN), number of dependencies out metric (NDepOut) and Number of children (NOC) in object oriented programming. A measurement is done for C# inheritance and interface programs. The metric values of class inheritance and interface prove which program is good to use and beneficial for C# developers.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131983898","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141289
Pravesh Kumar, M. Pant, V. Singh
Differential Evolution (DE) is a popular technique for solving real parameter global optimization problems. Several variants of DE are proposed in literature which aims at further strengthening its performance for solving complex problems. In the present study we suggest a simple and efficient modification in the selection strategy of basic DE. The proposed strategy is named Information Preserving (IP) selection strategy. It makes use of most of the information that is generated during the different phases of DE. The proposed IP scheme is embedded in the structure of basic DE and also in DERL, another variant of DE. The numerical results indicate that the inclusion of proposed scheme significantly improves the performance in terms of convergence rate while maintaining the solution quality.
{"title":"Information preserving selection strategy for Differential Evolution algorithm","authors":"Pravesh Kumar, M. Pant, V. Singh","doi":"10.1109/WICT.2011.6141289","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141289","url":null,"abstract":"Differential Evolution (DE) is a popular technique for solving real parameter global optimization problems. Several variants of DE are proposed in literature which aims at further strengthening its performance for solving complex problems. In the present study we suggest a simple and efficient modification in the selection strategy of basic DE. The proposed strategy is named Information Preserving (IP) selection strategy. It makes use of most of the information that is generated during the different phases of DE. The proposed IP scheme is embedded in the structure of basic DE and also in DERL, another variant of DE. The numerical results indicate that the inclusion of proposed scheme significantly improves the performance in terms of convergence rate while maintaining the solution quality.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133801005","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}
Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141417
Sedigheh Nader Abadi, Hadi Aghassi, E. Roghanian
In this paper, we present a genetic algorithm (GA) for Project Time-Cost Trade-off Scheduling (TCTS) Problem. A piecewise linear function estimates convex non-linear time-cost relation. In the proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. The gene value is encoded as the mode index which is selected from among modes of the activity randomly. For indicating construction mode of the activity, integer encoding is applied instead of binary encoding. Additionally, the selection of genes for mutation is based on chromosome value, as solution convergence rate is high. The crossover operator of GA is based on a two-point method. This paper also offers a multi-attribute fitness function for the problem. This function can vary by decision maker (DM) preferences (time or cost). The algorithm is described and evaluated systematically. We also used a case-study to illustrate the proposed GA that is evaluated by comparing to similar algorithms. The computational outcomes validate the effectiveness of the suggested approach.
{"title":"A multi-attribute GA for piecewise linear Time-Cost Trade-off Scheduling optimization","authors":"Sedigheh Nader Abadi, Hadi Aghassi, E. Roghanian","doi":"10.1109/WICT.2011.6141417","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141417","url":null,"abstract":"In this paper, we present a genetic algorithm (GA) for Project Time-Cost Trade-off Scheduling (TCTS) Problem. A piecewise linear function estimates convex non-linear time-cost relation. In the proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. The gene value is encoded as the mode index which is selected from among modes of the activity randomly. For indicating construction mode of the activity, integer encoding is applied instead of binary encoding. Additionally, the selection of genes for mutation is based on chromosome value, as solution convergence rate is high. The crossover operator of GA is based on a two-point method. This paper also offers a multi-attribute fitness function for the problem. This function can vary by decision maker (DM) preferences (time or cost). The algorithm is described and evaluated systematically. We also used a case-study to illustrate the proposed GA that is evaluated by comparing to similar algorithms. The computational outcomes validate the effectiveness of the suggested approach.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132932153","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
扫码关注我们
求助内容：
应助结果提醒方式：