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

Comput. Informatics最新文献

筛选
英文 中文
Suffix arrays with a twist 用扭曲后缀数组
Comput. Informatics Pub Date : 2016-07-27 DOI: 10.31577/CAI_2019_3_555
T. Kowalski, S. Grabowski, K. Fredriksson, Marcin Raniszewski
{"title":"Suffix arrays with a twist","authors":"T. Kowalski, S. Grabowski, K. Fredriksson, Marcin Raniszewski","doi":"10.31577/CAI_2019_3_555","DOIUrl":"https://doi.org/10.31577/CAI_2019_3_555","url":null,"abstract":"The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that $(i)$ how we search for the right interval boundary impacts significantly the overall search speed, $(ii)$ a B-tree data layout easily wins over the standard one, $(iii)$ the well-known idea of a lookup table for the prefixes of the suffixes can be refined with using compression, $(iv)$ caching prefixes of the suffixes in a helper array can pose a(nother) practical space-time tradeoff.","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131609012","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
A Practical Index for Approximate Dictionary Matching with Few Mismatches 一种实用的少错配近似字典匹配索引
Comput. Informatics Pub Date : 2015-01-20 DOI: 10.4149/cai_2017_5_1088
Aleksander Cislak, S. Grabowski
{"title":"A Practical Index for Approximate Dictionary Matching with Few Mismatches","authors":"Aleksander Cislak, S. Grabowski","doi":"10.4149/cai_2017_5_1088","DOIUrl":"https://doi.org/10.4149/cai_2017_5_1088","url":null,"abstract":"Approximate dictionary matching is a classic string matching problem (checking if a query string occurs in a collection of strings) with applications in, e.g., spellchecking, online catalogs, geolocation, and web searchers. We present a surprisingly simple solution called a split index, which is based on the Dirichlet principle, for matching a keyword with few mismatches, and experimentally show that it offers competitive space-time tradeoffs. Our implementation in the C++ language is focused mostly on data compaction, which is beneficial for the search speed (e.g., by being cache friendly). We compare our solution with other algorithms and we show that it performs better for the Hamming distance. Query times in the order of 1 microsecond were reported for one mismatch for the dictionary size of a few megabytes on a medium-end PC. We also demonstrate that a basic compression technique consisting in $q$-gram substitution can significantly reduce the index size (up to 50% of the input text size for the DNA), while still keeping the query time relatively low.","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131331090","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
Video Shot Boundary Detection Using Generalized Eigenvalue Decomposition and Gaussian Transition Detection 基于广义特征值分解和高斯过渡检测的视频镜头边界检测
Comput. Informatics Pub Date : 2009-07-09 DOI: 10.1007/978-3-642-02457-3_64
A. Amiri, M. Fathy
{"title":"Video Shot Boundary Detection Using Generalized Eigenvalue Decomposition and Gaussian Transition Detection","authors":"A. Amiri, M. Fathy","doi":"10.1007/978-3-642-02457-3_64","DOIUrl":"https://doi.org/10.1007/978-3-642-02457-3_64","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122622022","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}
引用次数: 30
Exploratory Comparison of Expert and Novice Pair Programmers 专家和新手结对程序员的探索性比较
Comput. Informatics Pub Date : 2008-10-13 DOI: 10.1007/978-3-642-22386-0_17
Andreas Höfer
{"title":"Exploratory Comparison of Expert and Novice Pair Programmers","authors":"Andreas Höfer","doi":"10.1007/978-3-642-22386-0_17","DOIUrl":"https://doi.org/10.1007/978-3-642-22386-0_17","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122458126","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
Modelling, Analysing and Control of Interactions Among Agents in MAS MAS中agent间交互的建模、分析与控制
Comput. Informatics Pub Date : 2006-05-28 DOI: 10.1007/11758532_25
F. Capkovic
{"title":"Modelling, Analysing and Control of Interactions Among Agents in MAS","authors":"F. Capkovic","doi":"10.1007/11758532_25","DOIUrl":"https://doi.org/10.1007/11758532_25","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372676","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}
引用次数: 29
An Ontology for Network Services 网络服务本体
Comput. Informatics Pub Date : 2006-05-28 DOI: 10.1007/11758532_33
Pedro Alípio, J. Neves, P. Carvalho
{"title":"An Ontology for Network Services","authors":"Pedro Alípio, J. Neves, P. Carvalho","doi":"10.1007/11758532_33","DOIUrl":"https://doi.org/10.1007/11758532_33","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129544480","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
Segmentation in Echocardiographic Sequences Using Shape-based Snake Model 基于形状Snake模型的超声心动图序列分割
Comput. Informatics Pub Date : 2005-09-06 DOI: 10.1007/11553595_46
C. Sheng, Y. Xin
{"title":"Segmentation in Echocardiographic Sequences Using Shape-based Snake Model","authors":"C. Sheng, Y. Xin","doi":"10.1007/11553595_46","DOIUrl":"https://doi.org/10.1007/11553595_46","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973692","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
BVFB: Training Behavior Verification Mechanism for Secure Blockchain-Based Federated Learning BVFB:基于区块链的安全联邦学习的训练行为验证机制
Comput. Informatics Pub Date : 1900-01-01 DOI: 10.31577/cai_2022_6_1401
Zhaohui Zhang, Jiawei Hu, Lina Ma, Ruoxuan Pei, P. Wang
{"title":"BVFB: Training Behavior Verification Mechanism for Secure Blockchain-Based Federated Learning","authors":"Zhaohui Zhang, Jiawei Hu, Lina Ma, Ruoxuan Pei, P. Wang","doi":"10.31577/cai_2022_6_1401","DOIUrl":"https://doi.org/10.31577/cai_2022_6_1401","url":null,"abstract":"","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"174 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":"124253718","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
Fast Converging Evolutionary Strategy for Multi-Constraint QoS Routing in Computer Networks Using New Decoding Mechanism 基于新解码机制的多约束QoS路由快速收敛进化策略
Comput. Informatics Pub Date : 1900-01-01 DOI: 10.4149/cai_2017_2_405
H. Shahhoseini, Samaneh Torkzadeh
{"title":"Fast Converging Evolutionary Strategy for Multi-Constraint QoS Routing in Computer Networks Using New Decoding Mechanism","authors":"H. Shahhoseini, Samaneh Torkzadeh","doi":"10.4149/cai_2017_2_405","DOIUrl":"https://doi.org/10.4149/cai_2017_2_405","url":null,"abstract":"In recent years, real-time multimedia applications’ demands such as Voice-on-IP (VoIP) and video conference are extremely increased which require QoS routing. This type of routing has been considered as an NP-Complete problem since it requires satisfying multiple constraints. Many solutions have been proposed to solve it, but most of them are complex and time consuming. In this paper, a novel multi-constraints QoS routing algorithm is proposed based on Evolutionary Strategies (ES). The algorithm preserves simplicity and offers a feasible solution in a few numbers of generations. This is due to a novel gene decoding mechanism that is used in the algorithm; and consequently more simple evolutionary operators can be applied. The simulation results show that our method outperforms previous algorithms in terms of speed and performance, so that it is 2.6 and 11.3 times faster, and its success ratio is also better.","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"27 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":"120948472","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
Investigation of Parallel Data Processing Using Hybrid High Performance CPU + GPU Systems and CUDA Streams 基于混合高性能CPU + GPU系统和CUDA流的并行数据处理研究
Comput. Informatics Pub Date : 1900-01-01 DOI: 10.31577/cai_2020_3_510
P. Czarnul
{"title":"Investigation of Parallel Data Processing Using Hybrid High Performance CPU + GPU Systems and CUDA Streams","authors":"P. Czarnul","doi":"10.31577/cai_2020_3_510","DOIUrl":"https://doi.org/10.31577/cai_2020_3_510","url":null,"abstract":"The paper investigates parallel data processing in a hybrid CPU + GPU(s) system using multiple CUDA streams for overlapping communication and computations. This is crucial for efficient processing of data, in particular incoming data stream processing that would naturally be forwarded using multiple CUDA streams to GPUs. Performance is evaluated for various compute time to hostdevice communication time ratios, numbers of CUDA streams, for various numbers of threads managing computations on GPUs. Tests also reveal benefits of using CUDA MPS for overlapping communication and computations when using multiple processes. Furthermore, using standard memory allocation on a GPU and Unified Memory versions are compared, the latter including programmer added prefetching. Performance of a hybrid CPU+GPU version as well as scaling across multiple GPUs are demonstrated showing good speed-ups of the approach. Finally, the performance per power consumption of selected configurations are presented for various numbers of streams and various relative performances of GPUs and CPUs.","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"2 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989302","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
首页 上一页
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学术官方微信