Pub Date : 2005-12-19DOI: 10.1109/ICET.2005.1558857
F. Abbas
In this work the high speed data transmitters for wireless applications has been investigated. The work reviews concepts and techniques related to the effect of modulation accuracy on high speed downlink packet access (HSDPA) radio link performance. The Error Vector Magnitude (EVM) results are simulated and discussed by using the test models without HSDPA (test model 1) and with HSDPA (test model 5) defined in 3rd generation partnership project (3gpp) [11 for RF part by introducing some non-linearity in the test signal passing through RF transmitter (RFTX) chain. In this work from the figures 5 (PSat = 10.1 dBm), 6 (PSat = 13.2 dBm) and the discussions based on 3gpp specs (EVM = 17.5 % without HSDPA and 12.5 % with HSDPA) it can be concluded that the RF TX path got to be (PSat =3.1 dBm) more linear to support the HSDPA. In1dex Terts-Communication system nonlinearities, Highspeed integrated circuits, Radio transmitters, Wireless LAN.
{"title":"High speed data transmitters for wireless applications","authors":"F. Abbas","doi":"10.1109/ICET.2005.1558857","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558857","url":null,"abstract":"In this work the high speed data transmitters for wireless applications has been investigated. The work reviews concepts and techniques related to the effect of modulation accuracy on high speed downlink packet access (HSDPA) radio link performance. The Error Vector Magnitude (EVM) results are simulated and discussed by using the test models without HSDPA (test model 1) and with HSDPA (test model 5) defined in 3rd generation partnership project (3gpp) [11 for RF part by introducing some non-linearity in the test signal passing through RF transmitter (RFTX) chain. In this work from the figures 5 (PSat = 10.1 dBm), 6 (PSat = 13.2 dBm) and the discussions based on 3gpp specs (EVM = 17.5 % without HSDPA and 12.5 % with HSDPA) it can be concluded that the RF TX path got to be (PSat =3.1 dBm) more linear to support the HSDPA. In1dex Terts-Communication system nonlinearities, Highspeed integrated circuits, Radio transmitters, Wireless LAN.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123104585","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}
{"title":"Cryptanalytic weaknesses in modern stream ciphers and recommendations for improving their security levels","authors":"S. Ullah, A. A. Tabassam, S. H. Khiyal","doi":"10.1109/ICET.2005.1558887","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558887","url":null,"abstract":"Inthis paperwediscuiss security problems insom'1e modern stream ciphers. Asweobserve somie tinmes that adesigner claims that thealgorithm designed is mnore secure butt whenitcomestoopenliteratuire we finda numberQfproblems. We discuss SNOW, Scream andRabbit. Someejforts havebeenmadeto overcome theproblems those werepointed outin these cryptosystems bvdifferent cryptanalysts. The stream ciphers arefaster andefficient thanblock ciphers butconmparatively less secure. Ouremphasis inthis paperistomak-e somecompromise on efficiency buttogetnmor-e security. IndexTerms- Streamciphers, Blockciphers, SNOW,Scream, Rabbit, chaotic.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308246","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558934
W.-R. Chaudhry, F. Meziane
The main objective of this paper is to describe the KAARE (knowledge availability, access, retrieval and extraction) system, a generic business model for knowledge extraction of semi structured and unstructured data from Web pages. The system is ontology driven and provides a set of generic tools that will enable an effective access, retrieval and filtering of information available on the World Wide Web. The interactive model is composed of five managers namely the query manager, the ontology manager, the search manager, the information manager, and the presentation manager. Each manager is responsible for carrying out the delegated tasks from which valid inferences can be made.
{"title":"Information extraction from heterogeneous sources using domain ontologies","authors":"W.-R. Chaudhry, F. Meziane","doi":"10.1109/ICET.2005.1558934","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558934","url":null,"abstract":"The main objective of this paper is to describe the KAARE (knowledge availability, access, retrieval and extraction) system, a generic business model for knowledge extraction of semi structured and unstructured data from Web pages. The system is ontology driven and provides a set of generic tools that will enable an effective access, retrieval and filtering of information available on the World Wide Web. The interactive model is composed of five managers namely the query manager, the ontology manager, the search manager, the information manager, and the presentation manager. Each manager is responsible for carrying out the delegated tasks from which valid inferences can be made.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128711166","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558883
S. Hayat, M. Niazi
The paper discusses a foraging model which accomplishes coordination obliged tasks. This is done through communication techniques and by learning from and about other agents in a confined, previously unseen environment. A new reinforcement learning technique, Q-Learning with search has been proposed. It is shown to boost the convergence of optimal paths learnt by the agents as compared to traditional QLearning. Different foraging tasks are solved requiring varying degree of collective and individual efforts using the new proposed mechanism. The model enables us to characterize the ability of agents to solve complex foraging tasks rapidly and effectively.
{"title":"Multi agent foraging - taking a step further Q-leaming with search","authors":"S. Hayat, M. Niazi","doi":"10.1109/ICET.2005.1558883","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558883","url":null,"abstract":"The paper discusses a foraging model which accomplishes coordination obliged tasks. This is done through communication techniques and by learning from and about other agents in a confined, previously unseen environment. A new reinforcement learning technique, Q-Learning with search has been proposed. It is shown to boost the convergence of optimal paths learnt by the agents as compared to traditional QLearning. Different foraging tasks are solved requiring varying degree of collective and individual efforts using the new proposed mechanism. The model enables us to characterize the ability of agents to solve complex foraging tasks rapidly and effectively.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126451859","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558925
Syeda Zahra Ali Naqvi, Shaukat Ali, Muhammad Uzair Khan
Aspect oriented programming (R.T. Alexander, et al) promises to enhance software quality by increasing the cohesion of classes and localizing both core and crosscutting concerns. The quality of software, however, can only be validated by testing the software. Testing aspect oriented programs remains just as important as testing any other software. This paper presents an analysis of the testing strategies for AOPs. Three testing strategies have been examined and their effectiveness is measured in terms of their ability to find different kind of faults as described in a fault model by R.T. Alexander, et al. Based on this analysis, conclusions have been drawn about the current state of the research in the testing of aspect oriented programs and future directions have been explored.
面向方面编程(R.T. Alexander, et al)承诺通过增加类的内聚性和对核心和横切关注点进行本地化来提高软件质量。然而，软件的质量只能通过测试来验证。测试面向方面的程序和测试其他软件一样重要。本文对aop的测试策略进行了分析。我们研究了三种测试策略，并根据R.T. Alexander等人在故障模型中描述的发现不同类型故障的能力来衡量它们的有效性。在此基础上，总结了面向方面程序测试的研究现状，并对未来的研究方向进行了探讨。
{"title":"An evaluation of aspect oriented testing techniques","authors":"Syeda Zahra Ali Naqvi, Shaukat Ali, Muhammad Uzair Khan","doi":"10.1109/ICET.2005.1558925","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558925","url":null,"abstract":"Aspect oriented programming (R.T. Alexander, et al) promises to enhance software quality by increasing the cohesion of classes and localizing both core and crosscutting concerns. The quality of software, however, can only be validated by testing the software. Testing aspect oriented programs remains just as important as testing any other software. This paper presents an analysis of the testing strategies for AOPs. Three testing strategies have been examined and their effectiveness is measured in terms of their ability to find different kind of faults as described in a fault model by R.T. Alexander, et al. Based on this analysis, conclusions have been drawn about the current state of the research in the testing of aspect oriented programs and future directions have been explored.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125244159","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558842
Z. A. Uzmi
MPLS Networks are known to provide flexibility of IP networks without compromising scalability. Guaranteed QoS in an MPLS network requires backup paths to be preset in the network. This tutorial introduces the single-layer restoration routing by placing primary as well as backup paths in MPLS networks. Our focus will be on characterizing the fault models, computing and establishing backup paths, and bandwidth sharing along such backup paths. A quick overview of MPLS routing will be provided followed by the routing information scenarios and the type of information propagated through routing protocols and their extensions. We will also cover the information locally stored at MPLS nodes that assists in efficient restoration routing and the algorithms for computing backup paths using the local and propagated infonnation. Biography: Zartash Afzal Uzmi received his B.Sc. in Electrical Engineering from UET, Taxila and M.S. and Ph.D. in Electrical Engineering from Stanford University, CA. He is currently an Assistant Professor in the Computer Science and Engineering Department at Lahore University of Management Sciences (LUMS) where he is part of the communications and networking group. Within this group, he is heading the efforts in MPLS restoration routing, Class-based preemption, and multilayer recovery. His interests lie in routing protocols, information capacity of ad hoc networks, and signal processing for communications.
{"title":"Restoration routing in multi-protocol label switching (MPLS) networks","authors":"Z. A. Uzmi","doi":"10.1109/ICET.2005.1558842","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558842","url":null,"abstract":"MPLS Networks are known to provide flexibility of IP networks without compromising scalability. Guaranteed QoS in an MPLS network requires backup paths to be preset in the network. This tutorial introduces the single-layer restoration routing by placing primary as well as backup paths in MPLS networks. Our focus will be on characterizing the fault models, computing and establishing backup paths, and bandwidth sharing along such backup paths. A quick overview of MPLS routing will be provided followed by the routing information scenarios and the type of information propagated through routing protocols and their extensions. We will also cover the information locally stored at MPLS nodes that assists in efficient restoration routing and the algorithms for computing backup paths using the local and propagated infonnation. Biography: Zartash Afzal Uzmi received his B.Sc. in Electrical Engineering from UET, Taxila and M.S. and Ph.D. in Electrical Engineering from Stanford University, CA. He is currently an Assistant Professor in the Computer Science and Engineering Department at Lahore University of Management Sciences (LUMS) where he is part of the communications and networking group. Within this group, he is heading the efforts in MPLS restoration routing, Class-based preemption, and multilayer recovery. His interests lie in routing protocols, information capacity of ad hoc networks, and signal processing for communications.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128548424","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558898
B. Kaushik, S. Sarkar, R. P. Agarwal
In this paper interconnect width is optimized for a matched condition to reduce power and delay parameters. Width optimization is done for two sets of interconnect terminating conditions viz, 1) by active gate, and 2) by passive capacitance. For a driver interconnect load model terminated by an active gate, a tradeoff exists between short circuit and dynamic power in inductive interconnects, since with wider lines dynamic power increases, but short circuit power of the load gate decreases due to reduced transient delay. Whereas, for a line terminated by a capacitor, such tradeoff does not exist. The power consumption continues to increase even with reduced transient delay for wider lines. Many of the previous researches have modeled the active gate load at terminating end by its input parasitic gate capacitance. This paper shows that such modeling leads to inaccuracy in estimation of power, and therefore non-optimal width selection, especially for large fan-out conditions.
{"title":"Terminating load dependent width optimization of global inductive VLSI interconnects","authors":"B. Kaushik, S. Sarkar, R. P. Agarwal","doi":"10.1109/ICET.2005.1558898","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558898","url":null,"abstract":"In this paper interconnect width is optimized for a matched condition to reduce power and delay parameters. Width optimization is done for two sets of interconnect terminating conditions viz, 1) by active gate, and 2) by passive capacitance. For a driver interconnect load model terminated by an active gate, a tradeoff exists between short circuit and dynamic power in inductive interconnects, since with wider lines dynamic power increases, but short circuit power of the load gate decreases due to reduced transient delay. Whereas, for a line terminated by a capacitor, such tradeoff does not exist. The power consumption continues to increase even with reduced transient delay for wider lines. Many of the previous researches have modeled the active gate load at terminating end by its input parasitic gate capacitance. This paper shows that such modeling leads to inaccuracy in estimation of power, and therefore non-optimal width selection, especially for large fan-out conditions.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133362644","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558849
S. Malik, S.A. Khan
Handwriting has continued to persist as a mean of communication and recording information in day-to-day life even with the introduction of new technologies. Handwritten information can be used as computer input once it is converted to digital form. This paper focus on Urdu online handwriting recognition system that converts user hand written information into Urdu text. The working of recognition system is based on analytical approach to segmentation for feature extraction, rule based slant analysis for slant removal and tree based dictionary search for classification. The proposed tree search technique reduces the search space up to 96.2% and is therefore significantly faster than searching techniques, in which we have to process the whole dictionary to come up with the correct answer
{"title":"Urdu online handwriting recognition","authors":"S. Malik, S.A. Khan","doi":"10.1109/ICET.2005.1558849","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558849","url":null,"abstract":"Handwriting has continued to persist as a mean of communication and recording information in day-to-day life even with the introduction of new technologies. Handwritten information can be used as computer input once it is converted to digital form. This paper focus on Urdu online handwriting recognition system that converts user hand written information into Urdu text. The working of recognition system is based on analytical approach to segmentation for feature extraction, rule based slant analysis for slant removal and tree based dictionary search for classification. The proposed tree search technique reduces the search space up to 96.2% and is therefore significantly faster than searching techniques, in which we have to process the whole dictionary to come up with the correct answer","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125684311","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558921
S.S. Khan, S. Ali, M. Jaffar-Ur-Rehman
Aspect oriented paradigm builds on the concept of separation of crosscutting concerns. The systematic activities of separation of concerns (SoC) are - identification of concerns, separation of concerns, representation of concerns, and composition of concerns. Few aspect oriented requirement engineering (AORE) models provide validation of elicited aspects by walkthroughs, inspections, or formalized procedures. In this paper, we have extended an already proposed framework to provide two levels of validation, which validates correct elicitation of concerns (aspect) from requirements. The proposed model validates the elicited aspects by graph validation.
{"title":"An enhanced framework for validation of aspectual requirements","authors":"S.S. Khan, S. Ali, M. Jaffar-Ur-Rehman","doi":"10.1109/ICET.2005.1558921","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558921","url":null,"abstract":"Aspect oriented paradigm builds on the concept of separation of crosscutting concerns. The systematic activities of separation of concerns (SoC) are - identification of concerns, separation of concerns, representation of concerns, and composition of concerns. Few aspect oriented requirement engineering (AORE) models provide validation of elicited aspects by walkthroughs, inspections, or formalized procedures. In this paper, we have extended an already proposed framework to provide two levels of validation, which validates correct elicitation of concerns (aspect) from requirements. The proposed model validates the elicited aspects by graph validation.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114764751","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 : 2005-12-19DOI: 10.1109/ICET.2005.1558938
S. Khalique, M. Jamshed, H. Suguri, H. F. Ahmad, A. Ali, M. S. Awan
Communication language is necessary for two parties to hold a meaningful conversation either between humans or agents. Explicit communication semantics are often considered essential for rich interaction between multi-agent systems. This paper describes the issues and trade-offs between OWL, (ontology Web language) and SL (semantic language) when used as semantic language for communication between agents. The comparison is done based on the factors of knowledge representation and expressive power. First part of the paper describes the expressiveness of communication between agents when SL is used as content language. Then the benefits of OWL are described before clarifying the pitfalls and issues in using it as content language for communication between agents. After the in-depth analysis of the two languages we emphasis that due to OWL compatibility and interoperability issues and lack of expressing modalities. OWL will not be a better option to be used as content language when compared with SL in agent communication language (ACL) message structure.
{"title":"Assessment of OWL and FIPA-SL as semantic language","authors":"S. Khalique, M. Jamshed, H. Suguri, H. F. Ahmad, A. Ali, M. S. Awan","doi":"10.1109/ICET.2005.1558938","DOIUrl":"https://doi.org/10.1109/ICET.2005.1558938","url":null,"abstract":"Communication language is necessary for two parties to hold a meaningful conversation either between humans or agents. Explicit communication semantics are often considered essential for rich interaction between multi-agent systems. This paper describes the issues and trade-offs between OWL, (ontology Web language) and SL (semantic language) when used as semantic language for communication between agents. The comparison is done based on the factors of knowledge representation and expressive power. First part of the paper describes the expressiveness of communication between agents when SL is used as content language. Then the benefits of OWL are described before clarifying the pitfalls and issues in using it as content language for communication between agents. After the in-depth analysis of the two languages we emphasis that due to OWL compatibility and interoperability issues and lack of expressing modalities. OWL will not be a better option to be used as content language when compared with SL in agent communication language (ACL) message structure.","PeriodicalId":222828,"journal":{"name":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235062","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
扫码关注我们
求助内容：
应助结果提醒方式：