发布求助
文献互助 智能选刊 最新文献

2006 IEEE International Multitopic Conference最新文献

筛选
英文 中文
Urdu Domain Names 乌尔都语域名
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358181
S. Hussain, Nadir Durrani
{"title":"Urdu Domain Names","authors":"S. Hussain, Nadir Durrani","doi":"10.1109/INMIC.2006.358181","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358181","url":null,"abstract":"With of international standards, including Unicode, CLDR, HTML, etc., it is now becoming increasingly possible to develop and deploy online content in local languages across the globe. However, a user is still required to write the domain name in Latin script to access this information on the Internet, which still a barrier for non-Latin script based language speakers. This paper overviews the emerging Internationalized Domain Name (IDN) standards being proposed by Internet Corporation for Assigned Names and Numbers (ICANN). The paper also discusses challenges for implementing IDN for Urdu and a possible solution which has been implemented and is currently deployed","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"R-25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626180","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}
引用次数: 4
A Stability Analysis of Clustering Algorithms 聚类算法的稳定性分析
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358184
O. Maqbool, H. Babri
{"title":"A Stability Analysis of Clustering Algorithms","authors":"O. Maqbool, H. Babri","doi":"10.1109/INMIC.2006.358184","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358184","url":null,"abstract":"The use of clustering for developing a description of a software system's architecture is fairly recent. Thus there is a need to evaluate various clustering algorithms and identify the ones which are expected to give good results for software. A criterion that can be used for evaluation is stability. A clustering algorithm is said to be stable if its output i.e. the clusters it produces, do not change drastically when small changes are made to the input data. The notion of stability is especially important when a software clustering algorithm is used to build a high level description of a software system that is currently under development. In this paper, we compare the stability of six hierarchical clustering algorithms by carrying out experiments on three open-source software systems. We also present an analysis of the results, which provides insight into the clustering process of the various algorithms","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122294451","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}
引用次数: 1
Online Algorithms for Complete Itemset Counts Using Set-to-String Mappings 使用集合到字符串映射的完整项目集计数的在线算法
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358185
A. Jawad, A. Karim, I. Khan
{"title":"Online Algorithms for Complete Itemset Counts Using Set-to-String Mappings","authors":"A. Jawad, A. Karim, I. Khan","doi":"10.1109/INMIC.2006.358185","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358185","url":null,"abstract":"We present two algorithms for maintaining the exact counts of all itemsets over a stream of transactions. The count of each subset in a transaction is maintained by mapping it to substrings of the alphabet. This technique allows efficient time processing of the items in a single pass over the data stream. The two algorithms differ in their mapping schemes and data structures. The first algorithm performs prefix-based-scan of each transaction taken as a Boolean string, while the second algorithm improves on the first by exploiting the capability of suffix tree like structure for online enumeration of transaction suffixes. Correctness proofs and theoretic bounds on time and space complexity of these algorithms are presented. The algorithms are implemented and evaluated on several synthetic datasets. The results confirm that these algorithms are well suited to association rule mining over data streams for many practical business applications.","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467094","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}
引用次数: 2
Using Recurrent Neural Networks for Circuit Complexity Modeling 利用递归神经网络进行电路复杂性建模
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358161
A. Beg, P.W. Chandana Prasad, M.M. Arshad, K. Hasnain
{"title":"Using Recurrent Neural Networks for Circuit Complexity Modeling","authors":"A. Beg, P.W. Chandana Prasad, M.M. Arshad, K. Hasnain","doi":"10.1109/INMIC.2006.358161","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358161","url":null,"abstract":"Being able to model the complexity of Boolean functions in terms of number of nodes in a binary decision diagram can be quite useful in VLSI/CAD applications. Our investigation showed that it is possible to use the recurrent neural network (RNN) models for the prediction of circuit complexity. The modeling results matched closely with simulations with an average error of less than 1 %. The correlation coefficient between RNN's predictions and actual results for ISCAS benchmark circuits was 0.629.","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134554959","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}
引用次数: 8
An Efficient Analytical Technique for Fast and Accurate Modeling of Substrate Coupling in Mixed-Signal IC's 混合信号集成电路中衬底耦合快速准确建模的有效分析技术
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358217
H. Moradzadeh, G. Karimi
{"title":"An Efficient Analytical Technique for Fast and Accurate Modeling of Substrate Coupling in Mixed-Signal IC's","authors":"H. Moradzadeh, G. Karimi","doi":"10.1109/INMIC.2006.358217","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358217","url":null,"abstract":"Substrate coupling noise is a key problem in today's large mixed-signal systems. This noise is caused by the coupling of digital part and can perturb analog circuits through common substrate. The estimating and accurate modeling of noise coupling effects is a main challenge for designers. In this paper, we describe a method to quickly and accurately estimate substrate coupling effects based on Maxwell's equations and the integral solution for parasitic extraction. Examples are given which show that the proposed method is sufficiently accurate for practical circuit verification by avoiding a dense matrix storage and long computational runtime. Furthermore, a very good speedup factor is obtained when comparing our technique with other methods in the literature.","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581170","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}
引用次数: 2
High Speed Lossless Data Compression Architecture 高速无损数据压缩体系结构
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358141
R. Mehboob, S.A. Khan, Z. Ahmed
{"title":"High Speed Lossless Data Compression Architecture","authors":"R. Mehboob, S.A. Khan, Z. Ahmed","doi":"10.1109/INMIC.2006.358141","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358141","url":null,"abstract":"This paper presents a novel architecture for hardware implementation of LZ1 lossless data compression algorithm. The architecture is scalable depending upon the requirements of parallel comparisons. Several instances of the design are synthesized on an FPGA for 1 Gbits/sec and higher data rates. With the increase in network traffic, large scale digital data storage/retrieval and the requirement for preserving communication channel bandwidth, data compression is receiving enormous attention. For real time applications, hardware implementation of data compression algorithms seems imperative and the only viable solution","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734468","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}
引用次数: 15
Genetic Algorithm Based Path Planning and Optimization for Autonomous Mobile Robots with Morphological Preprocessing 基于遗传算法的自主移动机器人形态预处理路径规划与优化
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358159
F. A. Afsar, M. Arif, M. Hussain
{"title":"Genetic Algorithm Based Path Planning and Optimization for Autonomous Mobile Robots with Morphological Preprocessing","authors":"F. A. Afsar, M. Arif, M. Hussain","doi":"10.1109/INMIC.2006.358159","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358159","url":null,"abstract":"This paper presents an algorithm for optimal path planning for mobile robots using genetic algorithms coupled with morphological image preprocessing of the terrain. Path planning in a given environment, being a NP-hard problem, is computationally demanding especially if exact or deterministic techniques are employed. This paves the way for the use of evolutionary computing techniques, such as genetic algorithms (GAs), for the solution of this problem. However as GAs tend to find optimal paths without considering the location and distribution of obstacles in the given map, therefore a large amount of time may be spent before even a feasible path is found. The technique conferred in this paper overcomes this shortcoming by using specialized morphological preprocessing techniques applied on the landscape representative image. The results obtained on a variety of structured, unstructured and clustered terrains indicate the efficacy of the algorithm presented and the potential for the use of this algorithm in real-time operation of mobile robots","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129784278","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}
引用次数: 7
Analysis of Low Side Lobe Reflector Antenna 低旁瓣反射天线分析
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358197
Shahnaz Bibi, Nadeem Faisal, Xie Shuguo
{"title":"Analysis of Low Side Lobe Reflector Antenna","authors":"Shahnaz Bibi, Nadeem Faisal, Xie Shuguo","doi":"10.1109/INMIC.2006.358197","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358197","url":null,"abstract":"With the advent of communication and satellite industry, the need for efficient reflector antenna system has increased tremendously and vast research is undergoing to develop new schemes for analysis and design of reflector antennas more efficiently and accurately. Good sidelobe suppression is required especially in the radar and communication applications from the point of view of reducing mutual unintentional interference as well as deliberate jamming. The principal limitations on the side lobe performance of reflector antennas arise as a consequence of aperture blocking, scattering effects, the feed illumination on the reflector surface, reflector surface errors and feed misalignments. Detailed analysis of these limitations has been carried out in this paper.","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130013897","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}
引用次数: 3
Analytical Hierarchy Process Approach to Rank Measures for Structural Complexity of Conceptual Models 层次分析法用于概念模型结构复杂性的排序度量
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358173
T. Hussain, A. Tahir, M. Awais, S. Shamail
{"title":"Analytical Hierarchy Process Approach to Rank Measures for Structural Complexity of Conceptual Models","authors":"T. Hussain, A. Tahir, M. Awais, S. Shamail","doi":"10.1109/INMIC.2006.358173","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358173","url":null,"abstract":"This paper presents the result of a controlled experiment conducted to determine the relative importance of some measures, identified in research, for the structural complexity of entity-relationship (ER) models. The relative importance amongst these measures is calculated by applying the analytical hierarchy process approach. The results reveal that the number of relations in an ER diagram are of the highest importance in measuring the structural complexity in terms of understandability, analyzability and modifiability; whereas, the number of attributes do not play an important role. The study presented here can lead to developing quantitative metrics for comparing the quality of alternative conceptual models of the same problem","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128857367","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}
引用次数: 2
Recognition of printed Chinese characters by using Neural Network 基于神经网络的印刷汉字识别
2006 IEEE International Multitopic Conference Pub Date : 2006-12-01 DOI: 10.1109/INMIC.2006.358156
A. Khawaja, S. Tingzhi, N. Memon, A. Rajpar
{"title":"Recognition of printed Chinese characters by using Neural Network","authors":"A. Khawaja, S. Tingzhi, N. Memon, A. Rajpar","doi":"10.1109/INMIC.2006.358156","DOIUrl":"https://doi.org/10.1109/INMIC.2006.358156","url":null,"abstract":"The main driving force behind neural network research is the desire to create a machine that works similar to the manner our own brain works. Neural networks have been used in a variety of different areas to solve a wide range of problems. Unlike human brains that can identify and memorize the characters like letters or digits; computers treat them as binary graphics. Therefore, algorithms are necessary to identify and recognize each character. In this article, we are going to look at a method for \"printed Chinese character recognition\". This article presents a technique for the recognition of printed Chinese characters using back propagation algorithm. A back propagation network consists of at least three layers of units, an input layer, at least one intermediate hidden layer, and an output layer. When a back propagation network is cycled, an input pattern is propagated forward to the output units through the intervening input-to-hidden and hidden-to-output weights. The article also discusses Chinese character recognition using preprocessing, projection and zoning feature extraction. The proposed methodology has been successfully implemented in an experimental recognition system","PeriodicalId":171255,"journal":{"name":"2006 IEEE International Multitopic Conference","volume":"529 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126387806","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}
引用次数: 20
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书