Abstract
Electricity markets are complex and dynamic environments, mostly due to the large scale integration of renewable energy sources in the system. Negotiation in these markets is a significant challenge, especially when considering negotiations at the local level (e.g. between buildings and distributed energy resources). It is essential for a negotiator to he able to identify the negotiation profile of the players with whom he is negotiating. If a negotiator knows these profiles, it is possible to adapt the negotiation strategy and get better results in a negotiation. In order to identify and define such negotiation profiles, a clustering process is proposed in this paper. The clustering process is performed using the kml-k-means algorithm, in which several negotiation approaches are evaluated in order to identify and define players' negotiation profiles. A case study is presented, using as input data, information from proposals made during a set of negotiations. Results show that the proposed approach is able to identify players' negotiation profiles used in bilateral negotiations in electricity markets.

Abstract
Innovation is a vital process for any business to remain competitive in this age. This progress must be coherently and optimally managed, allowing for successful improvement and future growth. The Handbook of Research on Strategic Innovation Management for Improved Competitive Advantage provides emerging research on the use of information and knowledge to promote development in various business agencies. While covering topics such as design thinking, financial analysis, and policy planning, this publication explores the wide and complex relationships that constitute strategic innovation management principals and processes. This publication is an important resource for students, professors, researchers, managers, and entrepreneurs seeking current research on the methods and tools regarding information and knowledge management for business advancement.

Abstract
The bi-dimensional irregular strip packing is a difficult problem in the cutting and packing field. Its main feature, and central source of complexity, is the irregularity of the shape of the items. Consequently, mathematical solvers are only able to obtain optimal solutions for small instances and heuristics are often employed in the literature. In such algorithms, it is not possible to guarantee that the optimum solution is found. In such cases, a restricted version of the problem can be adopted in order to improve the performance. One possible restriction is the adoption of pairwise clustering, i.e., elimination of items by joining two pieces. In this work, an automatic pairwise clustering method is proposed for the dotted board model, which limits the placement of items to equally distributed discrete points. The clustered problems are then used as input to an irregular strip packing solver. The results obtained in this paper can be used as an initial guideline for the use of clustering in a discrete grid, which was beneficial in some of the tested cases.

Abstract
Objective: Serious Games is a field of research that has evolved substantially with valuable contributions to many application domains and areas. Patients often consider traditional rehabilitation approaches to be repetitive and boring, making it difficult for them to maintain their ongoing interest and assure the completion of the treatment program. Since the publication of our first taxonomy of Serious Games for Health Rehabilitation (SGHR), many studies have been published with game prototypes in this area. Based on literature review, our goal is to propose an updated taxonomy taking into account the works, updates, and innovations in game criteria that have been researched since our first publication in 2010. In addition, we aim to present the validation mechanism used for the proposed extended taxonomy. Materials and Methods: Based on a literature review in the area and on the analysis of the contributions made by other researchers, we propose an extended taxonomy for SGHR. For validating the taxonomy proposal, a questionnaire was designed to use on a survey among experts in the area. Results: An extended taxonomy for SGHR was proposed. As we have identified that, in general, and besides the mechanisms associated with the adoption of a given taxonomy, there were no reported validation mechanisms for the proposals, we designed a mechanism to validate our proposal. The mechanism uses a questionnaire addressed to a sample of researchers and professionals with experience and expertise in domains of knowledge interrelated with SGHR, such as Computer Graphics, Game Design, Interaction Design, Computer Programming, and Health Rehabilitation. Conclusion: The extended taxonomy proposal for health rehabilitation serious games provides the research community with a tool to fully characterize serious games. The mechanism designed for validating the taxonomy proposal is another contribution of this work.

Abstract
Content Based Image Retrieval (CBIR) is an important field of research targeting different applications. The one presented in this work results from an identified need for a wine anti-counterfeiting scheme based on photos of cork stoppers already proposed in previous work. A photo of each cork stopper is used to register a wine bottle during the bottling process. To verify the genuineness of the product a user captures a photo of the stopper; that photo is then compared with the entirety of the database and all the relevant information is retrieved to the user. This approach can be a very slow process, becoming more time consuming with each increase of the database. Aiming to solve this problem, a CBIR system for wine anti-counterfeiting purposes based on cork stopper photos is presented. The feature extraction is achieved using Oriented FAST and Rotated BRIEF (ORB), selecting the "best" keypoints (according to the Harris corner measure) per region. The regions are delimited by concentric circumferences calculated using the radius of the identified cork. The number of regions (N-R), along with the number of selected keypoints (N-p) per region, define the number of ORB descriptors needed for indexing the image in the database. To measure the similarity between the query image and the database a score is calculated based on N-R and N-P Finally, the best N images according to the calculated score are retrieved. To evaluate the proposed approach 2 datasets (natural cork and agglomerate cork dataset) were created, totaling 1500 photos, and 4 different smartphone rear cameras were used. The recall results range from 75.0% to 99.5% in the natural dataset and from 86.0% to 99.0% in the agglomerate dataset. The average time for the retrieval process is about 9.74ms in a database populated with 100 photos. Critical analysis on the recall rate and its time tradeoff is also discussed. The results show that the proposed CBIR is adequate for its application - wine anti- counterfeiting.

Abstract
This paper describes the UX-1 underwater mine exploration robotic system under development in the context of the UNEXMIN project. UNEXMIN is an international innovation action funded under the EU H2020 program, aiming to develop new technologies and services allowing the exploration of flooded underground mines. The system is comprised by the UX-1 robot prototype, launch and recovery system, command and control subsystem and a data management and post-processing computational infrastructure. The UX-1 robot is a small spherical robot equipped with a multibeam sonar, five digital cameras and rotating laser line structured light systems. It is capable of obtaining an accurate point cloud of the surrounding environment along with high resolution imagery. A set of mineralogy, water parameters and geophysical sensors was also developed in order to obtain a more comprehensive mine model. These comprise a multi-spectral camera, electro-conductivity, pH, magnetic field sensors, a subbottom sonar, total natural gamma-ray detector, UV-light for fluorescent observation and a water sampling unit. The design of the system is presented along with the robot design. Some preliminary results are also presented and discussed