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

2009 International Conference on Computational Science and Its Applications最新文献

筛选
英文 中文
Simulation Analysis of Lateral Propagation Mechanism of EGF Signaling on Cell Surface EGF信号在细胞表面横向传播机制的模拟分析
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.40
T. Naka
{"title":"Simulation Analysis of Lateral Propagation Mechanism of EGF Signaling on Cell Surface","authors":"T. Naka","doi":"10.1109/ICCSA.2009.40","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.40","url":null,"abstract":"Newly developed microscopic technology has recently made it possible to directly visualize lateral signaling events in a single cell in which the local stimulation of EGFR with EGF yields global phosphorylation of EGFR on the whole cell membrane. The putative feedback mechanism of receptor phosphorylation by ligand-free phosphorylated receptors has been proposed to explain the events. A computational model of the reaction-diffusion system (RD model) on the cell surface is constructed in order to examine the feasibility of this putative feedback mechanism. The simulation analysis reveals that the feedback mechanism in the RD model reproduces the observed lateral signal propagation for the parameter values within the physiologically available range.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125281100","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
Improving Demand Paging Performance of Compressed Filesystem with NAND Flash Memory 利用NAND闪存提高压缩文件系统的需求分页性能
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.37
Sungyong Ahn, S. Hyun, K. Koh
{"title":"Improving Demand Paging Performance of Compressed Filesystem with NAND Flash Memory","authors":"Sungyong Ahn, S. Hyun, K. Koh","doi":"10.1109/ICCSA.2009.37","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.37","url":null,"abstract":"Demand paging with NAND flash memory is an attractive memory management technique for embedded system because of its cost efficiency. However, demand paging has the page fault handling latency. To overcome this drawback, most operating systems take advantage of kernel-level read-ahead. On the contrary, in the compressed filesystem, kernel-level read-ahead degrades performance of demand paging. The main reason is that compressed filesystem has too large read-ahead miss penalty due to decompression overhead. To solve this problem, this paper proposes the conservative read-ahead technique, which improves demand paging performance of compressed filesystem. Proposed technique improves read throughput of device by bulk read from device and reduces decompression overhead of compressed filesystem by selective decompression. We implement conservative read-ahead technique by modifying CramFS and evaluate our implementation in the Linux kernel 2.6.21. Performance evaluation results show that proposed technique reduces the average major page fault handling latency by 28%.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693068","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
A Study of Super Nonlinear Motion of a Simple Pendulum and its Generalization 单摆超非线性运动的研究及其推广
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.13
H. Sarafian
{"title":"A Study of Super Nonlinear Motion of a Simple Pendulum and its Generalization","authors":"H. Sarafian","doi":"10.1109/ICCSA.2009.13","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.13","url":null,"abstract":"Two identically charged simple pendulums are dropped symmetrically about their common pivot in a vertical plane. For a set of parameters associated with each pendulum namely {mass,charge, and length} we evaluate the critical angle at which the forces acting on each pendulum are null resulting a static equilibrium. We then consider two dynamic non-equilibrium cases. In the absence of friction we analyze the features of steady oscillations of the pendulums resulting from setting the initial swing angles larger and then smaller than the critical angle. In each case, for a set of initial angles we evaluate the optimum separation angles of the charges and their corresponding acquired traversed times. For a comprehensive visual understanding we utilize Mathematica animation and display the features of the oscillations.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"573 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128409424","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
Incremental and SQL-Based Data Grid Mining Algorithm for Mobility Prediction of Mobile Users 基于sql的移动用户移动性预测增量数据网格挖掘算法
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.6
U. Sakthi, R. Bhuvaneswaran
{"title":"Incremental and SQL-Based Data Grid Mining Algorithm for Mobility Prediction of Mobile Users","authors":"U. Sakthi, R. Bhuvaneswaran","doi":"10.1109/ICCSA.2009.6","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.6","url":null,"abstract":"In this paper, we propose a new SQL based incremental distributed algorithm for predicting the next location of a mobile user in a mobile web environments. Parallel and Distributed data mining algorithm is applied on moving logs stored in geographically distributed data grid to generate the mobility pattern, which provides various location based services to the mobile users. One of the existing works for deriving mobility pattern is re-executing the algorithm from scratch results in excessive computation. In our work, we have designed new incremental algorithm by maintaining infrequent mobility patterns, which avoids unnecessary scan of full database. We built data grid system on a cluster of workstation using open source Globus Toolkit (GT) and Message Passing Interface extended with Grid Services (MPICH-G2). The experiments were conducted on original data sets with incremental addition of data and the computation time was recorded for each data sets. We analyzed our results with various sizes of data sets and it shows the time taken to generate mobility pattern by incremental mining algorithm is less than re-computing approach.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123103213","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
A Hybrid Edge Detection Method Based on Fuzzy Set Theory and Cellular Learning Automata 基于模糊集理论和元胞学习自动机的混合边缘检测方法
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.19
Saman Sinaie, A. Ghanizadeh, Emadaldin Mozafari Majd, S. Shamsuddin
{"title":"A Hybrid Edge Detection Method Based on Fuzzy Set Theory and Cellular Learning Automata","authors":"Saman Sinaie, A. Ghanizadeh, Emadaldin Mozafari Majd, S. Shamsuddin","doi":"10.1109/ICCSA.2009.19","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.19","url":null,"abstract":"In this paper, a hybrid edge detection method based on fuzzy sets and cellular learning automata is proposed. At first, existing methods of edge detection and their problems are discussed and then a high performance method for edge detection, that can extract edges more precisely by using only fuzzy sets than by other edge detection methods, is suggested. After that the edges improve incredibly by using cellular learning automata. In the end, we compare it with popular edge detection methods such as Sobel and Canny. The proposed method does not need parameter settings as Canny edge detector does, and it can detect edges more smoothly in a shorter amount of time while other edge detectors cannot.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121583896","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}
引用次数: 19
aCN-RB-tree: Update Method for Spatio-Temporal Aggregation of Moving Object Trajectory in Ubiquitous Environment 泛在环境下运动目标轨迹时空聚合的aCN-RB-tree更新方法
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.30
Dong-Wook Lee, S. Baek, Hae-Young Bae
{"title":"aCN-RB-tree: Update Method for Spatio-Temporal Aggregation of Moving Object Trajectory in Ubiquitous Environment","authors":"Dong-Wook Lee, S. Baek, Hae-Young Bae","doi":"10.1109/ICCSA.2009.30","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.30","url":null,"abstract":"Moving object management is popular with traffic, logistic and data mining applications in ubiquitous environment. Our previous research focused on efficient index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using constraint network based index. Also, it supports direction of trajectory, efficient search for traffic zone and trajectory of the time interval. In this paper, we proposed update method of aCN-RB-tree, considering moving object features. The method updates index efficiently as it divided moving object data by area and time. It supports traffic management systems and mining systems in ubiquitous environment.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124539658","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
Exploiting Path Indexes to Answer Complex Queries in Ontology Repository 利用路径索引回答本体存储库中的复杂查询
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.27
Roshan Maharjan, Young-Koo Lee, Sungyoung Lee
{"title":"Exploiting Path Indexes to Answer Complex Queries in Ontology Repository","authors":"Roshan Maharjan, Young-Koo Lee, Sungyoung Lee","doi":"10.1109/ICCSA.2009.27","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.27","url":null,"abstract":"The ontology repository has widely been used for storing and querying over ontology data. Recently the ontology repository gets more attentions as a component of ubiquitous systems. This paper describes use of the path index to answer complex queries in ontology repository. Studies show that two types of queries namely chain queries and star queries frequently occur in SPARQL queries. Instead of using join operations over several triple indexes, we proposed to use path indexes for such queries, which in turn improve the query performance reducing the number of multiple join operations. Our experiments show that the proposed method enhances the query performance than using only indexes based on single triple pattern.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124575058","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
Cyclic Entropy Optimization of Social Networks Using an Evolutionary Algorithm 基于进化算法的社会网络循环熵优化
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.11
Nosayba El-Sayed, Khaled Mahdi, Maytham Safar
{"title":"Cyclic Entropy Optimization of Social Networks Using an Evolutionary Algorithm","authors":"Nosayba El-Sayed, Khaled Mahdi, Maytham Safar","doi":"10.1109/ICCSA.2009.11","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.11","url":null,"abstract":"We design and apply a Genetic Algorithm that maximizes the cyclic-entropy of a social network model, hence optimizing its robustness to failures. Our algorithm was applied on three types of social networks: scale-free, small-world and random networks. The three types of networks were generated using Barabasi and Albert’s generative model, Watts and Strogatz’s model and Erdos-Renyi’s model, respectively. The maximum optimal entropy achieved among all three types was the one displayed by the small-world network, which was equal to 2.6887, corresponding to an optimal network distribution found when the initial distribution was subject to 11 random edge removals and 19 additions of random edges regardless of the initial distribution. The random-network model came next with optimal entropy equal to 2.5692, followed by the scale-free network which had optimal entropy of 2.5190. We observed by keeping track of the topology of the network and the cycles’ length distribution within it, that all different types of networks evolve almost to the same network, possibly a random network, after being subject to the cyclic-entropy optimization algorithm.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124782863","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
New Matlab-Based KETpic Plug-In for High-Quality Drawing of Curves 新的基于matlab的高质量曲线绘制KETpic插件
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.9
A. Gálvez, A. Iglesias, Setsuo Takato
{"title":"New Matlab-Based KETpic Plug-In for High-Quality Drawing of Curves","authors":"A. Gálvez, A. Iglesias, Setsuo Takato","doi":"10.1109/ICCSA.2009.9","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.9","url":null,"abstract":"This paper introduces a new Matlab-based KETpic plug-in to yield high-quality graphical output to be embedded into standard LaTeX source code. The ultimate goal is to provide LaTeX end-users with a reliable and easy-to-use tool for their scientific artwork. In this work we focus specifically on two-dimensional curves described in either explicit, parametric or implicit form. The plug-in provides a number of interesting features such as line style and thickness, arrowing, annotations of mathematical expressions, lettering, picture resizing and clipping, handling of singularities, etc. Some illustrative examples aimed at showing the good performance of the proposed library will be discussed throughout the paper. Our software is freely available and very easy to install and work with, has little hardware requirements and can readily be used for educational purposes and professional printing of scientific documents.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740452","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 Cloud Market Infrastructure for Trading Service 一种新的交易服务云市场基础设施
2009 International Conference on Computational Science and Its Applications Pub Date : 2009-06-29 DOI: 10.1109/ICCSA.2009.26
Biao Song, M. Hassan, E. Huh
{"title":"A Novel Cloud Market Infrastructure for Trading Service","authors":"Biao Song, M. Hassan, E. Huh","doi":"10.1109/ICCSA.2009.26","DOIUrl":"https://doi.org/10.1109/ICCSA.2009.26","url":null,"abstract":"In this paper, we present a novel combinatorial auction (CA) based trading infrastructure to enable the supply and demand of Cloud services from different Cloud providers (CP). We propose a new auction policy that considers the relationship among CPs (mutual business relationship) in bidding mechanism. In our new auction-based market model, we allow the group of service providers to publish their bids collaboratively as a single bid to the auctioneer. It gives service providers a chance to autonomously find partners and make groups. Then they can use group strategy to increase their competitive power and compete for winning the bid (s). This will reduce conflicts, as well as collaboration cost and negotiation time, among participants as compare to existing CA-based market model. We implement our proposed market model of trading service in a simulated environment and study its economic efficiency with existing model.","PeriodicalId":387286,"journal":{"name":"2009 International Conference on Computational Science and Its Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127536482","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}
引用次数: 44
下一页 尾页
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学术官方微信