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

2016 International Conference on Computational Science and Computational Intelligence (CSCI)最新文献

筛选
英文 中文
A Distributed Caching Approach for Improved Data Availability in Rural Wireless Mesh Networks 提高农村无线网状网络数据可用性的分布式缓存方法
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-16 DOI: 10.1109/CSCI.2016.0175
A. Ajayi, C. Edwards, U. Roedig
{"title":"A Distributed Caching Approach for Improved Data Availability in Rural Wireless Mesh Networks","authors":"A. Ajayi, C. Edwards, U. Roedig","doi":"10.1109/CSCI.2016.0175","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0175","url":null,"abstract":"The performance of wireless mesh networks (WMNs) deployed for Internet access in rural settings is affected by several factors. Typically, deployments in African domains use cheap and computationally constrained devices with challenges such as power fluctuations, gateway congestion, VSAT communications asymmetry and low bandwidth, which affects throughput under dynamic scenarios. Caching methods can offer improvement for content availability to ensure a reliable quality of experience (QoE) for rural dwellers. Primarily, we integrate a modified multicast technique and overhearing for object caching and cache dissemination. We proposed a Distributed Overheard-object Caching Approach (DOCA) and evaluated the performance employing simulations. The outcome shows significant improvements over the random-path-cache-request (RPCR) strategy with increased data availability and reduced communication cost regarding response time for the outlined rural scenarios. Moreover, the optimization of gateway load helps to conserve network resources such as bandwidth and nodal energy considerably.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114276684","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
CaRDIN: An Agile Environment for Edge Computing on Reconfigurable Sensor Networks CaRDIN:可重构传感器网络边缘计算的敏捷环境
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-15 DOI: 10.1109/CSCI.2016.0039
X. S. Le, Jean-Christophe Le Lann, Loïc Lagadec, L. Fabresse, N. Bouraqadi, Jannik Laval
{"title":"CaRDIN: An Agile Environment for Edge Computing on Reconfigurable Sensor Networks","authors":"X. S. Le, Jean-Christophe Le Lann, Loïc Lagadec, L. Fabresse, N. Bouraqadi, Jannik Laval","doi":"10.1109/CSCI.2016.0039","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0039","url":null,"abstract":"Sensor networks are now one of the key technologies for the Internet of Things (IoT). An IP-based sensor network allows a natural participation of sensor nodes to the IoT. Smart IoT systems are always constrained by real-time processing. Edge computing can be used to address this constraint. In such system, sensor nodes are often in need of more processing resource while being limited in power consumption. Reconfigurable architectures (i.e. FPGAs) offer a good tradeoff between these two factors. This paper addresses the challenge of developing and deploying IoT edge-centric applications on IP-based sensor networks consisting of hybrid nodes built on top of processors coupled with FPGAs. We introduce CaRDIN, a dedicated agile software/hardware environment and architecture for such system.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327384","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
Comparison of Edge Partitioners for Graph Processing 图处理中边缘划分方法的比较
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-15 DOI: 10.1109/CSCI.2016.0090
H. Mykhailenko, F. Huet, G. Neglia
{"title":"Comparison of Edge Partitioners for Graph Processing","authors":"H. Mykhailenko, F. Huet, G. Neglia","doi":"10.1109/CSCI.2016.0090","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0090","url":null,"abstract":"Deploying graph on a cluster requires its partitioning into a number of subgraphs, and assigning them to different machines. Two partitioning approaches have been proposed: vertex partitioning and edge partitioning. In the edge partitioning approach edges are allocated to partitions. Recent studies show that, for power-law graphs, edge partitioning is more effective than vertex partitioning. In this paper we provide an overview of existing edge partitioning algorithms. However, based only on published work, we cannot draw a clear conclusion about the relative performances of these partitioners. For this reason, we compare all the edge partitioners currently available for GraphX. Our preliminary results suggest that Hybrid-Cut partitioner provides the best performance.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131298471","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
Data Warehouse and BI to Catalize Information Use in Health Sector for Decision Making: A Case Study 数据仓库和商业智能促进卫生部门决策中的信息使用:一个案例研究
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-12 DOI: 10.1109/CSCI.2016.0025
Selemani Slum Ally, Nawaz Khan
{"title":"Data Warehouse and BI to Catalize Information Use in Health Sector for Decision Making: A Case Study","authors":"Selemani Slum Ally, Nawaz Khan","doi":"10.1109/CSCI.2016.0025","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0025","url":null,"abstract":"Health sector in most countries including Zanzibar lacks the single repository that integrates health management data produced by multitude of sources. The study proves cost effective but successful implementation of Data Warehouse (DW) plays useful role to influence informed decision making in the health sector. Successful DW needs to include necessary features such as Online Analytic Process (OLAP) which gives decision makers the freedom to analyses information into different format business intelligence (BI) tools, data mining and data presentation tools. In this study, we attempted to identify DW needs to consider culture of organization and what organization actual wants for decision making. The study proposed the cost effective DW and BI tools solution to catalyze informed decision making in health care industry. The study also aims to discuss challenges and sets out recommendations.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115433420","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
Exploring Instructional Computing Platforms for a Small Liberal Arts College: A Case Study with NoSQL 探索小型文理学院的教学计算平台:以NoSQL为例
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0069
Aijuan Dong, Baoying Wang
{"title":"Exploring Instructional Computing Platforms for a Small Liberal Arts College: A Case Study with NoSQL","authors":"Aijuan Dong, Baoying Wang","doi":"10.1109/CSCI.2016.0069","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0069","url":null,"abstract":"Large-scale computing technology, such as NoSQL database systems and cloud computing, has become an important knowledge area in computer science curriculum. In this study, we experimented and evaluated two instructional computing platforms—Amazon Elastic Compute Cloud (EC2) and Hood College Virtual Computing Lab (HOOD VCL)—for offering NoSQL database systems in a small liberal arts college. We tested four types of NoSQL systems: Redis, MongoDB, Cassandra, and Neo4j. With each system, students performed a few realistic lab exercises with either Amazon EC2 or Hood VCL. Based on student feedback, while Amazon EC2 and Hood VCL are comparable to students with respect to accessibility, easy setup and maintenance, and reliability, survey results show a majority of students (86%) are more likely to use Amazon EC2 for similar data processing course work in the future. In addition, 64% of students believe Amazon Web Services (AWS) are cost-effective and 82% of them believe that the AWS experience gained on public cloud infrastructure and pay-as-you-go resource allocation is helpful to their career development.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478656","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 Quadratic Programming Formulation to Find the Maximum Independent Set of Any Graph 求任意图的最大独立集的二次规划公式
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0255
Maher Heal
{"title":"A Quadratic Programming Formulation to Find the Maximum Independent Set of Any Graph","authors":"Maher Heal","doi":"10.1109/CSCI.2016.0255","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0255","url":null,"abstract":"Finding the maximum independent set (or stable set) of any graph is an important problem in graph theory that has many applications such as computer vision/pattern recognition, information/coding theory, molecular biology and scheduling. In this paper we propose a quadrating programming formulation for finding the maximum independent set of any graph from the maximal cliques of the graph. It is proved in the computing science literature, there exist near optimum algorithms to list the maximal cliques of sparse graphs. Accordingly, we except our formulation to be of value in finding the maximum independent set and the independence number of sparse graphs from the computational complexity standpoint. Using our formulation, we were able to find the unknown maximum independent set and independence number for some known graphs such as Gardner graph, Balaban 11 cage graph and Hoffman-Singleton line graph.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123173482","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
MH-ARM: A Multi-Mode and High-Value Association Rule Mining Technique for Healthcare Data Analysis 面向医疗数据分析的多模式、高价值关联规则挖掘技术
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0030
Libao Yang, Zhe Li, Guan Luo
{"title":"MH-ARM: A Multi-Mode and High-Value Association Rule Mining Technique for Healthcare Data Analysis","authors":"Libao Yang, Zhe Li, Guan Luo","doi":"10.1109/CSCI.2016.0030","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0030","url":null,"abstract":"The association rules mining process enables the end users to analyze, understand, and use the extracted knowledge in an intelligent system or to support the decision-making processes. To find valuable association rules from a large number of redundant rules, this paper proposes a deeper mining process, multi-mode and high value association rules mining (MH-ARM). This method takes into account the category information, the size of the item set, natural semantics, various metrics, and effective visualization of results. The process can effectively reduce the number of rules and improve the value and accuracy of the rules screened out for auxiliary diagnosis. In the end, the experimental data of rhinitis were analyzed and the effectiveness of the process was verified.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888355","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
Applying Workforce Intelligence Clustering on Egyptian Governorates 劳动力智能聚类在埃及各省的应用
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0106
N. Labib, Ahmed E. Sabry
{"title":"Applying Workforce Intelligence Clustering on Egyptian Governorates","authors":"N. Labib, Ahmed E. Sabry","doi":"10.1109/CSCI.2016.0106","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0106","url":null,"abstract":"Workforce Intelligence incorporates various tools that capture and record details about the organizations' workforce and relevant activities, such as employees' skills, experience, education, job description and other demographic data. In addition, it correlates the enterprises' operational systems with workforce activities to increase the efficiency of the analysis process and rationalize decision-making. It has several usages such as workforce planning and optimization, transitions, analytics and productivity. Since Egypt is currently focusing on the human capital because of its vital role in achieving Egypt's 2030 vision, this study analyzes national workforce data, classified according to governorates, and applies unsupervised clustering technique to portray employees' profile. The research conducts profiling of the twenty-seven Egyptian governorates using multi-dimensional mining with fifty-four dimensions. It addresses workforce distribution of employment, unemployment, industries and educational levels data. The resulted clustering attributes will help in the workforce planning and optimization in Egypt.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"21 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927458","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
Defocus Map Detection Using a Single Image 散焦地图检测使用单个图像
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0151
J. Andrade
{"title":"Defocus Map Detection Using a Single Image","authors":"J. Andrade","doi":"10.1109/CSCI.2016.0151","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0151","url":null,"abstract":"The estimation of blurred regions is an important stage in several computer vision applications. In this paper an efficient training-free detector of local blurriness based on edge features is presented. Due to the intrinsic sparsity of edges in natural images a blur map is creating by using an approach based on the heat diffusion principle. A 2D point discrete Poisson solver is concatenated with a guided filter stage in order to create the blurring map. Experiments with images from two publicly available datasets validate the proposed method.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121241523","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
Methodology for Band Selection of Hyperspectral Images Using Genetic Algorithms and Gaussian Maximum Likelihood Classifier 基于遗传算法和高斯极大似然分类器的高光谱图像波段选择方法
2016 International Conference on Computational Science and Computational Intelligence (CSCI) Pub Date : 2016-12-01 DOI: 10.1109/CSCI.2016.0143
D. Saqui, J. H. Saito, L. Jorge, E. Ferreira, D. C. Lima, João P. Herrera
{"title":"Methodology for Band Selection of Hyperspectral Images Using Genetic Algorithms and Gaussian Maximum Likelihood Classifier","authors":"D. Saqui, J. H. Saito, L. Jorge, E. Ferreira, D. C. Lima, João P. Herrera","doi":"10.1109/CSCI.2016.0143","DOIUrl":"https://doi.org/10.1109/CSCI.2016.0143","url":null,"abstract":"Remote Sensing is a technique to obtain data from objects without physical contact using sensors. If it is performed by hyperspectral sensors, then is possible to have a large number of bands that allows many applications. In this case, a large amount of data needs to be processed and analyzed, and therefore the practical use of these images have challenges with storage, transport and processing time. Another issue is that many of these bands contain redundant information due to high correlation between them that can cause instability in the convergence of computing processes. Because of these problems there is a need to select important bands to be processed. In many monitoring applications through remote sensing prior knowledge of areas can be used to improve the processing. Algorithms that use this information are known as supervised methods. This study introduces a methodology for band selection based on Genetic Algorithms and Gaussian Maximum Likelihood Classifier. The results were significant and demonstrate that the proposed method can reduce about 26,56% of the number of bands in hyperspectral images maintaining good quality for interpretation. The result of the similarity of the segmentation of images generated with fewer bands and more bands in the proposed methodology and the other algorithm were also compared. With the results expected to apply the proposed methodology in practical work and further study.","PeriodicalId":186778,"journal":{"name":"2016 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125811168","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}
引用次数: 11
下一页 尾页
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学术官方微信
小红书