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

2007 International Conference on Computational Science and its Applications (ICCSA 2007)最新文献

筛选
英文 中文
Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding Obstacles 欧几里得斯坦纳最小树内的简单多边形避免障碍
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.83
A. Asadi, M. Razzazi
{"title":"Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding Obstacles","authors":"A. Asadi, M. Razzazi","doi":"10.1109/ICCSA.2007.83","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.83","url":null,"abstract":"The Steiner problem leads to solutions in several scientific and business applications, computer networks' routing and electronic integrated circuits are few examples. The computational features of this problem make it an important research subject in computational geometry. Assuming some points in the Euclidean plane, we can construct a minimum spanning tree connecting these (terminal) nodes. It is possible to add some extra points (Steiner Points) in order to decrease the length of this tree which would in turn lead to Euclidean Steiner minimal tree (ESMT). This problem is considered as a NP-hard problem, as it may contain some nodes that are not in the set of given nodes. Assuming a simple polygon P with m vertices and n terminals in it, we try to find a Euclidean Steiner minimal tree connecting all these n terminals in P. In this paper we propose solutions for any number of terminals in a simple polygon. Proposed algorithms can also solve the problem in a simple polygon with some obstacles inside. These algorithms are simple to implement and lead to good results.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131527267","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
Very Lowbit Rate ideo Codec Based on Diffrentialwavelet Filters 基于差分小波滤波器的极低比特率视频编解码器
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.70
Mostafa A. Ahmad, A. Al-Hamadi, G. Krell, B. Michaelis
{"title":"Very Lowbit Rate ideo Codec Based on Diffrentialwavelet Filters","authors":"Mostafa A. Ahmad, A. Al-Hamadi, G. Krell, B. Michaelis","doi":"10.1109/ICCSA.2007.70","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.70","url":null,"abstract":"State-of-the-art in digital coding/decoding includes discrete image transformation, quantization, and entropy coding. The key to efficient data compression is associated with image transformation/reconstruction processes. In this paper, we present a different filters wavelet-based intra-frame video coding technique. The wavelet transformation is developed and optimized in order to enhance the visual quality especially at very low bit rate. The proposed coding technique reduces the bit rate while performing well regarding PSNR and visual quality. In comparison with the conventional coding methods, our proposed coding technique provides significant performance gains in objective and subjective quality.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133718851","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
Intelligent Water Dispersal Controller: Comparison between Mamdani and Sugeno Approaches 智能水分散控制器:Mamdani和Sugeno方法的比较
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.77
M. Yusoff, S. Mutalib, S. A. Rahman, A. Mohamed
{"title":"Intelligent Water Dispersal Controller: Comparison between Mamdani and Sugeno Approaches","authors":"M. Yusoff, S. Mutalib, S. A. Rahman, A. Mohamed","doi":"10.1109/ICCSA.2007.77","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.77","url":null,"abstract":"This paper presents a comparison of fuzzy inference methods in intelligent water dispersal controller primarily focuses on grass watering. In irrigation system, measuring and monitoring soil moisture from the soil information and climatologic factors would determine the amount of water for sufficient soil moisture. Mamdani-style and Sugeno-style inference methods have been tested and evaluated using this information. These methods were tested on normal subsets. Fuzzy rules were determined based on three inputs namely; Bermuda Turf grass coefficient, evapotranspiration (FT) rate, and tensiometer data. The result illustrated that the most convincing fuzzy inference method applied was the Mamdani-style compared to Sugeno-style. It was shown that the controller used less water in turf grass irrigation. Overall, both of the tested methods give significant result to the recognition of soil moisture level.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132351756","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
Simplified Shadow Volumes using Silhouette Level-of-Detail 使用轮廓细节级别简化阴影体积
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.39
J. Strauss, A. Datta
{"title":"Simplified Shadow Volumes using Silhouette Level-of-Detail","authors":"J. Strauss, A. Datta","doi":"10.1109/ICCSA.2007.39","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.39","url":null,"abstract":"This paper presents an optimisation of the existing shadow volume algorithm using a polygonal mesh refinement data structure known as the merge tree. The merge tree is combined with a custom visibility function to generate a mesh refinement known as a silhouette level-of-detail (SLOD). The SLOD retains all original mesh detail in the region of the silhouette and coarsely approximates the mesh elsewhere. Using a SLOD accelerates the creation of shadow volumes in two ways. Firstly, a SLOD contains fewer edges than the original mesh, reducing the time required to find correct silhouette edges. Secondly, a shadow volume produced from a SLOD contains less geometry than a shadow volume produced from the original mesh, hence it may be rendered more quickly.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749989","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
Towards Skolemize Clauses Binding for Reasoning in Inference Engine 论推理机中推理的Skolemize子句绑定
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.24
R. A. Kadir, T. Sembok, H. Halimah
{"title":"Towards Skolemize Clauses Binding for Reasoning in Inference Engine","authors":"R. A. Kadir, T. Sembok, H. Halimah","doi":"10.1109/ICCSA.2007.24","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.24","url":null,"abstract":"The paper presents a reasoning technique for open-domain question answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a skolemize clauses binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127369706","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
DOIDFH: an Effective Distributed Metadata Management Scheme DOIDFH:一个有效的分布式元数据管理方案
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.22
D. Feng, Juan Wang, F. Wang, Peng Xia
{"title":"DOIDFH: an Effective Distributed Metadata Management Scheme","authors":"D. Feng, Juan Wang, F. Wang, Peng Xia","doi":"10.1109/ICCSA.2007.22","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.22","url":null,"abstract":"Subtree partitioning and hashing are two common techniques used for current distributed metadata management schemes. Subtree partitioning schemes do not evenly distribute workload among metadata server cluster, and a number of metadata need to be migrated to achieve coarse load balancing. Though current hashing schemes evenly distribute workload among metadata server cluster, they eliminate the storage locality of files metadata in the same directory. They also can not effectively deal with some operations such as renaming a directory or accessing a file in the path of a linked directory. A new approach called parent Directory Object Identifier and Filename Hashing (DOIDFH) metadata management is proposed, which could distribute evenly files metadata among metadata server cluster, as well as partially hold hierarchical locality. It solves effectively the existent problems of current hashing schemes and also takes advantages of them.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013284","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}
引用次数: 9
Multimedia Content Transcoding for Displaying Space Synchronization on Web Browser 在Web浏览器上显示空间同步的多媒体内容转码
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.87
DaeHyuck Park, Euisun Kang, Younghwan Lim
{"title":"Multimedia Content Transcoding for Displaying Space Synchronization on Web Browser","authors":"DaeHyuck Park, Euisun Kang, Younghwan Lim","doi":"10.1109/ICCSA.2007.87","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.87","url":null,"abstract":"This paper suggests how to convert existing multimedia learning titles into independent multimedia learning Title platform by using XML DB. It stores resource information that takes care of large amount of interactive multimedia learning resources. In existing multimedia learning titles, that resource information is divided and stored at multiple locations, but it store and manage the information in a database. Also Internet browsers are used to play those titles regardless of which platform those are played, so there are no needs for dedicated Multimedia Learning players. As a result of this research, multimedia learning titles can be played in various environments, like local terminal and server, without computer specification limitations.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115089222","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
Interval Arithmetic and Computational Science: Rounding and Truncation Errors in N-Body Methods 区间算术与计算科学:n体方法中的舍入和截断误差
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 1900-01-01 DOI: 10.1109/ICCSA.2007.74
Alistair P. Rendell, Bill Clarke, Pete P. Janes, Joshua Milthorpe, Rui Yang
{"title":"Interval Arithmetic and Computational Science: Rounding and Truncation Errors in N-Body Methods","authors":"Alistair P. Rendell, Bill Clarke, Pete P. Janes, Joshua Milthorpe, Rui Yang","doi":"10.1109/ICCSA.2007.74","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.74","url":null,"abstract":"Interval arithmetic is an alternative computational paradigm that enables arithmetic operations to be performed with guarantee error bounds. In this paper interval arithmetic is used to compare the accuracy of various methods for computing the electrostatic energy for a system of point charges. A number of summation approaches that scale as O(N2) are considered, as is an O(N) scaling Fast Multipole Method (FMM). Results are presented for various sizes of water cluster in which each water molecule is described using the popular TIP3P water model. For FMM a subtle balance between the dominance of either rounding or truncation errors is demonstrated.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123648304","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
Using Dependence Matrix to Support Change Impact Analysis for CBS 使用依赖矩阵支持CBS变更影响分析
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 1900-01-01 DOI: 10.1109/ICCSA.2007.25
Chengying Mao, Jinlong Zhang, Yansheng Lu
{"title":"Using Dependence Matrix to Support Change Impact Analysis for CBS","authors":"Chengying Mao, Jinlong Zhang, Yansheng Lu","doi":"10.1109/ICCSA.2007.25","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.25","url":null,"abstract":"Component-based software development technique and its extensive application have led to the wide research in various aspects of component-based software (CBS). The rapid evolution of CBS brings great challenges to its maintenance in the later phase, so it is quite necessary to measure the change impact on the whole system. By using component dependence matrix to represent component-based software system, the paper mainly discusses the case of component modification, including the single component change and the changes of multi-components, and proposes the corresponding algorithms (i.e. Appxm RM, Generate_SP, and Calculate_CR) for analyzing the change impacts in CBS. In addition, the calculation process of change impact analysis and its effectiveness are also validated by a simple CBS.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519217","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
Dynamic Group-based Scheduling for Two Dimensional Seek Space in MEMS-based Storage 基于mems存储的二维寻道空间动态分组调度
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 1900-01-01 DOI: 10.1109/ICCSA.2007.53
Junseok Park, Hansung Chun, H. Bahn, K. Koh
{"title":"Dynamic Group-based Scheduling for Two Dimensional Seek Space in MEMS-based Storage","authors":"Junseok Park, Hansung Chun, H. Bahn, K. Koh","doi":"10.1109/ICCSA.2007.53","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.53","url":null,"abstract":"MEMS-based storage is expected to be adopted as a secondary storage of mobile computing devices such as portable media players and digital cameras. Due to its desirable features such as small size, lightweight, low power consumption, and low cost, MEMS-based storage will be widely used for mobile applications that require large volume of multimedia data. However, physical structures of MEMS-based storage are different from other storage devices such as hard disk especially in the way of data placement and head positioning. Hence, it is important to revise OS-level software management schemes for MEMS-based storage. In this paper, we present a new I/O scheduling algorithm for MEMS-based storage called G-MST that exploits two-dimensional structure of MEMS-based storage. The new algorithm aims at reducing total seek distance in the two dimensional MEMS structure and at the same time providing fast and uniform response times. Through simulation experiments, we show that the new I/O scheduling algorithm performs better than existing algorithms in terms of average response time and the variation of response times.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116152988","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学术文献互助群
群 号：481959085
Book学术官方微信