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

2006 International Conference on Advanced Computing and Communications最新文献

筛选
英文 中文
Some Implementation issues in the Fiat-Naor Broadcast Encryption Schemes Fiat-Naor广播加密方案中的一些实现问题
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289975
B. B. Amberker, P. Koulgi, M. Nirmala
{"title":"Some Implementation issues in the Fiat-Naor Broadcast Encryption Schemes","authors":"B. B. Amberker, P. Koulgi, M. Nirmala","doi":"10.1109/ADCOM.2006.4289975","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289975","url":null,"abstract":"We consider the problems of assignment of keys and construction of common key at the Broadcast center, in the zero-message and one-level broadcast encryption schemes of Fiat-Naor [1]. We propose efficient implementations of key assignment and common key construction, and estimate their complexity. We also propose, in the context of one-level schemes, a quick method for limiting the sizes of perfect hash families constructed as by Fredman, Komi 'os and Szemer 'edi [2].","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"59 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":"125347983","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
Evaluating an Obstacle Avoidance Strategy to Ant Colony Optimization Algorithm for Classification in Event Logs 基于蚁群算法的事件日志分类避障策略评价
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289972
R. Chandrasekar, R. Suresh, S. Ponnambalam
{"title":"Evaluating an Obstacle Avoidance Strategy to Ant Colony Optimization Algorithm for Classification in Event Logs","authors":"R. Chandrasekar, R. Suresh, S. Ponnambalam","doi":"10.1109/ADCOM.2006.4289972","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289972","url":null,"abstract":"Classification using ant colony optimization (ACO) algorithm provides a very good technique for users to understand the data obtained from event log files, which can further help in building a system profile and determining whether intrusions have taken place in the system. To evaluate the obstacle avoidance strategy, the parameters used are along the lines of simplicity of rules formed, number of terms present in the rules and also the predictive accuracy of the test data on the training set using the rules obtained. We have tried to analyze changes in the rule formation process for different thresholds, and for different times within the process of generating rules. We show through our evaluation that the obstacle avoidance strategy to ACO performs better than the popular ant-miner algorithm by building simple rules with an improved predictive accuracy.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"121 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":"116714883","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
Automatic Generation of BPEL and WSDL from FSM models of Web Services 从Web服务的FSM模型自动生成BPEL和WSDL
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289932
H. Mohanty, D. Chenthati, S. Vaddi, R. Shyamasundar, R. K. Ghosh
{"title":"Automatic Generation of BPEL and WSDL from FSM models of Web Services","authors":"H. Mohanty, D. Chenthati, S. Vaddi, R. Shyamasundar, R. K. Ghosh","doi":"10.1109/ADCOM.2006.4289932","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289932","url":null,"abstract":"The work reported here proposes annotated FSM (AFSM) to model Web services. It also proposes a method to transform such a model to executable BPEL and WSDL codes to run on BPWS4J engine. We have developed a tool HUMSA that supports the proposed modelling, orchestration and choreography of Web services.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"13 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":"116760288","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
Protecting Non-dedicated Cluster Environments by Marking Processes with Stigmata 通过标记进程来保护非专用集群环境
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289865
M. Kacer, P. Tvrdík
{"title":"Protecting Non-dedicated Cluster Environments by Marking Processes with Stigmata","authors":"M. Kacer, P. Tvrdík","doi":"10.1109/ADCOM.2006.4289865","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289865","url":null,"abstract":"This paper proposes mechanisms for the protection of high-performance systems that are built of non-dedicated workstations. Such workstations may potentially be under control of malicious users that may gain complete control over the processes running there. The protection is achieved by a careful assignment of processes to computing nodes. If a process runs on a workstation with limited credibility, it receives a \"stigma \" that prevents it to access sensitive data. If it later attempts such an access, a process rollback is used to repeat the execution on a more trusted node. By implementing these mechanisms, it is possible to utilize idle computing resources without exposing sensitive data to untrusted persons.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"176 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":"122760087","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
Mammography Feature Selection using Rough set Theory 基于粗糙集理论的乳房x光特征选择
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289892
A. Pethalakshmi, K. Thangavel, P. Jaganathan
{"title":"Mammography Feature Selection using Rough set Theory","authors":"A. Pethalakshmi, K. Thangavel, P. Jaganathan","doi":"10.1109/ADCOM.2006.4289892","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289892","url":null,"abstract":"Microcalcification on X-ray mammogram is a significant mark for early detection of breast cancer. Texture analysis methods can be applied to detect clustered microcalcification in digitized mammograms. In order to improve the predictive accuracy of the classifier, the original number of feature set is reduced into smaller set using feature reduction techniques. In this paper rough set based reduction algorithms such as , Quickreduct (QR) and proposes Modified Quickreduct (MQR) are used to reduce the extracted features. The performance of both algorithms is compared. The Gray Level Co-occurrence Matrix (GLCM) is generated for each mammogram to extract the Haralick features as feature set. The reduction algorithms are tested on 161 pairs of digitized mammograms from Mammography Image Analysis Society (MIAS) database.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"16 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":"132659029","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}
引用次数: 9
The Characterization of the Wideband and Ultra-Wideband Mobile Channels and Their Equalization using Neuro-Fuzzy Techniques 宽带和超宽带移动信道的表征及其神经模糊均衡技术
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289912
K. Raveendranathan, M. Harisankar, M. D. Kaimal
{"title":"The Characterization of the Wideband and Ultra-Wideband Mobile Channels and Their Equalization using Neuro-Fuzzy Techniques","authors":"K. Raveendranathan, M. Harisankar, M. D. Kaimal","doi":"10.1109/ADCOM.2006.4289912","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289912","url":null,"abstract":"The 3G mobile and 4G mobile systems have generated ever-increasing interest over the last few years, fuelled by a demand for high frequency utilization and a large number of users requiring simultaneous multidimensional high data rate access for applications of wireless Internet and e-commerce. The characterization of mobile cellular channels and their equalization had been a topic of intense research the world over. We have linear time variant (LTV) models of channels appropriate for different classes/generations of systems like GSM, CDMA, and WCDMA. The need for more bandwidth resulting from the proliferation of users demands better ways to model the mobile channel and mitigate the aggravated co-channel interference (CCI). In this paper we present a novel approach for the modeling of mobile cellular channels in the wideband and ultra wideband frequencies. It should be noted that at the above frequency bands, the channel impulse response is both frequency dependent and time varying. The classical methods support narrow band characterization of these channels especially when parameter spread of channel matrix is less significant. Neuro-fuzzy modeling provides for a higher spread of these parameters making the wideband analysis easier. Therefore the use of Neuro-Fuzzy model for the channel equalizer design is more elegant and simple. Simulations do indicate that this paradigm is indeed valid.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"145 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":"132110119","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}
引用次数: 0
Formally Verifying the Distributed Shared Memory Weak Consistency Models 分布式共享内存弱一致性模型的正式验证
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289935
Venkateswarlu Chennareddy, J. Deka
{"title":"Formally Verifying the Distributed Shared Memory Weak Consistency Models","authors":"Venkateswarlu Chennareddy, J. Deka","doi":"10.1109/ADCOM.2006.4289935","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289935","url":null,"abstract":"A specification and verification methodology for distributed shared memory (DSM) consistency models specifically weak consistency model is proposed. For this, we designed and implemented abstract DSM System. In DSM system, sequential consistency unnecessarily reduces the performance of the system because it does not allow to reorder or pipeline the memory operations. Relaxed memory consistency allows reordering of memory events and buffering or pipelining of memory accesses. So that relaxed consistency improves the performance of the DSM system. For any critical system, it is very important to develop methods that increase our confidence in the correctness of such systems. One of such methods for checking the correctness of critical system is formal verification. For verification of weak consistency models we specify the weak consistency properties and are verified on abstract DSM system using CADP tool box.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"36 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":"134094076","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 New Segmentation Method using Watersheds on Grey Level Images 一种新的灰度图像分水岭分割方法
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289899
A. N. Rao, V.V. Kumar, C. Nagaraju
{"title":"A New Segmentation Method using Watersheds on Grey Level Images","authors":"A. N. Rao, V.V. Kumar, C. Nagaraju","doi":"10.1109/ADCOM.2006.4289899","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289899","url":null,"abstract":"Segmentation is one of the most challenging tasks in image processing as it requires to some extent a semantic understanding of the image. The morphological segmentation paradigm, based on the watershed transform and markers has been extremely successful, both for interactive as for automatic segmentation. Though many algorithms were proposed for watersheds in the literature, but most of them are based on binary images, for finding water catchments basins. In the present study a new method of finding watersheds on grey level image is proposed on 5X5 and 3X3 masks. To count the number of watersheds on grey levels, a new scheme is proposed for selecting the height of the peak points from where water starts falling, to the central point. The algorithm is applied on human images and textures and a good segmentation is resulted. The present study compares the proposed segmentation scheme with number of watersheds taken into account on different mask sizes.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","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":"130324708","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
Mutual Authentication and Key Agreement based on Elliptic Curve Cryptography for GSM GSM中基于椭圆曲线密码的相互认证和密钥协议
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289879
K. Ammayappan, A. Saxena, A. Negi
{"title":"Mutual Authentication and Key Agreement based on Elliptic Curve Cryptography for GSM","authors":"K. Ammayappan, A. Saxena, A. Negi","doi":"10.1109/ADCOM.2006.4289879","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289879","url":null,"abstract":"In this paper we propose an improvement to the GSM authentication protocol, based on Elliptic Curve Cryptography. The proposed protocol offers enhanced security since it does not use A5/0, A5/1 and A5/2 algorithms which have been already broken. The proposed protocol provides mutual authentication, requires less storage, avoids replay attack and consumes smaller network bandwidth.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"7 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":"116755177","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}
引用次数: 21
Average-Based Workload Allocation Strategy for QoS-Constrained Workflow-based Jobs in a Web Service-Oriented Grid 面向服务的Web网格中qos约束工作流作业的基于平均的工作负载分配策略
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289983
Y. Patel, J. Darlington
{"title":"Average-Based Workload Allocation Strategy for QoS-Constrained Workflow-based Jobs in a Web Service-Oriented Grid","authors":"Y. Patel, J. Darlington","doi":"10.1109/ADCOM.2006.4289983","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289983","url":null,"abstract":"The success of Web services has influenced the way in which Grid applications are being written. Web services are increasingly used as a means to realise service-oriented distributed computing. Grid users often submit their applications in the form of workflows with certain Quality of Service (QoS) requirements imposed on the workflows. These workflows detail the composition of Web services and the level of service required from the Grid. This paper addresses workload allocation techniques for Grid workflows. We model a web service as a G/G/1 queue and minimise failures (QoS requirement violation) of jobs by solving a mixed-integer non-linear program (MINLP). The novel approach is evaluated through an experimental simulation and the results confirm that the proposed workload allocation strategy performs considerably better in terms of satisfying QoS requirements of Grid workflows than scheduling algorithms that don't employ such workload allocation techniques.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"44 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":"117167065","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
首页 上一页 下一页 尾页
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学术官方微信