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

2014 International Conference on Computational Science and Computational Intelligence最新文献

筛选
英文 中文
The Code for Solving Aerodynamic Problems Based on Explicit Godunov-Kolgan-Rodionov Scheme 基于显式Godunov-Kolgan-Rodionov格式求解气动问题的代码
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.139
A. Rodionov, V. Spiridonov, K. Tsiberev, I. Tagirova
{"title":"The Code for Solving Aerodynamic Problems Based on Explicit Godunov-Kolgan-Rodionov Scheme","authors":"A. Rodionov, V. Spiridonov, K. Tsiberev, I. Tagirova","doi":"10.1109/CSCI.2014.139","DOIUrl":"https://doi.org/10.1109/CSCI.2014.139","url":null,"abstract":"This paper describes the finite volume code for aerodynamic problems computer modeling. The base of the technique is explicit difference Godunov-Kolgan-Rodionov scheme. Development and testing results of calculation algorithms for 2D planar flows are described. Solutions of different problems are given and the efficiency of the developed technique is being analyzed in comparison with other known codes.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391639","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
Hadoop Architecture and Its Issues Hadoop架构及其问题
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.140
Anam Alam, Jamil Ahmed
{"title":"Hadoop Architecture and Its Issues","authors":"Anam Alam, Jamil Ahmed","doi":"10.1109/CSCI.2014.140","DOIUrl":"https://doi.org/10.1109/CSCI.2014.140","url":null,"abstract":"This paper describes the shortcomings in Hadoop. Hadoop is a distributed paradigm used to manipulate the large amount of data. This manipulation contains not only storage as well as processing on the data. Hadoop is normally used for data intensive applications. It actually holds the huge amount of data and upon requirement perform the operations like data analysis, result analysis, data analytics etc. Now a day's almost every social media is using Hadoop for many intentions like opinion mining etc.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114605649","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}
引用次数: 39
CobLE: Confidence-Based Learning Ensembles CobLE:基于自信的学习组合
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.72
S. Buthpitiya, A. Dey, M. Griss
{"title":"CobLE: Confidence-Based Learning Ensembles","authors":"S. Buthpitiya, A. Dey, M. Griss","doi":"10.1109/CSCI.2014.72","DOIUrl":"https://doi.org/10.1109/CSCI.2014.72","url":null,"abstract":"Combining information from a variety of sources greatly improves the classification accuracy compared with a single source. When the information sources are asynchronous (i.e., the combined feature set has missing values) and training data is limited, the accuracy of existing classification approaches are reduced. In this paper we present CobLE, an approach for creating an ensemble of classifiers. Each classifier operates on data from a single source and a \"confidence\" function is approximated for each classifier over its feature space. Classifier outputs are aggregated using weighted voting where the weight for each classifier is estimated from its confidence function. We present a theoretical analysis and extensive experimental results demonstrating significant improvement over existing ensemble learning and data fusion approaches, especially with asynchronous data sources. We also present a thorough evaluation of the effects of CobLE's internal parameters on performance.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044238","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
Synchrone Technologies: Innovation, Research, Industry, Education- Strengths to Succeed 同步技术:创新，研究，工业，教育-成功的优势
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.154
Lamia Atma Djoudi, M. Rome
{"title":"Synchrone Technologies: Innovation, Research, Industry, Education- Strengths to Succeed","authors":"Lamia Atma Djoudi, M. Rome","doi":"10.1109/CSCI.2014.154","DOIUrl":"https://doi.org/10.1109/CSCI.2014.154","url":null,"abstract":"While the majority of companies fail to get success of their strategy, with our company, we have to deal with obstacles. In this paper, we present our company by focusing on: Our strength and success keys; our belief to the necessity of research to achieve our main objective: Always must be innovative and has willingness to be at the forefront of technology. We outline the main lines of our research fields. During the conference, we present the details of our research projects specifically: HPC and artificial intelligence, machine learning for the recruitment process.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125801646","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
Discrete Time Evolution of Proteomic Biomarkers 蛋白质组学生物标志物的离散时间进化
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.87
David Gnabasik, G. Alaghband
{"title":"Discrete Time Evolution of Proteomic Biomarkers","authors":"David Gnabasik, G. Alaghband","doi":"10.1109/CSCI.2014.87","DOIUrl":"https://doi.org/10.1109/CSCI.2014.87","url":null,"abstract":"We measured a panel of 12 cytokines in seven different populations: i.e., healthy non-smokers, healthy smokers, COPD, Aden carcinoma and Squamous cell carcinoma of the lung. From these 12 biomarkers of host response to lung disease we have developed a computational and visual model that reliably distinguishes these clinical types. Protein biomarker behavior models are developed as the topological evolution of linear discrete systems from changes in patient protein sample concentrations.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128310719","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 Computational Study of Interval-Valued Matrix Games 区间值矩阵对策的计算研究
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.66
Christopher Mitchell, Chenyi Hu, Bernard Chen, Michael Nooner, Paul Young
{"title":"A Computational Study of Interval-Valued Matrix Games","authors":"Christopher Mitchell, Chenyi Hu, Bernard Chen, Michael Nooner, Paul Young","doi":"10.1109/CSCI.2014.66","DOIUrl":"https://doi.org/10.1109/CSCI.2014.66","url":null,"abstract":"Game theory has been applied for strategic decision making in areas such as economics, political science, psychology, and others. A two-player zero-sum game represented as an m × n real matrix is probably the simplest model to maximize (minimize) possible gain (loss) in game theory. Considering payoffs of a matrix game in real applications can vary even when the players repeat the same strategies, Collins and Hu [1] modeled such uncertainty with interval-valued matrix games. In 2011 and 2012, D.F. Li et al further proposed approaches to solve interval-valued matrix game with the basic idea of splitting an interval game matrix to its lower and upper bounds in [5] and [6]. It is also suggested that one may determine an interval matrix game by solving the lower-and upper-bound point matrix games. However, there is not a rigorous mathematical proof but only few structured numerical examples were used for verification. In this study, we run exhaustive computational experiments with the software suite we created to gain further insights. Our computational results indicate that the value of a point-valued matrix game R ∈ R, where R is an interval-valued matrix game, is bounded by the game values of the lower- and upper-bound point matrix of R mostly. However, it is not always true. We report the software suite, our results of computational experiments, and theoretic insights in this paper.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078771","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
Object Detection by 2-D Continuous Wavelet Transform 二维连续小波变换的目标检测
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.34
V. K. Reddy, Kiran Kumar Siramoju, P. Sircar
{"title":"Object Detection by 2-D Continuous Wavelet Transform","authors":"V. K. Reddy, Kiran Kumar Siramoju, P. Sircar","doi":"10.1109/CSCI.2014.34","DOIUrl":"https://doi.org/10.1109/CSCI.2014.34","url":null,"abstract":"The use of two dimensional (2-D) continuous wavelet analysis has not been extensive for image processing using wavelets. It has been overshadowed by the 2-D discrete dyadic wavelet transform (DWT) due to its compactness and excellent performance in coding, data compression, image reconstruction, etc. However, the 2-D DWT has some restrictions on the scale and position parameters, and it does not detect all the features of an image unless properly tuned. The 2-D continuous wavelet transform (CWT), on the other hand, is more flexible and provides complete control over the scale and position parameters, and thus it is capable of extracting various features of an image, which cannot be accomplished by the DWT. It is shown that sharp edges can be extracted at lower scales of the 2-D CWT. In this paper, an algorithm is developed to detect focused objects in an image/video using the 2-D CWT. The first step in this algorithm is to extract the edges of focused objects using the 2-D CWT. The object detected is converted to binary image. Some applications of object detection method in image and video processing are mentioned.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130682906","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
Dynamic Incremental K-means Clustering 动态增量k均值聚类
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.60
B. Aaron, D. Tamir, N. Rishe, A. Kandel
{"title":"Dynamic Incremental K-means Clustering","authors":"B. Aaron, D. Tamir, N. Rishe, A. Kandel","doi":"10.1109/CSCI.2014.60","DOIUrl":"https://doi.org/10.1109/CSCI.2014.60","url":null,"abstract":"K-means clustering is one of the most commonly used methods for classification and data-mining. When the amount of data to be clustered is \"huge,\" and/or when data becomes available in increments, one has to devise incremental K-means procedures. Current research on incremental clustering does not address several of the specific problems of incremental K-means including the seeding problem, sensitivity of the algorithm to the order of the data, and the number of clusters. In this paper we present static and dynamic single-pass incremental K-means procedures that overcome these limitations.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130971732","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}
引用次数: 31
A DNA Algorithm for Solving Vehicle Routing Problem 求解车辆路径问题的DNA算法
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.106
S. Molaei, Shahram Molaei, M. A. G. Asl, J. Sadeghi, R. Tavakkoli-Moghaddam
{"title":"A DNA Algorithm for Solving Vehicle Routing Problem","authors":"S. Molaei, Shahram Molaei, M. A. G. Asl, J. Sadeghi, R. Tavakkoli-Moghaddam","doi":"10.1109/CSCI.2014.106","DOIUrl":"https://doi.org/10.1109/CSCI.2014.106","url":null,"abstract":"Since the great capacity of deoxyribonucleic acid (DNA) computing to perform parallel relation, it has magnetized attention. Rely on this property, the DNA computing can be used for solving hard problems such as NP-Complete problems. Therefore, this paper proposes a molecular algorithm to solve Vehicle Routing Problem (VRP) as an NP-hard problem. In addition, a new representation for graph in DNA format is presented so that a graph is represented with only its vertices strands by defining an identifier in which specifies the existence edge between two vertices. The proposed algorithm generates an initial pool solution and creates whole random search space by polymerase chain reaction (PCR) operation and chooses a feasible solution by valid length and then selects the best solution based on distance between customers. We use both properties, selection by the length of strand that it has done by Gel Electrophoresis, and selection based on Guanine-Cytosine content.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129245634","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
Promoting Inclusion of Underrepresented Populations in Computing 促进将未获充分代表的人口纳入计算领域
2014 International Conference on Computational Science and Computational Intelligence Pub Date : 2014-03-10 DOI: 10.1109/CSCI.2014.122
L. Grabowski, Christine F. Reilly
{"title":"Promoting Inclusion of Underrepresented Populations in Computing","authors":"L. Grabowski, Christine F. Reilly","doi":"10.1109/CSCI.2014.122","DOIUrl":"https://doi.org/10.1109/CSCI.2014.122","url":null,"abstract":"Promoting inclusion of underrepresented groups in computing and technology fields remains a critical issue in computing education. Gender, ethnicity, and socioeconomic background are all key factors that limit access to technology and have lasting impacts on students and their career choices. This paper reports a new effort to broaden participation in computing, focused on recruitment and retention, through a new local student chapter of Association for Computing Machinery's Committee on Women (ACM-W). The new chapter was created at the University of Texas-Pan American, a primarily undergraduate, Hispanic-serving regional university in the lower Rio Grande Valley of Texas.","PeriodicalId":439385,"journal":{"name":"2014 International Conference on Computational Science and Computational Intelligence","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123197804","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学术官方微信