2010 IEEE 2nd International Advance Computing Conference (IACC)最新文献

筛选
英文 中文
A methodology for building safer software based critical computing systems 构建基于关键计算系统的更安全软件的方法学
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422901
S. P. Kumar, P. Ramaiah, V. Khanaa
{"title":"A methodology for building safer software based critical computing systems","authors":"S. P. Kumar, P. Ramaiah, V. Khanaa","doi":"10.1109/IADCC.2010.5422901","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422901","url":null,"abstract":"It is increasingly common to use programmable computers in applications where their failure could be life threatening and could result in extensive damage. For example, computers now have safety-critical functions in both military and civilian aircraft, in nuclear plants, and in medical devices‥ The safety aspects of computer-based systems as increasingly important as the use of software escalate because of its convenience and flexibility. Incorrect requirements have been identified as a major cause of software accidents and it appears that current software safety standards do not place a proportionate emphasis upon this causal factor. This paper reviews existing software safety standards, guidelines and other software safety documents and also examines the limitations, practical problems and issues associated with the use of current software safety standards. In this paper, a Methodology is proposed for modeling software safety based on the current software safety standards, their merits and limitations. The tasks in this proposed methodology pertains to System and software hazard analyses; Identification of software safety-critical requirements, safety-constraints based design, software safety implementation and software safety critical testing. This paper also presents a set of safety metrics that can be used to evaluate the maturity of hazard analysis processes and its interaction with the software development process. The proposed methodology was applied to a laboratory prototype safety-critical Railroad Crossing Control System (RCCS). The results showed that all safety critical operations are safe and risk free and capable of handling the contingency situations.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126932080","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
Interference-traffic aware Channel Assignment for MRMC WMNs MRMC WMNs的干扰业务感知信道分配
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422998
K. Athota, A. Negi, C. Raghavendra Rao
{"title":"Interference-traffic aware Channel Assignment for MRMC WMNs","authors":"K. Athota, A. Negi, C. Raghavendra Rao","doi":"10.1109/IADCC.2010.5422998","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422998","url":null,"abstract":"Wireless Mesh Networks (WMNs) have the potential for improving network capacity by employing multiple radios and multiple channels (MRMC). Channel Assignment (CA) is a key issue that plays vital role in defining WMN throughput by efficient utilization of available multiple radios and channels there by minimizing network interference. The two important issues that are needed to be addressed by CA algorithm are Connectivity and Interference. CA problem is proven to be NP-Hard [2] [4] even with the knowledge of network topology and traffic load. In this paper we present improvements to CLICA [2] algorithm first by extending it in ECLICA and we propose a new method based upon Minimum Spanning Tree, MSTCA algorithm. Our proposed algorithms are centralized, interference-traffic aware, routing independent, connectivity preserving algorithms. The ECLICA and MSTCA algorithms run in two phases. In the first phase they temporarily assign channels to links throughout the network. In second phase, they take feasible and necessary channel reassignment decisions for further reducing the interference and improving overall network throughput. Proposed CA algorithm assumes relatively stable traffic in the wireless mesh network. Proposed CA algorithms can be easily implemented on commodity IEEE 802.11 hardware. Our simulations demonstrate that our proposed algorithms are improvements compared to existing CLICA algorithm.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134556255","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
BER performance of OFDM-BPSK and-QPSK over Nakagami-m fading channels OFDM-BPSK和qpsk在Nakagami-m衰落信道上的误码率性能
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423031
Neetu Sood, A. Sharma, M. Uddin
{"title":"BER performance of OFDM-BPSK and-QPSK over Nakagami-m fading channels","authors":"Neetu Sood, A. Sharma, M. Uddin","doi":"10.1109/IADCC.2010.5423031","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423031","url":null,"abstract":"In this paper, the performance of OFDM-BPSK and-QPSK system in Nakagami-m channel has been reported. Here our approach is based on decomposition of Nakagami random variable into orthogonal random variables with Gaussian distribution envelopes. Results have been presented to obtain optimum value of m based on BER and SNR.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115966701","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
Evolutionary algorithmic approaches for solving three objectives task scheduling problem on heterogeneous systems 求解异构系统三目标任务调度问题的进化算法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423042
P. Chitra, S. Revathi, P. Venkatesh, R. Rajaram
{"title":"Evolutionary algorithmic approaches for solving three objectives task scheduling problem on heterogeneous systems","authors":"P. Chitra, S. Revathi, P. Venkatesh, R. Rajaram","doi":"10.1109/IADCC.2010.5423042","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423042","url":null,"abstract":"The task scheduling problem in a heterogeneous system (TSPHS) is a NP-complete problem. It is a multiobjective optimization problem (MOP).The objectives such as makespan, average flow time, robustness and reliability of the schedule are considered for solving task scheduling problem. This paper considers three objectives of minimizing the makespan (schedule length), minimizing the average flow-time and maximizing the reliability in the multiobjective task scheduling problem. Multiobjective Evolutionary Computation algorithms (MOEAs) are well suited for Multiobjective task scheduling for heterogeneous environment. The two Multi-Objective Evolutionary Algorithms such as Multiobjective Genetic Algorithm (MOGA) and Multiobjective Evolutionary Programming (MOEP) with non-dominated sorting are developed and compared for the various random task graphs and also for a real-time numerical application graph. This paper also demonstrates the capabilities of MOEAs to generate well-distributed pareto optimal fronts in a single run.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528488","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
A novel 4UATT architecture based on analysis of user usage trends of mobile devices 一种基于移动设备用户使用趋势分析的新型4UATT架构
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422933
S. Gambhir, M. Doja, Moinuddin
{"title":"A novel 4UATT architecture based on analysis of user usage trends of mobile devices","authors":"S. Gambhir, M. Doja, Moinuddin","doi":"10.1109/IADCC.2010.5422933","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422933","url":null,"abstract":"Next generation wireless networks are supposed to provide best quality services, minimum delays which results in reduce total access cost, increased coverage and more reliable wireless access to the users at anytime and anywhere. One of the most challenging problems facing deployment of 4G technology is to support quality of service (QoS). In this paper, architecture (4UATT) is proposed along with the algorithm to find out next possible point of attachment (PoA) for the purpose of call continuation which further reduces the packet delivery cost and location update cost.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684624","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
Performance measurement of a fully pipelined JPEG codec on emulation platform 全流水线JPEG编解码器在仿真平台上的性能测量
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423018
N. Tiwari, Sagar Reddy
{"title":"Performance measurement of a fully pipelined JPEG codec on emulation platform","authors":"N. Tiwari, Sagar Reddy","doi":"10.1109/IADCC.2010.5423018","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423018","url":null,"abstract":"This paper presents the design and performance measurement of the hardware JPEG codec on an ARM926EJS emulation base board. JPEG is one of the best compression algorithms for still images. It preserves the quality with high compression ratio. JPEG codec encodes and decodes coloured as well grey image formats. The design exploits the pipeline architecture for high throughput. Overall size of the codec is controlled by sharing the common resources between JPEG encoder and decoder. Hardware JPEG codec was synthesized for Xilinx™ Virtex II FPGA device on ARM926EJS emulation base board. The paper covers all the RTL modifications done for performance measurement. FPGA resource utilization is tabulated at post-synthesis and post-mapping stage. Real time performance measurement is done for encoder and decoder for colored and grey images.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116842758","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
Route failure tolerant multicast in mobile ad hoc networks using disjoint minimum spanning trees based on connectivity index with bandwidth constraint 基于带宽约束的不相交最小生成树的移动自组网路由容错组播
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422930
Kumar B.R Arun, Lokanatha C. Reddy, P. S. Hiremath
{"title":"Route failure tolerant multicast in mobile ad hoc networks using disjoint minimum spanning trees based on connectivity index with bandwidth constraint","authors":"Kumar B.R Arun, Lokanatha C. Reddy, P. S. Hiremath","doi":"10.1109/IADCC.2010.5422930","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422930","url":null,"abstract":"In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949547","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 bit reduction binary multiplication algorithm using vedic methods 一个有效的位减少二进制乘法算法使用吠陀方法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423043
M. Paramasivam, R. S. Sabeenian
{"title":"An efficient bit reduction binary multiplication algorithm using vedic methods","authors":"M. Paramasivam, R. S. Sabeenian","doi":"10.1109/IADCC.2010.5423043","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423043","url":null,"abstract":"An efficient technique for multiplying two binary numbers using limited power and time is presented in this paper. The work mainly focuses on speed of the multiplication operation of multipliers, by reducing the number of bits to be multiplied. The framework of the proposed algorithm is taken from Mathematical algorithms given in Vedas and is further optimized by use of some general arithmetic operations such as expansion and bit-shifting. The proposed algorithm was modeled using Verilog, a hardware description language. It was found that under a given 3.3 V supply voltage, the designed 4 bit multiplier dissipates a power of 47.35 mW. The propagation time of the proposed architecture was found to 6.63ns","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114802782","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}
引用次数: 56
Elastic registration of 2D abdominal CT images using hybrid feature point selection for liver lesions 基于混合特征点选择的二维腹部CT图像肝脏病变弹性配准
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422932
Asmita A. Moghe, J. Singhai, S. Shrivastava
{"title":"Elastic registration of 2D abdominal CT images using hybrid feature point selection for liver lesions","authors":"Asmita A. Moghe, J. Singhai, S. Shrivastava","doi":"10.1109/IADCC.2010.5422932","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422932","url":null,"abstract":"Abdominal CT images have distinct intensity distribution. This feature is used to correct local deformations in the image. Reference and study images are decomposed using wavelet decomposition. Global deformations are first corrected applying rigid registration by use of maximization of Mutual Information as the similarity measure at each level of registration hierarchy. Initially registered image and reference image are further elastically registered using landmark based elastic registration. Here landmarks or feature points are obtained by first intensity thresholding the images followed by boundary selection to obtain lesion boundaries and finally obtaining the centroid and convex hull points of lesions within the images. Convex hull points that lie on the boundary of lesions coupled with centroids of lesions are helpful in precisely identifying the lesions. An advantage of this is that lesions are enhanced to allow for deformations to be precisely determined. This is useful in improving diagnostic accuracy. The performance of algorithm is tested on a real case study of abdominal CT images with liver abscess. Considerable improvement in correlation coefficient and Signal to Noise ratio of the two images is observed.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121813637","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
MaSO: A tool for aiding the management of schedule overrun 帮助管理进度超出的工具
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422909
K. Jeet, R. Dhir, Vijay Mago, R. Minhas
{"title":"MaSO: A tool for aiding the management of schedule overrun","authors":"K. Jeet, R. Dhir, Vijay Mago, R. Minhas","doi":"10.1109/IADCC.2010.5422909","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422909","url":null,"abstract":"Curbing schedule slippage is a daunting task in software industry. This problem evolves mainly because of poor analysis of risk factors and their management. This paper aims to handle this predicament with the help of Influence Diagram (ID). The three main risk factors that adversely affect the schedule are creeping user requirements, requirement instability and use of unnecessary features in the project. An integration of impacts of these with experts' opinion and with the existing databases (consisting of probability of occurrence of risk factors) helped us to create an ID based system that is capable to model the schedule slippage. This system can be used by the software manager at any stage of software development.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298127","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
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学术官方微信