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

2007 International Conference on Computing: Theory and Applications (ICCTA'07)最新文献

筛选
英文 中文
A Hybrid Approach to Sentence Alignment Using Genetic Algorithm 基于遗传算法的混合句子对齐方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.9
M. Gautam, R. Sinha
{"title":"A Hybrid Approach to Sentence Alignment Using Genetic Algorithm","authors":"M. Gautam, R. Sinha","doi":"10.1109/ICCTA.2007.9","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.9","url":null,"abstract":"Sentence alignment in bilingual corpora has been an active research topic in the machine translation research groups. There have been multiple works in the past to align sentences in bilingual corpus in English and European languages and some Asian languages like Chinese and Japanese. This work introduces a novel approach for sentence alignment in bilingual corpora using lexical and statistical information about the language pair using genetic algorithm. The only lexical information used in this work is a restricted form of bilingual dictionary (incomplete). The algorithm works based on the weighted sum of a set of statistical parameters and the parameter denoting degree of dictionary match. No other lexical information like part of speech tagging, chunking, n-gram statistics etc has been used in this work. Our approach has been tested for structurally dissimilar language pair of English-Hindi and is shown to yield a high performance even under noisy conditions. We compare our results with that of Microsoft alignment tool on the same corpus and we find our results to be superior","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121093954","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}
引用次数: 6
Timing Analysis of Sequential Circuits Using Symbolic Event Propagation 基于符号事件传播的时序电路时序分析
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.125
Arijit Mondal, P. Chakrabarti, P. Dasgupta
{"title":"Timing Analysis of Sequential Circuits Using Symbolic Event Propagation","authors":"Arijit Mondal, P. Chakrabarti, P. Dasgupta","doi":"10.1109/ICCTA.2007.125","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.125","url":null,"abstract":"Accurate timing information of circuits is essential for high quality designs. This paper presents a symbolic event propagation based method to determine the critical delay of digital circuits. The proposed approach considers the effect of glitches, multiple transitions and simultaneous switching on the critical delay. Our method identifies and eliminates both combinational and sequential false paths. We also consider triggering of traditional combinational false paths due to multiple transitions. The mathematical formulation makes no assumption about the start state of the finite state machine extracted from the sequential circuit. Few approximate methods have been proposed to determine the upper bound of the critical delay. A complete BDD based implementation has been made. Results on ISCAS89 benchmark circuits are presented","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125359348","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
Fast Single-Shot Multiclass Proximal Support Vector Machines and Perceptions 快速单次多类近端支持向量机与感知
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.60
Soman Kp, Loganathan R, Vijaya Ms, Ajay V, Shivsubramani K
{"title":"Fast Single-Shot Multiclass Proximal Support Vector Machines and Perceptions","authors":"Soman Kp, Loganathan R, Vijaya Ms, Ajay V, Shivsubramani K","doi":"10.1109/ICCTA.2007.60","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.60","url":null,"abstract":"Recently Sandor Szedmak and John Shawe-Taylor showed that multiclass support vector machines can be implemented with single class complexity. In this paper we show that computational complexity of their algorithm can be further reduced by modelling the problem as a multiclass proximal support vector machines. The new formulation requires only a linear equation solver. The paper then discusses the multiclass transformation of iterative single data algorithm. This method is faster than the first method. The two algorithm are so much simple that SVM training and testing of huge datasets can be implemented even in a spreadsheet","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115553388","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}
引用次数: 6
New Filter Based Unsupervised Rules for Boolean Blur Metric 基于滤波的布尔模糊度量新无监督规则
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.93
P. Shivakumara, S. Noushath, G. Kumar
{"title":"New Filter Based Unsupervised Rules for Boolean Blur Metric","authors":"P. Shivakumara, S. Noushath, G. Kumar","doi":"10.1109/ICCTA.2007.93","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.93","url":null,"abstract":"This paper presents a simple and novel no reference filter based rules for Boolean blur metric (FBBM) to classify the blurred images from the database of home photos. Our primary goal of this paper is to classify the blurred images rather than measuring degree of blurness in the image or deblur an image. Thus the name given to this approach is Boolean blur metric (BBM). The proposed approach explores new rules based on establishing the unique relationship between the arithmetic mean filter, geometric mean filter and median filter of given image with the help of canny edge detector. The metric uses the disadvantage of arithmetic mean filter and advantage of geometric mean filter and median filers to define Boolean rule. Further, we have shown that the number of canny edge components in filtered images makes difference in defining rule. Finally, the proposed approach is compared with the well known existing no reference perceptual blur metrics to show that existing metrics are not suitable for classification. In addition, the experimental results revealed that the proposed method works even for rotated and scaled images","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117015583","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}
引用次数: 5
A Noise Fading Technique for Images Highly Corrupted with Impulse Noise 一种脉冲噪声严重破坏图像的消噪技术
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.14
Indu Solomon, C. Ramesh
{"title":"A Noise Fading Technique for Images Highly Corrupted with Impulse Noise","authors":"Indu Solomon, C. Ramesh","doi":"10.1109/ICCTA.2007.14","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.14","url":null,"abstract":"A novel noise fading technique based on noise detection and median filtering is proposed in this paper. This technique can be used for denoising the images extremely corrupted with impulse noise. This paper introduces a spike detection technique (SDT) and pixel restoring median filter (PRMF) for denoising the corrupted images. The SDT is used for discriminating between corrupted and uncorrupted image pixels. The corrupted pixels are restored using PRMF technique. Our iterative denoising technique is repeated until the corrupted pixels in the recovered image reduce to zero. The performance of our denoising scheme is evaluated with salt and pepper noise and also with random impulse noise for different standard images. It is observed that the proposed denoising scheme outperforms all existing impulse-denoising schemes. This technique can also be used for color image impulse noise removal. This technique can remove very high noise up to 98% and the images denoised with our method shows improvement in terms of visual quality, PSNR value and mutual information. This scheme prevents image blurring and is computationally simple. Hence it is suitable for real-time applications","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521705","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}
引用次数: 60
Checkpointing Using Mobile Agents in Distributed Systems 在分布式系统中使用移动代理的检查点
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.37
P. Mandal, K. Mukhopadhyaya
{"title":"Checkpointing Using Mobile Agents in Distributed Systems","authors":"P. Mandal, K. Mukhopadhyaya","doi":"10.1109/ICCTA.2007.37","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.37","url":null,"abstract":"Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of O(kn) hops by all the mobile agents. A mobile agent carries O(n/k) (on the average) size data","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350600","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}
引用次数: 10
Statistics and Retrieval: Past and Future 统计与检索:过去与未来
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.122
Karen Spärck Jones
{"title":"Statistics and Retrieval: Past and Future","authors":"Karen Spärck Jones","doi":"10.1109/ICCTA.2007.122","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.122","url":null,"abstract":"Statistical approaches to document indexing and retrieval date back to the beginning of automation. This paper considers early ideas, how they developed, their status now, and the challenges to be tackled in the future","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129061732","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
Utility Based Multiple QoS Guaranteed Resource Scheduling Optimization in Grid Computing 网格计算中基于效用的多QoS保证资源调度优化
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.131
Chunlin Li, La-yuan Li
{"title":"Utility Based Multiple QoS Guaranteed Resource Scheduling Optimization in Grid Computing","authors":"Chunlin Li, La-yuan Li","doi":"10.1109/ICCTA.2007.131","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.131","url":null,"abstract":"In this paper, we consider multiple QoS based grid resource scheduling. It is heterogeneity and dynamics of the grid that make QoS problems in grid environment challenging. Computational grid's resource management must deal with various demands from users. Each of grid task agent's diverse requirements is modeled as a quality of service (QoS) dimension, associated with each QoS dimension is a utility function that defines the benefit that is perceived by a user with respect to QoS choices in that dimension. The objective of multiple QoS based grid resource scheduling is to maximize the global utility of the scheduling system. This paper proposes an iterative scheduling algorithm that is used to perform optimal multiple QoS based resource scheduling. The experiments show that optimal multiple QoS based resource scheduling involves less overhead and leads to more efficient resource allocation than no optimal resource allocation","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123398672","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}
引用次数: 5
Process Variability-Aware Statistical Hybrid Modeling of Dynamic Power Dissipation in 65 nm CMOS Designs 65纳米CMOS动态功耗统计混合建模研究
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.108
B. Harish, N. Bhat, M. Patil
{"title":"Process Variability-Aware Statistical Hybrid Modeling of Dynamic Power Dissipation in 65 nm CMOS Designs","authors":"B. Harish, N. Bhat, M. Patil","doi":"10.1109/ICCTA.2007.108","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.108","url":null,"abstract":"A generalized technique is proposed for modeling the effects of process variations on dynamic power by directly relating the variations in process parameters to variations in dynamic power of a digital circuit. The dynamic power of a 2-input NAND gate is characterized by mixed-mode simulations, to be used as a library element for 65nm gate length technology. The proposed methodology is demonstrated with a multiplier circuit built using the NAND gate library, by characterizing its dynamic power through Monte Carlo analysis. The statistical technique of response surface methodology (RSM) using design of experiments (DOE) and least squares method (LSM), are employed to generate a \"hybrid model\" for gate power to account for simultaneous variations in multiple process parameters. We demonstrate that our hybrid model based statistical design approach results in considerable savings in the power budget of low power CMOS designs with an error of less than 1%, with significant reductions in uncertainty by at least 6X on a normalized basis, against worst case design","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124146505","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}
引用次数: 5
Methods of Evaluation and Extraction of Membership Functions--Review with a New Approach 隶属函数的评价与提取方法——一种新方法综述
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.86
D. Majumder, Rupak Bhattacharyya, S. Mukherjee
{"title":"Methods of Evaluation and Extraction of Membership Functions--Review with a New Approach","authors":"D. Majumder, Rupak Bhattacharyya, S. Mukherjee","doi":"10.1109/ICCTA.2007.86","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.86","url":null,"abstract":"In fuzzy mathematics, evaluation of membership function is still a problem, as the methods for this purpose do not hold well in all aspects. The purpose of this work is to assemble and to draw an overview of them. In addition, this work consists of a new approach, which may lead to a new way. The approach is from numerical point of view with the help of statistics. There are two methods, namely (i) modified Newton's divided difference method and (ii) modified Lagrange's interpolation method","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128032822","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}
引用次数: 14
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信