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

2012 16th Panhellenic Conference on Informatics最新文献

筛选
英文 中文
On the Numerical Modeling and Solution of a Time Harmonic 3D Wave Equation by Explicit Approximate Inverse Preconditioning 时间调和三维波动方程的显式近似逆预处理数值模拟与求解
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCi.2012.13
A. Karamouta, C. Filelis-Papadopoulos, G. Gravvanis, M. Chryssomallis
{"title":"On the Numerical Modeling and Solution of a Time Harmonic 3D Wave Equation by Explicit Approximate Inverse Preconditioning","authors":"A. Karamouta, C. Filelis-Papadopoulos, G. Gravvanis, M. Chryssomallis","doi":"10.1109/PCi.2012.13","DOIUrl":"https://doi.org/10.1109/PCi.2012.13","url":null,"abstract":"Explicit Preconditioned Biconjugate gradient methods, based on approximate inverse are used for the evaluation of the field distributions inside an electromagnetic cavity resonator. Numerical results indicating the effectiveness of the method are presented and visualization results were found in qualitative agreement with theoretical results.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132404530","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
On the Algebraic Multigrid Method Based on Generic Approximate Banded Inverses 基于一般近似带状逆的代数多重网格法
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCi.2012.14
P. I. Matskanidis, G. Gravvanis
{"title":"On the Algebraic Multigrid Method Based on Generic Approximate Banded Inverses","authors":"P. I. Matskanidis, G. Gravvanis","doi":"10.1109/PCi.2012.14","DOIUrl":"https://doi.org/10.1109/PCi.2012.14","url":null,"abstract":"Since the introduction of the Algebraic MultiGrid algorithm (AMG) over twenty years ago, significant progress has been made in improving and refining it. In this article, an AMG method is presented using generic approximate banded inverses based on incomplete LU factorization as smoothers. Finally, the applicability and effectiveness of the proposed AMG method on a characteristic two dimensional boundary value problem is demonstrated and numerical results on the convergence behavior and convergence factor are given.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115281001","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
Using Strand Space Model to Verify the Privacy Properties of a Fair Anonymous Authentication Scheme 利用链空间模型验证公平匿名认证方案的隐私性
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCi.2012.73
Nikolaos Petrakos, P. Kotzanikolaou, C. Douligeris
{"title":"Using Strand Space Model to Verify the Privacy Properties of a Fair Anonymous Authentication Scheme","authors":"Nikolaos Petrakos, P. Kotzanikolaou, C. Douligeris","doi":"10.1109/PCi.2012.73","DOIUrl":"https://doi.org/10.1109/PCi.2012.73","url":null,"abstract":"The strand space model has been proposed as a formal method for verifying the security goals of cryptographic protocols. Many cryptographic protocols aim not only to provide security, but also privacy properties of the communication such as anonymity. In this paper, we apply the strand space model in order to verify the security and privacy goals of a recently proposed anonymous authentication scheme. We show that the strand space model can be used to formalize privacy properties such as transaction untraceability and unlink ability, user non-frame ability and anonymous credential non-transferability.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132528769","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
Measuring the Occurrence of Security-Related Bugs through Software Evolution 通过软件进化测量安全相关bug的发生
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCI.2012.15
Dimitris Mitropoulos, Georgios Gousios, D. Spinellis
{"title":"Measuring the Occurrence of Security-Related Bugs through Software Evolution","authors":"Dimitris Mitropoulos, Georgios Gousios, D. Spinellis","doi":"10.1109/PCI.2012.15","DOIUrl":"https://doi.org/10.1109/PCI.2012.15","url":null,"abstract":"A security-related bug is a programming error that introduces a potentially exploitable weakness into a computer system. This weakness could lead to a security breach with unfortunate consequences. Version control systems provide an accurate historical record of the software code's evolution. In this paper we examine the frequency of the security-related bugs throughout the evolution of a software project by applying the Find Bugs static analyzer on all versions of its revision history. We have applied our approach on four projects and we have come out with some interesting results including the fact that the number of the security-related bugs increase as the project evolves.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125430523","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}
引用次数: 10
Proactivity in Service Based Applications 基于服务的应用程序中的主动性
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCi.2012.59
G. Vlahakis, Dimitris Apostolou
{"title":"Proactivity in Service Based Applications","authors":"G. Vlahakis, Dimitris Apostolou","doi":"10.1109/PCi.2012.59","DOIUrl":"https://doi.org/10.1109/PCi.2012.59","url":null,"abstract":"Advancements in Service-Oriented Architectures, Cloud Computing and Wireless Sensor Networks pose challenges with respect to dynamic application adaptation, the ability to reconfigure applications so as to support continuous, unimpeded augmentation of services in response to changing environmental circumstances. Proactivity of Service Based applications refers to anticipatory, change-oriented and self initiated behavior in situations and deals with the identification of new services as well as the identification of potential risks and opportunities that require adaptation based on situational and contextual information. In this paper we identify the proactive characteristics of Service Based Applications and we survey existing approaches based on the proposed characteristics.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"393 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285856","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
On the Use of Optimal Stopping Theory for Cache Consistency Checks 最优停止理论在缓存一致性检查中的应用
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI: 10.1109/PCi.2012.71
Manos Spanoudakis, Dimitris Lorentzos, C. Anagnostopoulos, S. Hadjiefthymiades
{"title":"On the Use of Optimal Stopping Theory for Cache Consistency Checks","authors":"Manos Spanoudakis, Dimitris Lorentzos, C. Anagnostopoulos, S. Hadjiefthymiades","doi":"10.1109/PCi.2012.71","DOIUrl":"https://doi.org/10.1109/PCi.2012.71","url":null,"abstract":"Serving the most updated version of a resource with minimal networking overhead is always a challenge for WWW Caching, especially, for weak consistency algorithms such as the widely adopted Adaptive Time-to-Live (ATTL). We adopt the Optimal Stopping Theory (OST) and, specifically, the Odds-algorithm, to enable the caching server to accurately handle the object refreshing and the stale delivery problem. Simulation results show that the proposed OST-based algorithm outperforms the conventional ATTL.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115027707","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
Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering 基于聚类的原型选择快速准确的k近邻分类
2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-01 DOI: 10.1109/PCi.2012.69
Stefanos Ougiaroglou, Georgios Evangelidis
{"title":"Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering","authors":"Stefanos Ougiaroglou, Georgios Evangelidis","doi":"10.1109/PCi.2012.69","DOIUrl":"https://doi.org/10.1109/PCi.2012.69","url":null,"abstract":"Data reduction is very important especially when using the k-NN Classifier on large datasets. Many prototype selection and generation Algorithms have been proposed aiming to condense the initial training data as much as possible and keep the classification accuracy at a high level. The Prototype Selection by Clustering (PSC) algorithm is one of them and is based on a cluster generation procedure. Contrary to many other prototype selection and generation algorithms, its main goal is the fast execution of the data reduction procedure rather than high reduction rate. In this paper, we demonstrate that the reduction rate and the classification accuracy of PSC can be improved by generating a larger number of clusters. Moreover, we compare the performance of the particular algorithm with two state-of-the-art algorithms, one selection and one generation, using six real life datasets. The experimental results indicate that the classification performance of the Prototype Selection by Clustering algorithm is comparable with that of its competitors when using many clusters.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117120","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}
引用次数: 21
首页 上一页
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学术官方微信