2013 3rd IEEE International Advance Computing Conference (IACC)最新文献_第5页

Trust and reliability based load balancing algorithm for cloud IaaS 基于信任和可靠性的云IaaS负载均衡算法

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514196

P. Gupta, M. Goyal, P. Kumar

引用次数: 16

A translinear-based implementation of digital logic gates using only CMOS in current-mode 电流模式下仅使用CMOS的数字逻辑门的跨线性实现

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514446

J. Singh

引用次数: 0

Development of optimum addition algorithm using modified parallel hybrid signed digit (MPHSD) technique 基于改进并行混合符号数(MPHSD)技术的最优加法算法的开发

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514450

V. Awasthi, K. Raj

引用次数: 0

Effective Searching Methodology for finding relevant Paths between nodes using Qualified Bi-Directional BFS algorithm on Graph database 在图数据库中使用限定双向BFS算法寻找节点间相关路径的有效搜索方法

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514311

R. Goel, N. Srivastava, H. Chandola, B. Rohilla, S. Srivastava, R. Goudar

{"title":"Effective Searching Methodology for finding relevant Paths between nodes using Qualified Bi-Directional BFS algorithm on Graph database","authors":"R. Goel, N. Srivastava, H. Chandola, B. Rohilla, S. Srivastava, R. Goudar","doi":"10.1109/IADCC.2013.6514311","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514311","url":null,"abstract":"With the advancement of time, technology is in its booming phase. In the present era, data whether accessed over internet or the data used by any application needs to be searched effectively and then presented to the naive i.e. end user. Searching plays a vital role in fetching the data. The search by specialization and generalization are in wide practice. The linking and associations between entities are elusive. The result of searching over the entities may engender to obtain multifarious relationships between the entities. So, it is important to make a note of all the important and meaningful relations. There arises a possibility of relationship between two entities which consist of several intermediate entities. So, to distill out the essential paths, user may specify one or more intermediate entities. Learning, optimizing and analyzing existing examples aggrandizes the research scope. Backward search, Bi-Directional search, Bi-Directional breadth first search are such existing examples where relevant path is extracted between source and destination entities. In this paper, we are proposing a qualified bi-directional BFS algorithm to discover the relevant path between the two entities which passes through the intermediate node as specified by the user. Unlike the typical searching methodologies where the all the possible paths between the two entities are discovered and then later, the paths which are relevant to user are filtered out and ranked according to user's requirement, the qualified bi-directional BFS algorithm reduces the time in finding the resultant relevant path between the two entities as it considers only those nodes which contains user specified intermediate node. When the system will be developed and after its empirical evaluation, our proposed algorithm will ameliorate the searching and will also be time efficient.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168017","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

An approach for accessing data from hidden web using intelligent agent technology 一种利用智能代理技术访问隐藏web数据的方法

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514329

Lohit Singh, Dilip Kumar Sharma

引用次数: 2

Novel techniques to reduce PAPR in OFDM systems using threshold SLM 利用阈值SLM降低OFDM系统PAPR的新技术

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514279

Bahubali K. Shiragapur, U. Wali, S. Bidwai

引用次数: 15

Simulation and analysis of performance prediction in Distributed Database design using OO approach 面向对象方法在分布式数据库设计中的性能预测仿真与分析

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514420

S. Jagannatha, S. Reddy, T. Kumar, K. R. Kanth

{"title":"Simulation and analysis of performance prediction in Distributed Database design using OO approach","authors":"S. Jagannatha, S. Reddy, T. Kumar, K. R. Kanth","doi":"10.1109/IADCC.2013.6514420","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514420","url":null,"abstract":"Distributed databases have become necessity in the organizations, as applications are require data locally rather than remote locations. It is important to place data where the applications are required to process data. Data fragmentation and placement becomes a critical performance issue in Distributed Database design that has to be placed at different sites based on the usage of data. The performance of the application would become assessed and improved if it is properly fragment and allocate data during early design stages. In this paper, we proposed an algorithm by performing vertical fragmentation technique for the Distributed Database design for assessing the performance during early design stages. We simulated the algorithm with the case study. We used the proposed algorithm, Attribute Usage Matrix, and Random Number Generation technique for generating the values of Request Query, Arrival of Request, and Query generation. The Simulation results which helps the DBA to assess the performance of the proposed Distributed Database Design. The tool which helps the DBA to select the optimum design.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134154619","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

TxFlowGen: Generation of Failure Atomic transactional workflows for B2B applications TxFlowGen: B2B应用程序的故障原子事务工作流的生成

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514425

K. Rajaram, C. Babu, K. S. Murali Krishnan

{"title":"TxFlowGen: Generation of Failure Atomic transactional workflows for B2B applications","authors":"K. Rajaram, C. Babu, K. S. Murali Krishnan","doi":"10.1109/IADCC.2013.6514425","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514425","url":null,"abstract":"The Business Process Management Notation (BPMN) is a standard for business process modeling which provides notation for expressing complex business process semantics in the form of a workflow. The workflow represents an abstraction of real work as a sequence of connected steps. When multiple organizations are involved in offering a service to the consumers, workflow can be used to define the execution order of the processes. Whenever, a workflow involves a composition of multiple services offered by different organizations, the behaviour of any given service may affect other services and the overall reliability of the workflow. A transactional workflow is considered reliable, if its execution satisfies the Failure Atomicity Requirements (FAR). For example, failure of a payment service requires undoing the order processing service that has been completed already. Thus, it is necessary to represent behavioural dependencies among the constituent services of the workflow and generate its FAR which is useful for checking the reliability of the workflow. However, existing workflow generation tools and methodologies do not model the transactional workflows which depict the transactional dependencies among the services involved in the workflows. Towards fulfilling this need, the present work proposes a pattern based modeling approach to construct transactional workflows. This approach involves the identification of FAR of each service in the workflow.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133079848","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

Change impact analysis and its regression test effort estimation 变更影响分析及其回归测试工作量估计

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514435

Prateek Khurana, Aprna Tripathi, D. S. Kushwaha

{"title":"Change impact analysis and its regression test effort estimation","authors":"Prateek Khurana, Aprna Tripathi, D. S. Kushwaha","doi":"10.1109/IADCC.2013.6514435","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514435","url":null,"abstract":"Software maintenance is the most demanding and effort-consuming phase in software development. It has been recognized as being a tedious step in software development process. Two basic activities in software maintenance are the understanding of the system and the assessment of the potential effects of a change. A change to a system, however small, can lead to several accidental effects, which are often not obvious and easy to identify. The main purpose of impact analysis is not only to find the impact set in terms of coding elements but also in terms of effort and resources required for implementing the change so that analysts could analyze the impact of the requested change in terms of budget. The objective of this paper is to find the impact set of the change requested by user or client. By using the impact set we estimate the regression test effort. We illustrate our results with a case study. As the results of this work, we get the impact set having impact element as class names with respect to the requested change, the test suite and the effort required for regression testing after the implementation of the requested change.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133531675","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

Cost performance analysis of intrusion detection system in mobile wireless ad-hoc network 移动无线自组网中入侵检测系统的性价比分析

2013 3rd IEEE International Advance Computing Conference (IACC) Pub Date : 2013-05-13 DOI: 10.1109/IADCC.2013.6514283

A. K. Pinnaka, D. Tharashasank, V. S. K. Reddy

引用次数: 5