Proceedings of the 19th Panhellenic Conference on Informatics最新文献

筛选
英文 中文
Deflation techniques in conjunction with generic factored approximate sparse inverse preconditioning 与一般因子近似稀疏逆预处理相结合的通货紧缩技术
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801986
B. E. Moutafis, C. Filelis-Papadopoulos, G. Gravvanis
{"title":"Deflation techniques in conjunction with generic factored approximate sparse inverse preconditioning","authors":"B. E. Moutafis, C. Filelis-Papadopoulos, G. Gravvanis","doi":"10.1145/2801948.2801986","DOIUrl":"https://doi.org/10.1145/2801948.2801986","url":null,"abstract":"A class of Modified Generic Factored Approximate Sparse Inverse matrix, based on sparsity patterns and a column-wise computational approach, has been recently proposed and used for solving general sparse linear systems. For certain classes of problems the number of nonzero elements increases rapidly as the \"levels of fill\" parameter is increased in the process of computing the sparsity pattern of the approximate inverse. In order to improve the approximate inverse preconditioning schemes without increasing the nonzero elements, deflation techniques are also introduced. The basis vectors for the deflation are computed algebraically based on separating the graph corresponding to the matrix into well partitioned sets. Furthermore, various graph partitioning methods are used in order to choose better basis vectors for the deflation method. Finally, the applicability of the proposed schemes is examined and numerical results are given.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130438","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 formulating and tackling integrated circuit placement as a scheduling problem 集成电路布置作为调度问题的制定与解决
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801965
P. Oikonomou, Thanasis Loukopoulos, Antonios N. Dadaliaris, M. Koziri, G. Stamoulis
{"title":"On formulating and tackling integrated circuit placement as a scheduling problem","authors":"P. Oikonomou, Thanasis Loukopoulos, Antonios N. Dadaliaris, M. Koziri, G. Stamoulis","doi":"10.1145/2801948.2801965","DOIUrl":"https://doi.org/10.1145/2801948.2801965","url":null,"abstract":"Integrated circuit (IC) placement consists of placing the cells of the IC on a chip plane so that overall performance is optimized. Various performance criteria have been considered with the most common being wire length. In this paper we tackle the problem with the optimization goal of reducing end to end delay, also called critical or longest path. We investigate the case where the chip plane has a priori (before placement) \"sweet\" spots, discuss its complexity and show the problem's relevance to job scheduling. In the experimental evaluation we provide hindsight on the optimization margins of scheduling heuristics.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126982386","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}
引用次数: 5
Estimating student dropout in distance higher education using semi-supervised techniques 利用半监督技术估计远程高等教育学生辍学率
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2802013
Georgios Kostopoulos, S. Kotsiantis, P. Pintelas
{"title":"Estimating student dropout in distance higher education using semi-supervised techniques","authors":"Georgios Kostopoulos, S. Kotsiantis, P. Pintelas","doi":"10.1145/2801948.2802013","DOIUrl":"https://doi.org/10.1145/2801948.2802013","url":null,"abstract":"Nowadays, distance higher education has rapidly increased due to advance and integration of information and communications' technology. Students who attend online distance courses have often family obligations and job commitments and are usually in 'high risk' of dropout during their attendance. It is of a highly importance to identify such students, through paying extra attention and support to them could possibly minimize the possibility of student failure or even dropout. The present research intends to study whether semi-supervised techniques could be useful in student dropout prediction in distance higher education. Semi-supervised learning aims to generate reliable predictions using few labeled and many unlabeled data. Labeled data are difficult obtainable quite often, as they require many experts, a lot of human effort and time in experiments. As far as, we are aware in several studies propose and compare supervised methods for students' dropout prediction rates in higher education, but none of them investigates the effectiveness of semi-supervised methods. The results of our experiments reveal that a good predictive accuracy can be achieved using few labeled data in comparison to well known supervised learning algorithms. For that purpose we have developed a web-based tool to estimate if an individual student is going to dropout.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130632184","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}
引用次数: 36
Dynamic reduce task adjustment for hadoop workloads 动态减少hadoop工作负载的任务调整
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801953
Vaggelis Antypas, Nikos Zacheilas, V. Kalogeraki
{"title":"Dynamic reduce task adjustment for hadoop workloads","authors":"Vaggelis Antypas, Nikos Zacheilas, V. Kalogeraki","doi":"10.1145/2801948.2801953","DOIUrl":"https://doi.org/10.1145/2801948.2801953","url":null,"abstract":"In recent years, we observe an increasing demand for systems that are capable of efficiently managing and processing huge amounts of data. Apache's Hadoop, an open-source implementation of Google's MapReduce programming model, has emerged as one of the most popular systems for Big Data processing and is supported by major companies like Facebook, Yahoo! and Amazon. One of the most challenging aspects of executing a Hadoop job, is to configure appropriately the number of reduce tasks. The problem is exacerbated when multiple jobs are executing concurrently competing for the available system resources. Our approach consists of the following components: (i) an algorithm for computing the appropriate number of reduce tasks per job, (ii) the usage of profiler-jobs for gathering information necessary for the reduce task computation and (iii) two different policies for fragmenting the reduce tasks to the available system resources when multiple jobs execute concurrently in the cluster. Our detailed experimental evaluation using traffic monitoring Hadoop jobs on our local cluster, illustrates that our approach is practical and exhibits solid performance.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128021514","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
Designing digital artifacts as transient assemblies with different digital materialities 将数字工件设计为具有不同数字材料的瞬态组件
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801968
D. Akoumianakis, N. Karadimitriou, Dimitrios Kotsalis, Giorgos Ktistakis, C. Michailidis, Efthimios Syntychakis, G. Vellis, N. Vidakis, George Vlachakis
{"title":"Designing digital artifacts as transient assemblies with different digital materialities","authors":"D. Akoumianakis, N. Karadimitriou, Dimitrios Kotsalis, Giorgos Ktistakis, C. Michailidis, Efthimios Syntychakis, G. Vellis, N. Vidakis, George Vlachakis","doi":"10.1145/2801948.2801968","DOIUrl":"https://doi.org/10.1145/2801948.2801968","url":null,"abstract":"This paper is inspired by the concept of digital metamaterials and advances a proposal for a genre of digital artifacts that exhibit the transformative capacity to transcend technical boundaries in digital ecosystems. In terms of theoretical footing, our approach is ground on the conception of 'software as material' with intrinsic properties such as interactivity, editability, openness and reprogrammability, distributedness and emergence. We claim that as these properties are purposefully inscribed into digital artifacts, the latter become transient assemblies capable of exhibiting different digital materialities. To illustrate the concepts, the paper reflects upon a case study featuring the use of digital composites in boundary spanning virtual collaboration in organic farming.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602625","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
Automating data management in heterogeneous systems using polyhedral analysis 使用多面体分析自动化异构系统中的数据管理
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801957
V. Vassiliadis, C. Antonopoulos, George Zindros
{"title":"Automating data management in heterogeneous systems using polyhedral analysis","authors":"V. Vassiliadis, C. Antonopoulos, George Zindros","doi":"10.1145/2801948.2801957","DOIUrl":"https://doi.org/10.1145/2801948.2801957","url":null,"abstract":"In this paper we introduce a framework which automates the task of data management for OpenCL programs across multiple devices of a heterogeneous system. Our approach uses compile-time analysis, based on the polyhedral model, to associate computations with the data they consume / produce. The results of the analysis are then used by a runtime system which automates the task of data management. Beyond alleviating the programmer from the burden of data management, our framework enables partitioning computations to all computational devices of heterogeneous systems according to the computational power and memory capacity of each device, thus facilitating the exploitation of all computational and memory resources of the system. We evaluate our approach on a system containing a multi-core CPU and 4 GPUs, using a set of OpenCL applications and benchmarks. We find that our framework allows the transparent utilization of all heterogeneous resources with negligible overhead (1.24% on average over hand-mapped to the target system versions of the codes). At the same time, it enables the execution of problem sizes which could not be executed on homogeneous, or less complex heterogeneous systems, due to their high computational and memory requirements.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122249913","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
Computer assisted gesture recognition for the greek sign language / fingerspelling 计算机辅助手势识别希腊手语/手指拼写
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2802034
Despoina Kotsidou, C. Angelis, Stamatis Dragoumanos, A. Kakarountas
{"title":"Computer assisted gesture recognition for the greek sign language / fingerspelling","authors":"Despoina Kotsidou, C. Angelis, Stamatis Dragoumanos, A. Kakarountas","doi":"10.1145/2801948.2802034","DOIUrl":"https://doi.org/10.1145/2801948.2802034","url":null,"abstract":"A significant percentage of the population is suffering from deafness, making simple day-to-day activities hard to complete. Although deaf people have developed a special sign language to communicate, it is a fact that only they and their relatives and friends are capable to use it. This limits significantly communication with other people, and as a consequence, it also limits opportunities. In this paper, the first results of a work-in-progress are presented, that focuses in creating a computer assisted recognition system of the Greek Sign Language. This is the first work of this kind to the best of the knowledge of the authors.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128938328","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 CAD tool for custom magnitude comparators 用于自定义幅度比较器的CAD工具
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801967
Giannis Petrousov, M. Dasygenis
{"title":"A CAD tool for custom magnitude comparators","authors":"Giannis Petrousov, M. Dasygenis","doi":"10.1145/2801948.2801967","DOIUrl":"https://doi.org/10.1145/2801948.2801967","url":null,"abstract":"Inarguably, the increased system complexity of modern hardware, inhibits the time-to-market of new components and jeopardizes the credibility of the design team to meet the tough time to market deadlines. In the thorny landscape of system design, EDA tools that automate the design and implementation process of various IP blocks are more than desired; they are the foundation stones of productivity. One very important class of EDA tools is the generation of hardware descriptions for popular IP blocks. One very important IP block, required in a plethora of situations, is the magnitude comparator block. Here, we present an online tool that can generate custom HDL descriptions for various bitwidths of magnitude comparator IP blocks, using only elementary gates. The generated IP blocks are vendor neutral and leverage the capabilities of the design teams that require such descriptions. Our synthesized circuits on Xilinx Virtex 6 FPGA XC6VLX760, operate up to 351 Mhz.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132579746","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
On the use of hard faults to generate test sets 关于使用硬故障生成测试集
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801951
I. Voyiatzis, C. Efstathiou
{"title":"On the use of hard faults to generate test sets","authors":"I. Voyiatzis, C. Efstathiou","doi":"10.1145/2801948.2801951","DOIUrl":"https://doi.org/10.1145/2801948.2801951","url":null,"abstract":"In test set embedding Built-In Self-Test (BIST) schemes a pre-computed test set is embedded into the sequence generated by a hardware module. In this work we first apply a sequence of pseudorandom patterns and then try to embed patterns for the remaining faults (i.e. \"extremely hard\" faults) in the sequence generated by the hardware generator.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127391667","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 fast progressive local learning regression ensemble of generalized regression neural networks 广义回归神经网络的快速渐进局部学习回归集成
Proceedings of the 19th Panhellenic Conference on Informatics Pub Date : 2015-10-01 DOI: 10.1145/2801948.2801962
Y. Kokkinos, K. Margaritis
{"title":"A fast progressive local learning regression ensemble of generalized regression neural networks","authors":"Y. Kokkinos, K. Margaritis","doi":"10.1145/2801948.2801962","DOIUrl":"https://doi.org/10.1145/2801948.2801962","url":null,"abstract":"The Generalized Regression Neural Network (GRNN) is a memory-based supervised learning neural network that performs non linear regressions and output estimation. However, if the number of the hidden layer neurons grows large, the evaluation of an unknown sample has a substantial computational cost. Whereas the GRNN run time can be reduced by parallelism, the computational load can be decreased by neuron reduction that compresses pattern neurons into fewer kernels. While such global models have been studied for a long time, there is another solution; that of local learning algorithms which use neighbourhoods to learn local parameters and create on the fly a local model specifically designed for any particular testing point. For this purpose we create a Progressive Local Learning Ensemble of many local GRNN models. Optimizing the number of k nearest neighbor neurons the method reduces substantially the cost of training as well as of predicting an unknown sample.","PeriodicalId":305252,"journal":{"name":"Proceedings of the 19th Panhellenic Conference on Informatics","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354259","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
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学术官方微信