Int. J. Adv. Comp. Techn.最新文献_第7页

Constructive Dynamic Program Slicing Research 建设性动态程序切片研究

Int. J. Adv. Comp. Techn. Pub Date : 2010-06-30 DOI: 10.4156/IJACT.VOL2.ISSUE2.1

J. Korpi, Jussi Koskinen

{"title":"Constructive Dynamic Program Slicing Research","authors":"J. Korpi, Jussi Koskinen","doi":"10.4156/IJACT.VOL2.ISSUE2.1","DOIUrl":"https://doi.org/10.4156/IJACT.VOL2.ISSUE2.1","url":null,"abstract":"Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the theory of slicing. However, slicing is still not widely applied in software industry. Therefore, there is a need to survey and characterize the conducted research and to analyze what problems hinder progress. This paper answers to that need by providing a survey of constructive dynamic program slicing research focusing on publication series with high visibility. The survey identified 12 dynamic slicers related to which 12 aspects were studied. The analysis revealed many issues which can be seen both as concerns and possibilities for improvements. These included the following: 1) Scarcity of high-visibility journal articles. 2) General lack of focus of the conducted research. 3) Limitations regarding the supported programming languages. 4) Mainly unutilized potential synergy with established research regarding various aspects; including visualization and navigation features. 5) Limitations of the conducted empirical studies. Paying attention to these issues is important for being able to make faster scientific progress in the area and to have bigger practical impact on software industry in the future.","PeriodicalId":433032,"journal":{"name":"Int. J. Adv. Comp. Techn.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276241","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

Research on Two-layer Location-Routing Problem and Optimization Algorithm 两层定位路由问题及优化算法研究

Int. J. Adv. Comp. Techn. Pub Date : 2010-06-30 DOI: 10.4156/IJACT.VOL2.ISSUE2.9

Li Jin, Yunlong Zhu, Hai Shen, T. Ku

引用次数: 8

Creating Challengeable and Satisfactory Game Opponent by the Use of CI Approaches 使用CI方法创造具有挑战性和令人满意的游戏对手

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.4

Suoju He, Yuan Gao, Jiajian Yang, Yiwen Fu, Xiao Liu

{"title":"Creating Challengeable and Satisfactory Game Opponent by the Use of CI Approaches","authors":"Suoju He, Yuan Gao, Jiajian Yang, Yiwen Fu, Xiao Liu","doi":"10.4156/IJACT.VOL2.ISSUE1.4","DOIUrl":"https://doi.org/10.4156/IJACT.VOL2.ISSUE1.4","url":null,"abstract":"The goal for video game AI (artificial intelligence) is to generate AI that is both challengeable and satisfactory. Most existing game AI is implemented by FSM (finite state machine) which has drawbacks in the three respects: requirement of designer’s intensive participation; no existence of meta-programming; no planning and looking forward. Contributions of the paper is to propose CI (computational intelligence) as an approach to create both challengeable and satisfactory game opponents better than using FSM in the above three respects. During the research, two prey and predator genre games of Dead-End and Pac-Man are used as test-beds to prove the proposed theory. To create a challengeable game opponent, we proposed two CI approaches: “CI-controlled-NPC” and “knowledge-based-CI-controlled-NPC”. As the latter is based on knowledge and is more computational resource efficient than the former, so the latter is more applicable for multi-player online games, while the former is only applicable for standalone PC game. To create a satisfactory game opponent, is to optimize player’s experience through the creation of an even game. To better satisfy the player, we proposed two CI-based DDAs (Dynamic Difficulty Adjustment): DDA by “timeconstrained-CI” and DDA by “knowledge-based-time-constrained-CI”; both of which outperform the existing DDA. As the latter is based on knowledge and more computational resource efficient than the former, so it is more applicable for multi-player online games, while the former is only applicable for standalone PC game.","PeriodicalId":433032,"journal":{"name":"Int. J. Adv. Comp. Techn.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818714","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}

引用次数: 12

Fast Scene Change Detection in Surveillance Systems Using ANOVA on Color Histogram 基于颜色直方图方差分析的监控系统快速场景变化检测

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.6

R. Rahman, Joydip Saha, A. Mubin

引用次数: 1

Face Recognition Using Matrix Decomposition Technique Eigenvectors and SVD 基于矩阵分解技术的人脸识别。特征向量与奇异值分解

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.5

A. N. M. Rezaul, Karim Thwarique, A. N. M. Rezaul Karim

引用次数: 7

Packaged HTTP: Reconsidering Web Efficiency 打包HTTP:重新考虑Web效率

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.9

Nils Gruschka, Luigi Lo Iacono, Namhi Kang

引用次数: 1

Classification of Multi-Class Datasets Using 2D Membership Functions in TSK Fuzzy System 基于二维隶属度函数的TSK模糊系统多类数据集分类

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.3

L. Kaki, M. Teshnehlab, M. A. Shoorehdeli

引用次数: 0

Interacted Multiple Ant Colonies Optimization Framework: an Experimental Study of the Evaluation and the Exploration Techniques to Control the Search Stagnation 交互多蚁群优化框架:控制搜索停滞的评价与探索技术的实验研究

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.7

Alaa Aljanaby, K. Ku-Mahamud, N. Norwawi

引用次数: 22

A New Approach of Digital Subscriber Line2 Initialization Process 数字用户Line2初始化过程的新方法

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.2

Nasser N. Khmiss, Msc Huthaifa T. Akrm

{"title":"A New Approach of Digital Subscriber Line2 Initialization Process","authors":"Nasser N. Khmiss, Msc Huthaifa T. Akrm","doi":"10.4156/IJACT.VOL2.ISSUE1.2","DOIUrl":"https://doi.org/10.4156/IJACT.VOL2.ISSUE1.2","url":null,"abstract":"In this paper, a design for Asymmetric Digital Subscriber Line (ADSL)/Asymmetric Digital Subscriber Line2 (ADSL2) Initialization Process is presented which can be applied to different telephone network. Such a proposal can face the different types of noise over DSL channels, the most important types are Background and Crosstalk noises and Inter symbol interference (ISI) which is eliminated by using Time Domain Equalizer (TEQ). The Minimum Mean Square Error (MMSE) algorithm is implemented as TEQ algorithm. The initialization process where tested on American National Standard Institute (ANSI) defines 8 Carrier Serving Area (CSA) test loops for ADSL service. As a result, 9.02 Mbps and 9.42 Mbps were achieved over CSA loop-2 for ADSL and ADSL2 respectively. The TEQ efficiency for 8 CSA test loop are calculated where it achieved 93.1% of zero ISI for CSA loop-3. A comparison between Near End Cross-Talk (NEXT) and Far End Cross-Talk (FEXT) power shows that NEXT have higher power and narrow band where NEXT powers were (-45.593) dBm for all loops and FEXT were ranging from (-76.353 to -68.261) dBm for the 8 loops. Finally the results show that ADSL2 outperforms ADSL by about 400Kbps which about 1.1%.","PeriodicalId":433032,"journal":{"name":"Int. J. Adv. Comp. Techn.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385462","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

Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802, 11 Network Utilizing Error Pron-Channel 基于误差pron信道的IEEE 802,11网络中竞争终端数的卡尔曼滤波估计

Int. J. Adv. Comp. Techn. Pub Date : 2010-03-31 DOI: 10.4156/IJACT.VOL2.ISSUE1.8

H. AlSabbagh, Ali Amin

引用次数: 12