2018
Autores
Fortuna, P; Pereira, N; Butun, I;
Publicação
ICISSP: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS SECURITY AND PRIVACY
Abstract
Due to their universal accessibility, interactivity and scaling ease, Web applications relying on client-side code execution are currently the most common form of delivering applications and it is likely that they will continue to enter into less common realms such as IoT-based applications. We reason that modern Web applications should be able to exhibit advanced security protection mechanisms and review the research literature that points to useful partial solutions. Then, we propose a framework to support such characteristics and the features needed to implement them, providing a roadmap for a comprehensive solution to support Web application integrity.
2018
Autores
Costa, AF; Santos, MS; Soares, JP; Abreu, PH;
Publicação
Advances in Intelligent Data Analysis XVII - 17th International Symposium, IDA 2018, 's-Hertogenbosch, The Netherlands, October 24-26, 2018, Proceedings
Abstract
2018
Autores
Mention, AL; Pinto Ferreira, JJ; Torkkeli, M;
Publicação
Journal of Innovation Management
Abstract
2018
Autores
Mozetic, I; Torgo, L; Cerqueira, V; Smailovic, J;
Publicação
PLOS ONE
Abstract
Social media are becoming an increasingly important source of information about the public mood regarding issues such as elections, Brexit, stock market, etc. In this paper we focus on sentiment classification of Twitter data. Construction of sentiment classifiers is a standard text mining task, but here we address the question of how to properly evaluate them as there is no settled way to do so. Sentiment classes are ordered and unbalanced, and Twitter produces a stream of time-ordered data. The problem we address concerns the procedures used to obtain reliable estimates of performance measures, and whether the temporal ordering of the training and test data matters. We collected a large set of 1.5 million tweets in 13 European languages. We created 138 sentiment models and out-of-sample datasets, which are used as a gold standard for evaluations. The corresponding 138 in-sample data-sets are used to empirically compare six different estimation procedures: three variants of cross-validation, and three variants of sequential validation (where test set always follows the training set). We find no significant difference between the best cross-validation and sequential validation. However, we observe that all cross-validation variants tend to overestimate the performance, while the sequential methods tend to underestimate it. Standard cross-validation with random selection of examples is significantly worse than the blocked cross-validation, and should not be used to evaluate classifiers in time-ordered data scenarios.
2018
Autores
Mundim, LR; Andretta, M; Carravilla, MA; Oliveira, JF;
Publicação
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Abstract
Cutting raw-material into smaller parts is a fundamental phase of many production processes. These operations originate raw-material waste that can be minimised. These problems have a strong economic and ecological impact and their proper solving is essential to many sectors of the economy, such as the textile, footwear, automotive and shipbuilding industries, to mention only a few. Two-dimensional (2D) nesting problems, in particular, deal with the cutting of irregularly shaped pieces from a set of larger containers, so that either the waste is minimised or the value of the pieces actually cut from the containers is maximised. Despite the real-world practical relevance of these problems, very few approaches have been proposed capable of dealing with concrete characteristics that arise in practice. In this paper, we propose a new general heuristic (H4NP) for all 2D nesting problems with limited-size containers: the Placement problem, the Knapsack problem, the Cutting Stock problem, and the Bin Packing problem. Extensive computational experiments were run on a total of 1100 instances. H4NP obtained equal or better solutions for 73% of the instances for which there were previous results against which to compare, and new benchmarks are proposed.
2018
Autores
Almeida, EN; Campos, R; Ricardo, M;
Publicação
2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)
Abstract
Despite recent advances, always-on broadband Internet connectivity is still not available in Temporary Crowded Events (TCEs). To solve this problem, this paper envisions a novel concept named Traffic-Aware Multi-Tier Flying Network (TMFN). A TMFN consists of a mobile and physically reconfigurable network of Flying Mesh Access Points (FMAPs) and Gateways, which is able to dynamically reconfigure its topology according to the users' traffic demands - characterized by the users' positions and offered traffic. To implement this concept, a novel traffic-aware Network Planning (NetPlan) algorithm is proposed, which dynamically determines the FMAPs' coordinates and Wi-Fi cell ranges according to the users' traffic demands, in order to improve the TMFN's aggregate throughput, without compromising the overall coverage. Simulation results obtained in scenarios typically observed in TCEs demonstrate improved Quality of Service metrics, specifically the mean throughput, thus validating the proposed NetPlan algorithm.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.