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

2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation最新文献

筛选
英文 中文
Performance Analysis of a Non-preemptive Dynamic Soft Real Time Scheduler Using Discrete Event Simulator 基于离散事件模拟器的非抢占式动态软实时调度程序性能分析
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.19
Z. Khalib, Badlishah R. Ahmad, Ong Bi
{"title":"Performance Analysis of a Non-preemptive Dynamic Soft Real Time Scheduler Using Discrete Event Simulator","authors":"Z. Khalib, Badlishah R. Ahmad, Ong Bi","doi":"10.1109/CIMSIM.2012.19","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.19","url":null,"abstract":"Increasing Deadline Meeting Rate (DMTR) during overload is a concern of Soft Real Time (SRT) Scheduling. Here we present our non-preemptive non-resource constraint scheduling model implemented on an open source discrete event simulator named OmNET. The model is simple, yet it fulfill the simulation purpose, which mimics execution of jobs schedule under non-preemptive and non-resource constraint system within usual real time timing parameters namely release time, execution time, deadline and period. We show that OmNET is capable to be used as a real time scheduling simulator. Along with, we also present the approach we undertook to design our novel SRT scheduling algorithm. The simulation result presented here shows the effect of Deadline Tolerance (SRT parameter) and Deadline size on DMTR. We conclude that our algorithm named gutEDF could produce higher DMTR as compared to Earliest Deadline First (EDF) algorithm during overload while maintaining optimum performance under normal load.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292248","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
Interaction of Surface Roughness and Copper Ball Adhesion Using Shearing Simulation 基于剪切模拟的表面粗糙度与铜球粘附的相互作用
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.87
V. Retnasamy, Z. Sauli, A. Shapri, S. Taniselass, R. Vairavan, N. Ramli
{"title":"Interaction of Surface Roughness and Copper Ball Adhesion Using Shearing Simulation","authors":"V. Retnasamy, Z. Sauli, A. Shapri, S. Taniselass, R. Vairavan, N. Ramli","doi":"10.1109/CIMSIM.2012.87","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.87","url":null,"abstract":"Wire bonding is one of the commanding interconnection techniques used at the back end of line due to its vast adaptability to the advancing trend of circuit designs. Wire bond shear test method is utilized to examine adhesion strength of the bonded wires. In this paper, the stress response of copper ball bond during wire bond shear test is investigated The influences of three types of bond pad surface; flat surface, hemisphere surface and sharp groove surface on the stress response of copper ball bond during wire bond shear test were evaluated. The simulation was done using Ansys version 11.The simulation results showed the bond pad surface had a significant influence on the stress response of copper ball bond. At the shear ram displacement distance of 35μm, the peak stress responses for all three bond pad surface were obtained.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091399","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
Retrieving the Correct Information: Channel Coding Reliability in Error Detection and Correction 检索正确的信息:错误检测和纠错中的信道编码可靠性
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.90
T. Adam, U. Hashim, U. S. Sani
{"title":"Retrieving the Correct Information: Channel Coding Reliability in Error Detection and Correction","authors":"T. Adam, U. Hashim, U. S. Sani","doi":"10.1109/CIMSIM.2012.90","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.90","url":null,"abstract":"The Channel coding deals with error control techniques. If the data at the output of a communications system has errors that are too frequent for the desired use, the errors can often be reduced by the use of a number of techniques. Here the paper present a study on a very simple and adaptable decoder modeling algorithms which we generated the code using Matlab software and tested on three channel-coding techniques namely; Hamming code, convolution code, and uncoded technique for their reliability in error detection over another a comparisons were made between the coded and uncoded techniques and between the two coded techniques, our reliable study shows the reliability of the coded techniques over uncoded one and the reliability of convolutional coded over hamming coded technique, the comparisons were made through their error probabilities under similar constraints of power and information rate.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116021998","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
Modelling the First Step of E-governance -- A Case Study 电子政务第一步的建模——一个案例研究
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.32
M. Abdulraheem
{"title":"Modelling the First Step of E-governance -- A Case Study","authors":"M. Abdulraheem","doi":"10.1109/CIMSIM.2012.32","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.32","url":null,"abstract":"This research forms a turning point for the state of Karbala in Iraq for its great importance in serving the citizens and government institutions of this state. The benefits of this article will help in overcoming many obstacles like the difficulty of exchanging information among the government institutions and the bad routine which the citizens suffer from. It is a major step for establishing the e-government with transparency in dealing with the citizens and ends the administrative difficulties, besides it makes the citizens closer to the government. This article aims to achieve two important tasks, first: reduce the time, second: reduce the cost. By creating a team of five employees in Karbala governor ate to distribute the survey questionnaire manually and taking the sample size out of 600 persons and analysing it, the priorities of the proposed system was obtained to achieve the two tasks.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126386817","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
Effect of Named Entities in Web Page Classification 命名实体在网页分类中的作用
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.55
Sameendra Samarawickrama, L. Jayaratne
{"title":"Effect of Named Entities in Web Page Classification","authors":"Sameendra Samarawickrama, L. Jayaratne","doi":"10.1109/CIMSIM.2012.55","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.55","url":null,"abstract":"With the rapid multiplication of World Wide Web, there is an increasing requirement for automated web page classification techniques. Web page classification is an important task in web mining and is utilized in many other areas of research as well. General practice during classification is to use lexical terms as features. In this paper we investigate the effect of considering named entities as features in web page classification. We have conducted tests in five different domains â\"-baseball, football, health, politics and science â\"-with web pages collected from online news providers. Our results show that incorporating named entities can result in slight gains in classifier performance for narrow domains, but is not always true for all the domains. Results also showed that classification based only on named entities can be good for certain domains (e.g., baseball) but is still lower than the lexical terms based representation.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131910945","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
Algorithm for Identifying Writing Stroke and Direction 识别书写笔划和方向的算法
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.54
Neo Chin Chea, Eileen Su Lee Ming, P. I. Khalid, Yeong Che Fai
{"title":"Algorithm for Identifying Writing Stroke and Direction","authors":"Neo Chin Chea, Eileen Su Lee Ming, P. I. Khalid, Yeong Che Fai","doi":"10.1109/CIMSIM.2012.54","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.54","url":null,"abstract":"Handwriting difficulty is a type of learning disability that may not be detected easily and its diagnosis requires special qualification and experience. Therefore, a new evaluation method is proposed to assist in detecting handwriting problems. This method uses computerized handwriting assessment based on the identification of errors in stroke type, sequences, and direction when forming Latin alphabets. This paper discusses an algorithm to identify type and direction of stroke based on xy-coordinate inputs. The algorithm starts with classification of input into three categories of stroke patterns, which are simple straight line, complex straight line, and curve line. The type and direction of stroke will then be determined by analysis of relationship between consecutive point and also angle difference between points. The algorithm works well in classification and identification involving straight line inputs, while improvements are needed in analyzing curve lines and complex lines involving smooth corner.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131758441","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
MultiHoc: Social Communication in Multihop Ad Hoc Networks 多跳自组织网络中的社会通信
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.45
R. Nagrani, A. Patel
{"title":"MultiHoc: Social Communication in Multihop Ad Hoc Networks","authors":"R. Nagrani, A. Patel","doi":"10.1109/CIMSIM.2012.45","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.45","url":null,"abstract":"MultiHoc is a prototype application providing the services of social networking with a completely distributed multihop approach in Mobile Ad-hoc Networks (MANETs). Using an infrastructureless multihop concept, this system allows a user to connect with others who are not in the same network as our user. Users can IM amongst themselves, establish a Video/Audio call, stream media, transfer and store information, and discover the various types of services available around them. MultiHoc caters to the user's need of connecting to multiple networks simultaneously by virtualizing a single wireless card present in the user's system.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436249","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
Noise Estimation by Utilizing Mean Deviation of Smooth Region in Noisy Image 利用噪声图像中平滑区域的平均偏差进行噪声估计
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.89
S. Sari, H. Roslan, T. Shimamura
{"title":"Noise Estimation by Utilizing Mean Deviation of Smooth Region in Noisy Image","authors":"S. Sari, H. Roslan, T. Shimamura","doi":"10.1109/CIMSIM.2012.89","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.89","url":null,"abstract":"In many practical cases of image processing, only a noisy image is available. Many image denoising methods usually require the exact value of the noise distribution as an essential filter parameter. However, to estimate the noise solely from the information of the noisy image is a difficult task. A simple but accurate noise estimator would significantly benefit many image denoising methods. In this paper, we present a method to estimate additive noise by utilizing the mean deviation of a smooth region selected from a noisy image. The noise distribution is estimated by computing the average mean deviation of all non-overlapping blocks in the smooth region. Simulation results demonstrate that our method achieves accurate noise estimation regardless of the image characteristics over a range of noise levels. The restoration performance of a denoising technique based on our noise estimation method resembles that achieved in the ideal condition.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129626473","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}
引用次数: 22
Trading Foreign Currencies Based on Long Range Dependence 基于长期依赖的外汇交易
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.73
Han-Seung Kwon, A. Lenskiy, K. Koneva
{"title":"Trading Foreign Currencies Based on Long Range Dependence","authors":"Han-Seung Kwon, A. Lenskiy, K. Koneva","doi":"10.1109/CIMSIM.2012.73","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.73","url":null,"abstract":"The paper discusses a novel trading algorithm for trading foreign currencies. The algorithm is based on the fact that currency exchange rates exhibit long-range dependency i.e. time-series constructed of exchange rates deviates from complete randomness and contains memory. This memory can be useful in predicting future behaviors of the exchange rates. The type of correlation varies in time from positive to negative and vice versa, consequently it is important to accurately estimate correlation type. In long range dependent processes the strength and type of correlation is judge by value of so called scale exponent. Combing trend information and the estimated type of correlation we predict exchange rate behavior and thus we are able to determine best positions to sell and/or to buy. We tested the proposed trading algorithm on 8 currency pairs with the history ranging from 1.0x106 to 2.5x106 minutes where the minimum profit was 25430 pips for EURGBP pair and the maximum profit was 192070 pips for AUDCAD.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134241606","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
Extended Species Abundance Models of Biogeography Based Optimization 基于生物地理学优化的扩展物种丰度模型
2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation Pub Date : 2012-09-25 DOI: 10.1109/CIMSIM.2012.30
Lavika Goel, Daya Gupta, Vinod Panchal
{"title":"Extended Species Abundance Models of Biogeography Based Optimization","authors":"Lavika Goel, Daya Gupta, Vinod Panchal","doi":"10.1109/CIMSIM.2012.30","DOIUrl":"https://doi.org/10.1109/CIMSIM.2012.30","url":null,"abstract":"This paper is an extension to the models of species abundance in biogeography based optimization technique. We present the extended species abundance models by defining the parameter species growth rate as a function of species evolution rate and the species immigration rate and species decline rate as a function of species extinction rate and emigration rate for the determination of the total species count at a given time instant on a single habitat, as opposed to the Simon's model which relies upon migration only for the determination of the species count. We also introduce an additional dependency factor which signifies the interdependence of migrating species on each other such as the predator-prey relationships, to be considered for the determination of immigration and emigration rates and hence further extend the original model of species abundance in a single habitat. We discuss the extended BBO and its mathematics and then go on to present the extended forms of each of the six representative migration models that were originally proposed by Haiping Ma as an extension to the work by Simon. We demonstrate the performance of each of the extended models of BBO by running them on standard benchmark functions and found that the average convergence of each of the proposed extended species abundance models is faster leading to better optimization results than the original species abundance model of BBO.","PeriodicalId":435030,"journal":{"name":"2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132851409","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}
引用次数: 11
首页 上一页 下一页 尾页
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学术官方微信
小红书