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

2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)最新文献

筛选
英文 中文
The methodology of measuring throughput of a wireless network 测量无线网络吞吐量的方法
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028689
Filip Holík, J. Horalek, Ondrej Marik, Sona Neradova, Stanislav Zitta
{"title":"The methodology of measuring throughput of a wireless network","authors":"Filip Holík, J. Horalek, Ondrej Marik, Sona Neradova, Stanislav Zitta","doi":"10.1109/CINTI.2014.7028689","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028689","url":null,"abstract":"It is important to measure network performance in the whole network life cycle. In the development phase network architects can estimate how the network will work for desired number of users and their needs more accurately. In the implementation and testing phases network engineers can conduct a site survey and thus measure network performance in any given location. Spots with poor performance can be then detected and corrected. The last phase is network monitoring where measuring network performance brings advantages like summary statistics and the ability to predict network congestion, which could be prevented by well-timed network upgrade. This paper introduces new methodology for measuring data throughput of a wireless network in a real environment. The methodology is based on deficiencies found in existing approaches to measure wireless throughput.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124253392","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
Effective penetration testing with Metasploit framework and methodologies 使用Metasploit框架和方法进行有效的渗透测试
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028682
Filip Holík, J. Horalek, Ondrej Marik, Sona Neradova, Stanislav Zitta
{"title":"Effective penetration testing with Metasploit framework and methodologies","authors":"Filip Holík, J. Horalek, Ondrej Marik, Sona Neradova, Stanislav Zitta","doi":"10.1109/CINTI.2014.7028682","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028682","url":null,"abstract":"Nowadays, information security is very important, because more and more confidential information, like medical reports, is being stored electronically on computer systems and those systems are often connected to computer networks. This represents new challenges for people working in information technology. They have to ensure that those systems are as much secure as possible and confidential information will not be revealed. One possible way how to prove system security is to conduct regular penetration tests - e.g. simulate attacker's malicious activity. This article briefly introduces the basics of penetration testing and shows how to deploy and use Metasploit framework when conducting penetration testing. Finally, a case study in production environment is shown. Software tools and techniques described in this work are also valid and applicable for SCADA systems and moreover in any other field where computer networks are used.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698743","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}
引用次数: 66
Building book catalog using image processing 利用图像处理技术建立图书目录
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028680
G. Windisch, Martin Mihalyí, Z. Vámossy
{"title":"Building book catalog using image processing","authors":"G. Windisch, Martin Mihalyí, Z. Vámossy","doi":"10.1109/CINTI.2014.7028680","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028680","url":null,"abstract":"In this article we describe an automatic initialization-free method for building and managing book catalogs. At the heart of the system there is an image processing algorithm which can analyze the contents of an image taken of a bookshelf, separate the book spines into subsequent images and use an OCR algorithm on it to find the title and author of the book. The title and author information is searched for in public book databases to find all the details of the given book which can then be stored. The article describes the methods used along with accuracy measurements for the different modules of our system.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835593","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
Code hunt — “hunting” to learn programming 代码搜索-“搜索”学习编程
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028698
S. M. Cisar, R. Pinter, P. Císar
{"title":"Code hunt — “hunting” to learn programming","authors":"S. M. Cisar, R. Pinter, P. Císar","doi":"10.1109/CINTI.2014.7028698","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028698","url":null,"abstract":"Programming is a major subject in Computer Science (CS) departments. However, students often face difficulties on the basic programming courses due to several factors that cause these difficulties. The most important reason may be the lack of problem solving abilities that many students show. Learning to code can be made more effective if it is perceived as fun by the learner. Code Hunt uses puzzles that players have to explore by means of clues presented as test cases. Players iteratively modify their code to match the functional behavior of secret solutions. The aim of this paper is to introduce an educational, browser-based coding game which can help in learning coding.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125089474","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
Multi-hard-objective optimum design of surface acoustic wave duplexers using adaptive differential evolution 基于自适应差分进化的表面声波双工器多硬目标优化设计
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028709
K. Tagawa, Akihiro Imamura, Shoichi Harada
{"title":"Multi-hard-objective optimum design of surface acoustic wave duplexers using adaptive differential evolution","authors":"K. Tagawa, Akihiro Imamura, Shoichi Harada","doi":"10.1109/CINTI.2014.7028709","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028709","url":null,"abstract":"This paper proposes a novel computer-aided design method of Surface Acoustic Wave (SAW) duplexers which are used widely in the modern Radio Frequency (RF) circuits of various mobile communication systems. The desirable frequency response characteristics of a SAW duplexer are specified by a number of necessary conditions. Besides, the frequency response characteristics of the SAW duplexer depends on its geometrical structure. The major advantage of the proposed design method is that it provides the designer with a set of optimal solutions, or structures, instead of a single solution. Therefore, the designer can choose a solution which of them best fits the application under consideration. According to the proposed design method, the structural design of a SAW duplexer is described as a Multi-Hard-objective Optimization Problem (MHOP) in which each of multiple objective functions is restricted to be less than its upper bound. Then, in order to obtain a number of non-dominated feasible solutions for MHOP, a new evolutionary algorithm based on Differential Evolution (DE) is employed. Finally, through analysis of the non-dominated feasible solutions, or structures, obtained by the DE-based algorithm, suitable structures of the SAW duplexer are considered from various viewpoints.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125243336","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
Bat algorithm: Recent advances 蝙蝠算法:最新进展
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028669
Iztok Fister, Xin-She Yang, S. Fong, Zhuang Yan
{"title":"Bat algorithm: Recent advances","authors":"Iztok Fister, Xin-She Yang, S. Fong, Zhuang Yan","doi":"10.1109/CINTI.2014.7028669","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028669","url":null,"abstract":"The bat algorithm (BA) is a nature-inspired algorithm, which has recently been applied in many applications. BA can deal with both continuous optimization and discrete optimization problems. The literature has expanded significantly in the past few years, this paper provides a timely review of the latest developments. We also highlight some topics for further research.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195574","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}
引用次数: 63
Estimation methods of calculations complexity in distribution management systems 配电管理系统计算复杂度的估计方法
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028697
L. Martinović, D. Capko, A. Erdeljan
{"title":"Estimation methods of calculations complexity in distribution management systems","authors":"L. Martinović, D. Capko, A. Erdeljan","doi":"10.1109/CINTI.2014.7028697","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028697","url":null,"abstract":"This paper discusses the possibility of using the configuration of electric power distribution network as one of the inputs for load balancing of calculations based on power flow. The work contains the basic description of problem with the explanation of the need for distributing power flow calculations to different computational nodes. Two different methods are considered for estimation of calculation execution time: linear approximation and neural network. Experiments show that neural network achieves better results than linear approximation method.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132777150","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
Voting based fuzzy linguistic matching 基于投票的模糊语言匹配
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028692
B. Villányi, P. Martinek, Andor Szamos
{"title":"Voting based fuzzy linguistic matching","authors":"B. Villányi, P. Martinek, Andor Szamos","doi":"10.1109/CINTI.2014.7028692","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028692","url":null,"abstract":"Schema matching is an essential task in data integration scenarios. The proposed schema matchers can be classified into several categories, one of which is the category of linguistic matchers, which evaluate relatedness comparing the textual elements in the schemata. There are several linguistic matchers the performance of which may vary from scenario to scenario. In order to eliminate the incorrect similarity values, we have implemented a voting based approach. Another contribution presented in this paper is the proposed fuzzy linguistic matching, which involves the transformation of similarity values into membership functions.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129504958","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
An algorithmic skeleton for massively parallelized mean shift computation with applications to GPU architectures 基于GPU架构的大规模并行平均移位计算的算法框架
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028658
Darius Malysiak, U. Handmann
{"title":"An algorithmic skeleton for massively parallelized mean shift computation with applications to GPU architectures","authors":"Darius Malysiak, U. Handmann","doi":"10.1109/CINTI.2014.7028658","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028658","url":null,"abstract":"In this paper we discuss parallelization approaches for generic mean shift clustering. We provide an algorithmic skeleton which allows an easy creation of platform specific implementations, be it small scale systems as multicore CPUs, large GPUs or even distributed cluster systems. Additionally we provide an exhaustive runtime complexity analysis and various remarks for further research. In order to illustrate the practicability of our theoretic framework we discuss a GPU implementation which exhibits significant speedups for small and large scale datasets.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130806683","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
Accelerating SAT solving with best-first-search 用最佳优先搜索加速SAT求解
2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI) Pub Date : 2014-11-01 DOI: 10.1109/CINTI.2014.7028722
Dávid Bartók, Z. Mann
{"title":"Accelerating SAT solving with best-first-search","authors":"Dávid Bartók, Z. Mann","doi":"10.1109/CINTI.2014.7028722","DOIUrl":"https://doi.org/10.1109/CINTI.2014.7028722","url":null,"abstract":"Solvers for Boolean satisfiability (SAT), like other algorithms for NP-complete problems, tend to have a heavy-tailed runtime distribution. Successful SAT solvers make use of frequent restarts to mitigate this problem by abandoning unfruitful parts of the search space after some time. Although frequent restarting works fairly well, it is a quite simplistic technique that does not do anything explicitly to make the next try better than the previous one. In this paper, we suggest a more sophisticated method: using a best-fIrst-search approach to quickly move between different parts of the search space. This way, the search can always focus on the most promising region. We investigate empirically how the performance of frequent restarts, best-fIrst-search, and a combination of the two compare to each other. Our findings indicate that the combined method works best, improving 36-43 % on the performance of frequent restarts on the used set of benchmark problems.","PeriodicalId":435053,"journal":{"name":"2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666169","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学术文献互助群
群 号：604180095
Book学术官方微信
小红书