2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies最新文献

筛选
英文 中文
A GPU Implementation of Fast Parallel Markov Clustering in Bioinformatics Using EllPACK-R Sparse Data Format 基于EllPACK-R稀疏数据格式的生物信息学快速并行马尔可夫聚类GPU实现
A. Bustamam, K. Burrage, N. Hamilton
{"title":"A GPU Implementation of Fast Parallel Markov Clustering in Bioinformatics Using EllPACK-R Sparse Data Format","authors":"A. Bustamam, K. Burrage, N. Hamilton","doi":"10.1109/ACT.2010.10","DOIUrl":"https://doi.org/10.1109/ACT.2010.10","url":null,"abstract":"The massively parallel computing using graphical processing unit (GPU), which based on tens of thousands of parallel threats within hundreds of GPU’s streaming processors, has gained broad popularity and attracted researchers in a wide range of application areas from finance, computer aided engineering, computational fluid dynamics, game physics, numerics, science, medical imaging, life science, and so on, including molecular biology and bioinformatics. Meanwhile, Markov clustering algorithm (MCl) has become one of the most effective and highly cited methods to detect and analyze the communities/clusters within an interaction network dataset on many real world problems such us social, technological, or biological networks including protein-protein interaction networks. However, as the dataset become bigger and bigger, the computation time of MCl algorithm become slower and slower. Hence, GPU computing is an interesting and challenging alternative to attempt to improve the MCl performance. In this poster paper we introduce our improvement of MCl performance based on EllPACK-R sparse dataset format using GPU computing with the Compute Unified Device Architecture tool (CUDA) from NVIDIA (called CUDA-MCl). As the results show the significant improvement in CUDA-MCl performance and with the low-cost and widely available GPU devices in the market today, this CUDA-MCl implementation is allowing large-scale parallel computation on off-the-shelf desktop machines. Moreover the GPU computing approaches potentially may contribute to significantly change the way bioinformaticians and biologists compute and interact with their data.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133628660","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
Semantic Document Annotation Ranking Model 语义文档标注排序模型
Syarifah Bahiyah Rahayu, S. Noah, Andrianto Arfan Wardhana
{"title":"Semantic Document Annotation Ranking Model","authors":"Syarifah Bahiyah Rahayu, S. Noah, Andrianto Arfan Wardhana","doi":"10.1109/ACT.2010.56","DOIUrl":"https://doi.org/10.1109/ACT.2010.56","url":null,"abstract":"With the support of semantic annotation and domain ontology, semantic web is able to assist people in querying rich documents. However, generating queried semantic documents without ranking them in a right order is ineffective. In this paper, we are extending FF-ICF algorithm with the concept spreading. For experimentation, this algorithm is applied into a research prototype retrieval engine, PicoDoc. The PicoDoc system uses corpus that has pre-annotated documents as its data reference to run query against, based on real-life dataset from ABC and BBC news article corpus. The corpus is based on OCAS2008 ontology. The experiment shows a modified FFICF-related spread concept yields promising results in retrieving related information.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125417867","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
Analysis of Machine learning Techniques Used in Behavior-Based Malware Detection 基于行为的恶意软件检测中使用的机器学习技术分析
Ivan Firdausi, Charles Lim, Alva Erwin, A. Nugroho
{"title":"Analysis of Machine learning Techniques Used in Behavior-Based Malware Detection","authors":"Ivan Firdausi, Charles Lim, Alva Erwin, A. Nugroho","doi":"10.1109/ACT.2010.33","DOIUrl":"https://doi.org/10.1109/ACT.2010.33","url":null,"abstract":"The increase of malware that are exploiting the Internet daily has become a serious threat. The manual heuristic inspection of malware analysis is no longer considered effective and efficient compared against the high spreading rate of malware. Hence, automated behavior-based malware detection using machine learning techniques is considered a profound solution. The behavior of each malware on an emulated (sandbox) environment will be automatically analyzed and will generate behavior reports. These reports will be preprocessed into sparse vector models for further machine learning (classification). The classifiers used in this research are k-Nearest Neighbors (kNN), Naïve Bayes, J48 Decision Tree, Support Vector Machine (SVM), and Multilayer Perceptron Neural Network (MlP). Based on the analysis of the tests and experimental results of all the 5 classifiers, the overall best performance was achieved by J48 decision tree with a recall of 95.9%, a false positive rate of 2.4%, a precision of 97.3%, and an accuracy of 96.8%. In summary, it can be concluded that a proof-of-concept based on automatic behavior-based malware analysis and the use of machine learning techniques could detect malware quite effectively and efficiently.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127267484","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}
引用次数: 265
Information Technology Risk Measurement Using NIST (Case Study at Pt. Pintraco) 使用NIST进行信息技术风险度量(以Pintraco公司为例)
A. Gui, R. Kristanto, Hasnah Haron, Ega Adrian
{"title":"Information Technology Risk Measurement Using NIST (Case Study at Pt. Pintraco)","authors":"A. Gui, R. Kristanto, Hasnah Haron, Ega Adrian","doi":"10.1109/ACT.2010.57","DOIUrl":"https://doi.org/10.1109/ACT.2010.57","url":null,"abstract":"The purpose of this study is to measure how big the risk level associated existing information technology at PT. Phintraco and how to minimize the risk of information technology. The research methodology used involves library research, documentation studies and interviews, collected data were analyzed using the NIST method. Results from this study indicate there are 13 types of risks that might occur, one of them at high risk (Malicious code) and there are two risks with a medium risk level (Information theft, server hangs). The conclusion was that risk controls has been applied quite good but still there are some weaknesses in it, among others: the password is not changed periodically, there is no documentation about the system, the right of access to the IT division is too free, antivirus programs inadequate.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131586069","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 Novel Static and Moving Obstacles Avoidance Method Using Bayesian Filtering for Service Robot 一种基于贝叶斯滤波的服务机器人动、静态避障方法
W. Budiharto, D. Purwanto, A. Jazidie
{"title":"A Novel Static and Moving Obstacles Avoidance Method Using Bayesian Filtering for Service Robot","authors":"W. Budiharto, D. Purwanto, A. Jazidie","doi":"10.1109/ACT.2010.51","DOIUrl":"https://doi.org/10.1109/ACT.2010.51","url":null,"abstract":"This paper presents a novel static and moving obstacles avoidance method in indoor environment for service robot. This method uses combination of information about static obstacles on the landmark, speed and direction of people that walks as moving obstacle obtained by single camera, then calculated the probability of collision using Bayesian Filtering. In this research, 2 stopping point in landmark used for efficiency in detecting and processing obstacles. By increasing/lowering the speed of robot based on the state estimation calculated before, robot able to avoid the moving obstacles. Algorithms for static and moving obstacles avoidance proposed and simulation result implemented to service robot presented. This method very robust and successfully implemented to service robot called Srikandi II that equipped with 4 DOF arm robot in our laboratory.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128982011","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
A Comparative Study of Skeletal and Keyframe Animations in a Multiplayer Online Game 多人在线游戏中骨架动画和关键帧动画的比较研究
Garry Pranatio, R. Kosala
{"title":"A Comparative Study of Skeletal and Keyframe Animations in a Multiplayer Online Game","authors":"Garry Pranatio, R. Kosala","doi":"10.1109/ACT.2010.54","DOIUrl":"https://doi.org/10.1109/ACT.2010.54","url":null,"abstract":"As the game development process is a very tedious one, a good knowledge of which game animation technique that work best in practice is very essential. In this paper we study the performance of two popular animation models – the skeletal and key frame animation models. We have done some experiments using a test bed program to measure the performance, memory usage and hard disk space used by the two animation models. Our experiment results suggest that the skeletal model has major advantages over the key frame model, both in terms of the FPS (frame per second) and the memory load. We conclude that the skeleton or bone based animation models are more suitable for multiplayer online role playing games (MORPG), where the bandwidth usage is very intensive.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278043","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
Business Process Integration Using BPEl to Create Direct Rewarding Module in loyalty Management System 在忠诚度管理系统中使用BPEl创建直接奖励模块的业务流程集成
Ryan Andhika Perdana, James Purnama
{"title":"Business Process Integration Using BPEl to Create Direct Rewarding Module in loyalty Management System","authors":"Ryan Andhika Perdana, James Purnama","doi":"10.1109/ACT.2010.36","DOIUrl":"https://doi.org/10.1109/ACT.2010.36","url":null,"abstract":"To increase the number of customer, companies create some programs. loyalty program is the one way to increase number of customer. Most of the companies merge, cooperate, and acquired with other companies that leads to integration of their system. The purpose of this research is to show an alternative solution to these integrations, an alternative that is easy to implement and undemanding in terms of time and resource. A system is designed to achieve this purpose and can handle subsystem in a different platform, especially in loyalty system to create direct rewarding module. A modeling system then created to fulfill those requirements. It created in Java and Windows platform, to prove that designed system architecture is working. Web service technology is used to provide interoperability. Business Process Execution language (BPEl) and composite design pattern are used to provide abstraction. During the research it is proved that BPEl process enabled the designed system architecture to provide direct rewarding module for loyalty system.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131735411","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
Fourier Transform of Untransformable Signals Using Pattern Recognition Technique 基于模式识别技术的不可变换信号傅里叶变换
Varun Gupta, Gavendra Singh, Manish Mittal, S. K. Pahuja
{"title":"Fourier Transform of Untransformable Signals Using Pattern Recognition Technique","authors":"Varun Gupta, Gavendra Singh, Manish Mittal, S. K. Pahuja","doi":"10.1109/ACT.2010.11","DOIUrl":"https://doi.org/10.1109/ACT.2010.11","url":null,"abstract":"In this paper we are highlighting the signals that are not Fourier transformable and give its Fourier transform using PCA (Principle Component Analysis), lDA (linear Discriminant Analysis). Such signals are step signal, signum, etc. Basically Fourier transform transforms time domain signal into frequency domain and after transformation describes what frequencies original signal have. Principle Component Analysis is a way of identifying patterns (recognition) in the data and the differences of the data is highlighted. With the help of PCA & lDA we do the dimension reduction of the signal. lDA is used in statistics and machine learning to find a linear combination of features which characterize or separate two or more classes of objects or events. The resulting combination may be used as a linear classifier or, more commonly, for dimensionality reduction before later classification. lDA is closely related to anova (analysis of variance). PCA is used for analyzing. Main advantage of PCA is that once patterns are found and data is compressed that is by reducing the number of dimension without much loss of information. Dimension reduction is the process of reducing the number of random variables under consideration, and can be divided into feature selection and feature extraction. Feature selection approaches try to find a subset of the original variables and feature extraction transforms the data in the high-dimensional space to a space of fewer dimensions.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122650635","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
Using Pattern Matching in the 1-D Domain of Chain Code Signals for the Compression of Binary Printed Farsi and Arabic Textual Images 利用链码信号一维域的模式匹配压缩二值印刷波斯语和阿拉伯语文本图像
Esmaeil Shojaei, H. Grailu
{"title":"Using Pattern Matching in the 1-D Domain of Chain Code Signals for the Compression of Binary Printed Farsi and Arabic Textual Images","authors":"Esmaeil Shojaei, H. Grailu","doi":"10.1109/ACT.2010.23","DOIUrl":"https://doi.org/10.1109/ACT.2010.23","url":null,"abstract":"Pattern Matching is the most conventional method of binary text image compression that has been only used in the 2-D domain of textual image signals. In this paper a pattern matching technique is proposed in the 1-D domain of chain code description signal of printed binary textual Farsi-Arabic images. In printed Farsi-Arabic scripts, contrary to latin scripts, letters usually attach to each other and produce many different patterns. Hence some patterns are fully or partially subsets of others. Detecting such situations and exploiting them to reduce the number of library prototypes has a great effect on the compression efficiency. The Proposed method, contrary to the existing compression methods, has used this property for increasing the compression ratio. For the template matching part of the proposed method, we may use either the cross correlation or a proposed similarity measure which has lower computation time and better results. Experimental results show that the compression performance of the proposed method is as high as 4.5 times that of the conventional one.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122555808","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
Feedback Delay Effect on the CDMA Closed loop Power Control 反馈延迟效应在CDMA闭环功率控制中的应用
Filiyal Fahri, Dwi Astharini
{"title":"Feedback Delay Effect on the CDMA Closed loop Power Control","authors":"Filiyal Fahri, Dwi Astharini","doi":"10.1109/ACT.2010.16","DOIUrl":"https://doi.org/10.1109/ACT.2010.16","url":null,"abstract":"This paper is aimed to evaluate the effect of feedback delay on the performance of closed loop power control in CDMA System. Even though power control can mitigate the problem fluctuation due to fading, however due to the feedback delay, that advantage is invisible if this parameter is not decreased. Feedback delay is the total time that is taken by the power control from the mobile transmit signal is estimated at base station until power update command is received again at the mobile to do the transmission power update. Feedback delay worsens the performance of closed loop power control. To see this effect of feedback delay, in this study we evaluated the system of closed loop at three delay interval, i.e. 1Tp (Tp=power control interval), 2Tp and 3Tp. Performance of power control subject to feedback delay would be evaluated in term of bit error rate (BER) as a function of bit energy Eb to interference power spectral density I0 (Eb/I0). The simulation results have shown that the feedback delay cause the performance of system is degraded even at feedback delay of 3Tp, the performance is drop until the system performance without power control. By joining analysis between feedback delay and selecting step size, we have found the tradeoff between step size=1 dB and 2 dB in specific feedback delay.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"398 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132081685","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学术官方微信