{"title":"Building the Innovative and Entrepreneurial University","authors":"P. Stanchev","doi":"10.1145/3274005.3274007","DOIUrl":"https://doi.org/10.1145/3274005.3274007","url":null,"abstract":"How can entrepreneurship be taught? The positive feedback loop at the Massachusetts Institute of Technology for spirit & skills which creates the successful entrepreneurial ecosystem. Innovation and entrepreneurship organization in higher education: KEEN a network of thousands of faculties, working to unleash undergraduate students so that they can create personal, economic, and societal value through the entrepreneurial mindset; DECA - an international association of high school students and teachers of marketing, management and entrepreneurship in business, finance, hospitality and marketing sales and services. Innovation and entrepreneurship at Kettering University: The T-space to transforming their mindset to \"think, tinker, and thrive\"; facture two, built on the idea that learning, sharing, and creating are empowering and transformative forces which can open doors and revolutions both perceptions and realities; innovation and entrepreneurship minor at the school of management; Kettering Entrepreneurship society. How can entrepreneurship be including in the curriculum? Teaching the Entrepreneurial Mindset in Computer Science classes.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125408829","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}
{"title":"Neighborhood-based Strategies for Widening of the Greedy Algorithm of the Set Cover Problem","authors":"Violeta N. Ivanova-Rohling","doi":"10.1145/3274005.3274036","DOIUrl":"https://doi.org/10.1145/3274005.3274036","url":null,"abstract":"We live in the age of ever-increasing parallel computing resources. For a decade there has been intense research into parallel data mining algorithms. Most of this research is focused on improving the running time of existing algorithms. In contrast our focus is the improvement of the solution quality, or model accuracy. We are looking for \"smart\" strategies to invest parallel compute resources in order to achieve a better exploration of the search space by exploring several solutions in parallel, referred to as Widening. In this paper, we demonstrate the effect of neighborhood-based Widening with different types of neighborhoods for the greedy algorithm of the set cover problem.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801576","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}
{"title":"Virtual Intelligent Personal Assistant for Bat Researchers","authors":"A. Ivanov, D. Orozova","doi":"10.1145/3274005.3274022","DOIUrl":"https://doi.org/10.1145/3274005.3274022","url":null,"abstract":"The paper presents a Virtual Intelligent Personal Assistant (VIPA) designated to facilitate the field work of the bat researchers. It is a mobile software based on BDI Architecture developed using freely available Open Source technologies. Its initial version includes some basic functionalities such as gathering of fully customizable field data, processing of this data, analysis and reports. VIPAs are software agents designated to assist users in performing specific tasks. They are able to communicate, cooperate, discuss, and guide people. One major advantage of the VIPAs is that they collaborate with the user in different ways, and in virtually unlimited tasks and applications, by hiding the complexity of difficult tasks, performing them on behalf of the user, and teaching the user to monitor events and procedures.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955306","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}
{"title":"Communication-less Strategies for the Widening of Rule Induction","authors":"Violeta N. Ivanova-Rohling","doi":"10.1145/3274005.3274033","DOIUrl":"https://doi.org/10.1145/3274005.3274033","url":null,"abstract":"In the age of Big Data and with the ever increasing availability of parallel compute resources there has been strong focus on research in parallel algorithms for data mining aiming to improve the efficiency of existing algorithms. We take a different view, instead of the usual focus on speed-up of the algorithm, we focus on investing parallel compute resources to improve the accuracy of models obtained by existing heuristics, without increasing the overall running time. We look for strategies to invest parallel compute resources in a smart way in order to improve the search space exploration, without the necessity of communication between the parallel workers. We demonstrate their effectiveness on the rule induction algorithm CN2.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200193","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}
{"title":"Heart Rate Variability Generating Based on Matematical Tools","authors":"G. Georgieva-Tsaneva","doi":"10.1145/3274005.3274035","DOIUrl":"https://doi.org/10.1145/3274005.3274035","url":null,"abstract":"The article presents an algorithm for generating sysnthetic Heart Rate Variability (HRV) data using mathematical tools. The generated data includes the low frequency Mayer wave, the effect of Respiratory Sinus Arrhythmia on the high frequency spectrum and the influence of thermoregulation, physical activity, etc. factors in the very low frequency range. The algorithm uses a wavelet transformation to convert the generated data into the time domain. The generated HRV series has been investigated in the time and frequency domains. The results show that the generated HRV data corresponds to a healthy individual. The algorithm can be used to evaluate the diagnostic capabilities of real HRV sequences derived from patient electrocardiographic data.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758574","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}
{"title":"Risks management in software development capstone projects","authors":"Pekka Mäkiaho, T. Poranen","doi":"10.1145/3274005.3274024","DOIUrl":"https://doi.org/10.1145/3274005.3274024","url":null,"abstract":"Project risk management is one of the most important knowledge areas that a project manager should know well. During university level studies, computer science students participate in different kind of capstone projects where they can learn risk management in practice. In this paper, we study risk monitoring in student's software development capstone projects. We analyze risk identification, foreseen and unforeseen risks, mitigation, and reactions after a risk is realized. Most common realized risks were related to time management of the project. Main mitigation techniques were good documentation, version control usage and open communication. Teams reacted to risks by rescheduling or speeding up their work","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123339759","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}
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
{"title":"A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups","authors":"Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis","doi":"10.1145/3274005.3274028","DOIUrl":"https://doi.org/10.1145/3274005.3274028","url":null,"abstract":"In this paper, we propose a graph-based algorithmic technique for malware detection, utilizing the System-call Dependency Graphs (ScDG) obtained through taint analysis traces. We leverage the grouping of system-calls into system-call groups with respect to their functionality to merge disjoint vertices of ScDG graphs, transforming them to Group Relation Graphs (GrG); note that, the GrG graphs represent malware's behavior being hence more resilient to probable mutations of its structure. More precisely, we extend the use of GrG graphs by mapping their vertices on the plane utilizing the degrees and the vertex-weights of a specific underlying graph of the GrG graph as to compute domination relations. Furthermore, we investigate how the activity of each system-call group could be utilized in order to distinguish graph-representations of malware and benign software. The domination relations among the vertices of GrG graphs result to a new graph representation that we call Coverage Graph of the GrG graph. Finally, we evaluate the potentials of our detection model using graph similarity between Coverage Graphs of known malicious and benign software samples of various types.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"103 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133205252","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}
V. Cantoni, Tomas Lacovara, M. Porta, Haochen Wang
{"title":"A Study on Gaze-Controlled PIN Input with Biometric Data Analysis","authors":"V. Cantoni, Tomas Lacovara, M. Porta, Haochen Wang","doi":"10.1145/3274005.3274029","DOIUrl":"https://doi.org/10.1145/3274005.3274029","url":null,"abstract":"Common methods for checking a user's identity (e.g., passwords) do not consider personal elements characterizing a subject. In this paper, we present a study on the exploitation of eye information for biometric purposes. Data is acquired when the user enters a PIN (Personal Identification Number) through the gaze, by means of an on-screen virtual numeric keypad. Both identification (i.e., the recognition of a subject in a group) and verification (i.e., the confirmation of an individual's claimed identity) are considered. Using machine learning algorithms, we performed two kinds of analysis, one for the entire PIN sequence and one for each key (i.e., digit) in the series. Overall, the achieved results can be considered satisfying in the context of \"soft biometrics\", which does not require very high success rates and is meant to be used along with other identification or verification techniques-in our case, the PIN itself-as an additional security level.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123839748","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}
{"title":"Cross-lingual and multilingual ontology mapping - survey","authors":"T. Ivanova","doi":"10.1145/3274005.3274034","DOIUrl":"https://doi.org/10.1145/3274005.3274034","url":null,"abstract":"As the Web is multilingual and more and more web-based applications use ontologies in the latest years, mapping multilingual ontologies have become more and more important for the interoperability of systems in specific domains, such as e-commerce, life science, social web, etc. There is much research in the ontology-mapping field, but only a few research papers are related to the specifics of ontology mapping in multilingual environment. The main goal of this paper is to analyze resent results and show specifics of ontology mapping in multilingual environment. We classify multilingual ontology mapping approaches and propose some guidelines for ontology development and mapping to make easier information integration in multilingual environment.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122415311","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}
Marin Fotache, Valerica Greavu-Serban, Ionut Hrubaru, Alexandru Tica
{"title":"Big Data Technologies on Commodity Workstations: A Basic Setup for Apache Impala","authors":"Marin Fotache, Valerica Greavu-Serban, Ionut Hrubaru, Alexandru Tica","doi":"10.1145/3274005.3274021","DOIUrl":"https://doi.org/10.1145/3274005.3274021","url":null,"abstract":"Big Data technologies brought the idea of parallel processing on cheaper commodity servers. When dealing with huge amount of data, instead of migrating to more performant and costly hardware platforms, or buying resources in cloud, it is more affordable to add a number of cheaper servers as nodes for data processing and/or storage. NoSQL data stores, Hadoop ecosystems, NewSQL platforms have proved viable for Big Data storage and processing. In this paper we were concerned with setting up a platform for big data processing using commodity workstations. Many small and medium sized companies have limited resources and their workstations remain unused for more than 12 hours a day. Here Beowulf Cluster Computing could prove useful. Apache Impala was installed as part of a Hadoop distribution on a 9-node cluster. Three TPC-H database schema were loaded for the scale factors of 1, 2 and 10GB. A series of 100 SQL queries were randomly generated and executed for each scale factor. Results were collected and analyzed for determining if the cluster can provide a decent level of data processing performance.","PeriodicalId":152033,"journal":{"name":"Proceedings of the 19th International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129299639","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}