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

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)最新文献

筛选
英文 中文
Estimation Of Cross-Hybridization Signals Using Support Vector Regression 基于支持向量回归的交叉杂交信号估计
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.58
Yijun Sun, Li Liu, M. Popp, W. Farmerie
{"title":"Estimation Of Cross-Hybridization Signals Using Support Vector Regression","authors":"Yijun Sun, Li Liu, M. Popp, W. Farmerie","doi":"10.1109/IMSCCS.2006.58","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.58","url":null,"abstract":"Microarray technology is a powerful biotechnology tool which allows researchers to simultaneously evaluate the expression of thousands of genes, if not the entire expressed genome, of an organism. Measures of gene expression are determined by the differential hybridization of labeled mRNA from experimental samples to DNA probes affixed to the array. The accuracy of these measurements is influenced by the binding specificity between the labeled samples and the probes. Evaluating the level of cross-hybridization is therefore critically important in obtaining accurate measures of gene expression. In this paper we present a support vector regression based predictor that utilizes the nucleotide content of the DNA probes as a means for estimating the level of cross-hybridization. Experimental results from three microarray data sets are presented. Our results indicate that we can identify genes when the measured fluorescent signal values are less than those predicted from cross-hybridization. In these cases we do not consider the genes to be expressed","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814766","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
Collaborative Peer-to-Peer Service for Information Sharing Using JXTA 基于JXTA的信息共享协同点对点服务
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.45
Hao Shi, Yanchun Zhang, Jingyuan Zhang, E. Beal, N. Moustakas
{"title":"Collaborative Peer-to-Peer Service for Information Sharing Using JXTA","authors":"Hao Shi, Yanchun Zhang, Jingyuan Zhang, E. Beal, N. Moustakas","doi":"10.1109/IMSCCS.2006.45","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.45","url":null,"abstract":"Peer-to-peer (P2P) file sharing networks attract much attention from legal and research communities. The success and popularity of P2P networks provides a new paradigm for sharing and distributing information. However, the widespread illegal distribution of the copyright protected works and anonymous malicious attacks to the network raise serious concerns for the future of P2P applications. Legal and research professionals face a challenge to collaboratively develop a P2P application that reduces these concerns. Our research aims to develop a P2P collaborative research network, named vuCRN, for legal academics and researchers to facilitate document sharing. In this paper, we present our vuCRN prototype based on JXTA technology. JXTA provides services to let peers find each other in the group, and exchange messages across firewalls and NATs (network address translators). vuCRN allows, peers to freely download shared files but their upload permission is controlled by decentralized user authentication, using local LDAP (lightweight directory access protocol) servers. This ensures that peers in vuCRN network obtain only reliable information and protects the quality of resources. This prototype is fully tested in LAN (local area network), Internet and inter-university networks. The testing results, conclusions and future work are also presented in this paper","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125178924","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
Ontology Mapping Meta-model Based on Set & Relation Theory 基于集合与关系理论的本体映射元模型
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.97
Pengfei Qian, Shensheng Zhang
{"title":"Ontology Mapping Meta-model Based on Set & Relation Theory","authors":"Pengfei Qian, Shensheng Zhang","doi":"10.1109/IMSCCS.2006.97","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.97","url":null,"abstract":"In this paper, we propose to define an ontology mapping meta-model based on set and relation theory, and it is the foundation of managing mappings among heterogeneous ontology models. The ontology mapping meta-model is composed of ontology related elements (OntologyElement, OESet, OESetGroup, GroupDefinitionRule, etc), mapping related elements (Mapping, MappingClassification, MappingDefinitionRule etc). Just because set and relation theory is the theoretical foundation of mapping models, the powerful computation capability of set and relation theory can be used in ontology mapping models computation. Simultaneously, model synchronization among heterogeneous ontology models is also introduced as an ontology mapping model application example. The primary contribution of this paper is to define an ontology mapping meta-model based set and relation theory which can be regarded as the unified mechanism to manage the large number of ontology models and their relationships","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125194729","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
Detecting Functional Modules from Protein Interaction Networks 从蛋白质相互作用网络中检测功能模块
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.55
Feng Luo, R. Scheuermann
{"title":"Detecting Functional Modules from Protein Interaction Networks","authors":"Feng Luo, R. Scheuermann","doi":"10.1109/IMSCCS.2006.55","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.55","url":null,"abstract":"Accumulating evidence suggests that biological systems are composed of separable functional modules. Identifying these modules is essential in understanding the organization of biological systems. In this paper, we extend the indegree and outdegree concept of vertex to the sub-graph and propose a new formal definition of a module in a network. By combining our new network module definition with an adaptation of the Girvan-Newman algorithm, we propose a new divisive algorithm to detect modules from protein interaction networks. We applied our approach to the DIP yeast core protein interaction network and 81 compact simple modules with size larger than 3 are revealed. All 81 modules are significantly enriched for functional gene ontology terms. Comparison between our compact simple modules with the modules of Radicchi et al. showed that our modules are statistically more significant (lower P-value). Our approach provides a plausible way to identify functional modules within biological networks","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124510480","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
Novel Relevance Feedback Algorithm with Tabu-list in Image Retrieval 基于禁忌表的图像检索相关反馈新算法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.92
Decai Huang, Jia Hu, Yuan Yuan
{"title":"Novel Relevance Feedback Algorithm with Tabu-list in Image Retrieval","authors":"Decai Huang, Jia Hu, Yuan Yuan","doi":"10.1109/IMSCCS.2006.92","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.92","url":null,"abstract":"In the research of content-based image retrieval, the former work was focused on the choice and the extraction of ocular features principally. But this kind of retrieval system cannot meet the expectations of practical use, because it can neither make full use of people's subjectivity, nor integrate low-level image features with semantic contents of images. In order to solve this problem, this paper uses the scheme of region weight adjusted automatically and tabu search algorithm, presents a tabu search-based relevance feedback algorithm in image retrieval. The experimental results show that after the region weight adjusted by this algorithm. The retrieval performance is improved very obviously","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121636168","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
Analysis of Performance Evaluation of Parallel Katsevich Algorithm for 3-D CT Image Reconstruction 三维CT图像重建的并行Katsevich算法性能评价分析
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.38
J. Ni, Junjun Deng, Hengyong Yu, Tao He, Ge Wang
{"title":"Analysis of Performance Evaluation of Parallel Katsevich Algorithm for 3-D CT Image Reconstruction","authors":"J. Ni, Junjun Deng, Hengyong Yu, Tao He, Ge Wang","doi":"10.1109/IMSCCS.2006.38","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.38","url":null,"abstract":"The first theoretically exact spiral cone-beam CT reconstruction algorithm developed was by Katsevich. Recently, Yu et al. implemented the algorithm numerically. Although the method is very promising, the computation is very intensive. It requires huge amount of computer time. Recently, people began to parallelize the algorithm for achieving high performance computation. This paper presents an analysis of data decomposition and data communication in the parallel Katsevich algorithm and develops an analysis expression to evaluate the performance of the algorithm parallelism. The results based on the analytical model and numerical benchmarks compared in a fare agreement. The analytical model provides a great tool to evaluate high performance computing benchmarks in the parallel Katsevich algorithms","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"55 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917896","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
Two Post-Scheduling Optimization Algorithms for Distributed Real-Time Tasks Based on Scheduled Cluster Tree 基于调度聚类树的分布式实时任务调度后优化算法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.138
Xiaofei Wang, Mingjie Fang
{"title":"Two Post-Scheduling Optimization Algorithms for Distributed Real-Time Tasks Based on Scheduled Cluster Tree","authors":"Xiaofei Wang, Mingjie Fang","doi":"10.1109/IMSCCS.2006.138","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.138","url":null,"abstract":"To overcome the disadvantages of the existing task duplication-based algorithms, this paper discusses the scheduling objectives of distributed real-time tasks, presents a novel structure called scheduled cluster tree, and proposes a general optimization method for various task duplication-based algorithms. According to the result of experiments, PSO_I and PSO_II are both general algorithms that improve the schedules generated by various task duplication-based algorithms. PSO_I aims to optimize the schedules in minimizing the number of required processors without affecting the optimal scheduling length acquired. PSO_II aims to increase the utilization of processors at the acceptable expense of the scheduling length (i.e., in the range of deadline) besides minimizing the number of required processors. The time complexities of both methods match approximately that of the typical task duplication-based algorithms, e.g., the task duplication based scheduling algorithm and the optimal scheduling algorithm based on task duplication","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132034317","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
Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints 具有机器可用性约束的校园规模全局计算作业调度
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.82
Guangzhong Sun, Jiulong Shan, Guoliang Chen
{"title":"Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints","authors":"Guangzhong Sun, Jiulong Shan, Guoliang Chen","doi":"10.1109/IMSCCS.2006.82","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.82","url":null,"abstract":"The rapid improvement of commodity components makes the global computing platform increasingly viable for many applications. This paper studied the problem of job scheduling for campus-scale global computing on theoretical level. Based on system modeling, we first proved the scheduling problem is a NP-hard problem, and then chose the approximation algorithm LS (list scheduling) as a solution. Finally, the theoretical analysis showed that it is a (m+1)-approximation algorithm for our model","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132230495","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
An Approach of Service Tailoring Based-on Parameterized Contracts 基于参数化契约的服务裁剪方法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.31
Yukui Fei
{"title":"An Approach of Service Tailoring Based-on Parameterized Contracts","authors":"Yukui Fei","doi":"10.1109/IMSCCS.2006.31","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.31","url":null,"abstract":"Service tailoring is a key operation when orchestrating system with Web services because of varieties of context of reusing services. It can not only improve the reuse capability of service, but also reduce difficulty of discovering service and matching service. Thereby, make the orchestration of service easy. As a generalization of interoperability check between services, parameterized contracts can be applied to service tailoring. Having discussed the principle of the service behavior contracts & parameterized contracts, this paper give a way of how to apply parameterized contracts to service tailoring operation in service composition environment","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114310989","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
TGrid: A New Grid Environment TGrid:一个新的网格环境
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.132
Deyu Qi, Weiwei Lin
{"title":"TGrid: A New Grid Environment","authors":"Deyu Qi, Weiwei Lin","doi":"10.1109/IMSCCS.2006.132","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.132","url":null,"abstract":"A new tree-based grid environment (called TGrid) is presented in this paper after analyzing the problems in current grid environments. TGrid supports high performance computing, subject-oriented resources sharing and the next generation requirement modeling and it also achieves bottom-up, multi-level and demand-oriented abstraction and fusion of multiple resources. And it organizes grid nodes and integrates multiple resources in the tree structure that conforms to the natural hierarchical organization structures, easily achieves hierarchical management, also may reduce load on the central node (server) and realize load balancing for large-scale applications, improve the efficiency of resource searching. After introducing the conceptual model and the resource abstract model for TGrid, the key problems of TGrid implementation are discussed and analyzed. Finally, it focuses on the task allocation algorithm using dynamic load balancing for large-scale applications in TGrid and the experiment results show the effectiveness of this algorithm. TGrid provides a new solution for grid application demands","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116482723","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
首页 上一页 下一页 尾页
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学术官方微信