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

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

筛选
英文 中文
High-performance data transfer using SCTP-based compact association scheme 使用基于sctp的紧凑关联方案进行高性能数据传输
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.80
Hyuncheol Kim, Younghwa Kim, Kwangjoon Kim, Jin-Wook Chung
{"title":"High-performance data transfer using SCTP-based compact association scheme","authors":"Hyuncheol Kim, Younghwa Kim, Kwangjoon Kim, Jin-Wook Chung","doi":"10.1109/ICCSA.2007.80","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.80","url":null,"abstract":"SCTP (Stream Control Transmission Protocol) is a new IETF transport protocol over the IP network. Transport protocol is responsible for reliable delivery of a message form a host to another host. We proposed and implemented an efficient file transfer system using the SCTP multiple file transfer and modified STCP congestion control mechanism to guarantees a stable data transfer with multi-streaming and to solve the problems such as server overloading due to multiple connection and the HOL (Head Of Line) blocking that the existing TCP-based file transfer. The result shows that proposed system reduces transmission latency for huge data and improves the performance.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"1 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":"129593181","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
Cognitive States Detection in fMRI using incremental P 基于增量P的fMRI认知状态检测
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.58
Minh-Tuan T. Hoang, Yonggwan Won, Hyung-Jeong Yang
{"title":"Cognitive States Detection in fMRI using incremental P","authors":"Minh-Tuan T. Hoang, Yonggwan Won, Hyung-Jeong Yang","doi":"10.1109/ICCSA.2007.58","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.58","url":null,"abstract":"The functional Magnetic Resonance Imaging (fMRI) has emerged as a powerful noninvasive method for collecting large amount of data about activities in human brain. Analysis for fMRI is essential to the success in detecting cognitive states. Due to very high dimensionality of feature vectors, feature extraction should be considered as a critical step to preprocess fMRI data before the stage of cognitive state detection. Up to now, different feature extraction methods have been applied to this type of data and they require domain experts to specify the Regions of Interests (Rol). However, none of them can give a dominant approach for precisely detecting cognitive states. In this paper, incremental principal component analysis (iPCA) proves to be an efficient method of feature extraction for fMRI data without using domain experts. Our experimental results show that this approach gives a higher performance compared to other feature extraction methods which require domain experts to select Regions of Interests.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"26 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":"130051719","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
An Energy Efficient Routing Scheme for Wireless Sensor Networks 一种无线传感器网络的节能路由方案
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.10
Ki-Young Jang, K. Kim, H. Youn
{"title":"An Energy Efficient Routing Scheme for Wireless Sensor Networks","authors":"Ki-Young Jang, K. Kim, H. Youn","doi":"10.1109/ICCSA.2007.10","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.10","url":null,"abstract":"Since sensor nodes have limited energy, energy efficient routing is very important for wireless sensor network (WSN). In this paper we propose a routing scheme which significantly enhances the performance of existing schemes such as LEACH and IEACH-C. The proposed scheme selects the cluster head not randomly but considering the remaining energy when the energy level drops below 50% of the initial energy. For each node, the cluster head to join is determined by not only the signal power but also the remaining energy of the cluster head. Also, data transmission occurs when the context satisfies the preset condition. NS-2 simulation shows that the proposed scheme outperforms LEACH and LEACH-C by 37% and 30%, respectively, in terms of the lifetime of the sensor network.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"353 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":"122789700","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}
引用次数: 60
Toward a Fuzzy Astrophysics Research Resources (FARR) 迈向模糊天体物理研究资源(FARR)
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.62
H. Sallam, A. H. Abdullah
{"title":"Toward a Fuzzy Astrophysics Research Resources (FARR)","authors":"H. Sallam, A. H. Abdullah","doi":"10.1109/ICCSA.2007.62","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.62","url":null,"abstract":"Fuzzy-logic-based technology has proved to address uncertainty in astrophysics fields. It is utilized in many areas, including research and hardware tools. The present paper addresses the need for building fuzzy astrophysics research resource (FARR) to support the increased fuzzy logic based research in the astrophysics communities. FARR database serves as reservoir for fuzzy functions, values, rules and suggested decisions. The paper's main goal is to enhance the new research trend of using fuzzy-based models in astrophysics research. This paper presents a proof of concept (poc), PHP/C++/ MYSQL fuzzy logic based model application.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"37 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":"116398928","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
Discovery of Non-Interesting Attribute in Mining Outliers Pattern 异常值模式挖掘中非感兴趣属性的发现
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.27
F. Shaari, A. Bakar, A. Hamdan
{"title":"Discovery of Non-Interesting Attribute in Mining Outliers Pattern","authors":"F. Shaari, A. Bakar, A. Hamdan","doi":"10.1109/ICCSA.2007.27","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.27","url":null,"abstract":"An outlier in a dataset is a point or a class of points that is considerably dissimilar to or inconsistent with the remainder of the data. Detection of outliers is important for many applications and has always attracted attention among data mining research community. In this paper, we present a new method in detecting outlier by discovering Non-IntAttrb from the information system (IS). Non-IntAttrb is set of attributes from IS that may contain outliers. We discover the computation of Non-IntAttrb by defining indiscemibility matrix modulo (iDMM) and indiscemibility function modulo(iDFM). We define a measurement calledRSetOF(Rough Set Outlier Factor Value) to detect outlier objects. The experimental results show that our approach is a fast outlier detection method.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"110 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":"115741761","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
An Approach to a Real World Dynamic Route Guidance Problem 现实世界动态路径引导问题的一种方法
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.88
Ahmet Yildiz, Canan Yildiz
{"title":"An Approach to a Real World Dynamic Route Guidance Problem","authors":"Ahmet Yildiz, Canan Yildiz","doi":"10.1109/ICCSA.2007.88","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.88","url":null,"abstract":"Internationally organised large-scaled events often cause an overload of the host city's public transportation network as the number of people who use the network increases immensely within a relative small timespan and their flow is concentrated to one direction in the network. To efficiently and individually route participants to the events' location using public transport we would like to provide each individual with the quickest path on a network whose attributes constantly change over time. In this paper we give a formal description of this problem, review related work, discuss to what extent they can be used to solve the problem efficiently and finally introduce our approach.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"27 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":"129813909","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
SQL Extension for Multidatabase System 多数据库系统的SQL扩展
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.42
Mi-Yeon Kim, Jungyun Seo, Chang-Joo Moon
{"title":"SQL Extension for Multidatabase System","authors":"Mi-Yeon Kim, Jungyun Seo, Chang-Joo Moon","doi":"10.1109/ICCSA.2007.42","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.42","url":null,"abstract":"The most important feature of a multidatabase system (MDBS) is to provide the global schema with integrating various models of local database systems (LDBS). However, it is difficult to integrate local schemas into the global schema due to the difference of the syntactical and semantic expressions of LDBSs. In this paper, we propose the standard SQL extension for MDBS called by Multidatabase Query Language (MQL). In addition, we analyze semantic conflicts using case studies and provide solutions to the semantic conflicts using MQL.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"1 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":"128677960","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
GPU Ray Marching for Real-Time Rendering of Participating Media GPU Ray Marching用于参与媒体的实时渲染
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.46
J. Han, Hyunwoo Ki, Kyoungsu Oh
{"title":"GPU Ray Marching for Real-Time Rendering of Participating Media","authors":"J. Han, Hyunwoo Ki, Kyoungsu Oh","doi":"10.1109/ICCSA.2007.46","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.46","url":null,"abstract":"This paper presents a GPU based ray marching algorithm for real-time rendering of participating media. We fire a ray at each pixel being shaded on the cube surface, and then we find an intersection between the ray and inner-volume recorded by a 3D texture, using both linear and binary searches. At this intersection, the ray marches through the volume to compute radiance by single scattering of light. This technique can render isotropic as well as anisotropic participating media at tens frames per second on graphics hardware without any preprocessing loads.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"63 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":"122024948","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
Towards Evaluation of Inferred Gene Network 对推断基因网络评价的探讨
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.29
S. Zainudin, S. Deris
{"title":"Towards Evaluation of Inferred Gene Network","authors":"S. Zainudin, S. Deris","doi":"10.1109/ICCSA.2007.29","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.29","url":null,"abstract":"Gene network is a representation for gene interactions. A gene collaborates with other genes in order to function. Past researches have successfully inferred gene network from gene expression microarray data. Gene expression microarray data represent different levels of gene expressions for organisms during biological activity such as cell cycle. A framework for gene network inference is to normalize gene expression data, discretize data, learn gene network and evaluate gene interactions. This framework was used to learn the gene network for two S. cerevisiae gene expression datasets (Spellman Cell cycle and Gasch Yeast Stress). Gene interaction inference was also done on data contained in 8 major clusters found by Spellman. The inferred networks were compared to gene interaction data curated by Biogrid. Results from the comparison shows that some of the inferred gene interactions agree with data contained in Biogrid and by referring to curated genetic interactions in Biogrid, we can understand the significance of computationally inferred gene interactions.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"1 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":"124402448","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
Optimized-Hilbert for Mobility in Wireless Sensor Networks 无线传感器网络中移动性的优化希尔伯特
2007 International Conference on Computational Science and its Applications (ICCSA 2007) Pub Date : 2007-08-26 DOI: 10.1109/ICCSA.2007.85
M. Kamat, A. Ismail, S. Olariu
{"title":"Optimized-Hilbert for Mobility in Wireless Sensor Networks","authors":"M. Kamat, A. Ismail, S. Olariu","doi":"10.1109/ICCSA.2007.85","DOIUrl":"https://doi.org/10.1109/ICCSA.2007.85","url":null,"abstract":"In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"18 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":"131852032","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
首页 上一页 下一页 尾页
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学术官方微信