Abstract
This workshop intends to establish the basis of a roadmap addressing engineering challenges and emerging themes in HCI. Novel forms of interaction and new application domains involve aspects that are currently not sufficiently covered by existing methods and tools. The workshop will serve as a venue to bring together researchers and practitioners interested the Engineering of Human- Computer Interaction and in contributing to the definition of a roadmap for the field. The intention is to continue work on the roadmap in follow-up workshops as well as in the IFIP Working Group on User Interface Engineering. Copyright © 2014 ACM 978-1-4503-2725-1/14/06.

Abstract
Extended Manufacturing Environments (EMEs) are nowadays growing due to the increase on Distributed and Virtual Enterprises, which led to an emergent need to apply scheduling approaches accordingly. This can be achieved in several different ways, namely by putting forward new approaches or by trying to adapt existing ones. In this paper the adaptation of some existing scheduling methods is proposed for solving a two stage manufacturing scheduling problem, and an illustrative example is presented. Several approaches were analyses, namely through the use of the ANOVA and the Post Hoc Scheffe's test, that demonstrated the superior performance of one of the proposed methods.

Abstract
Despite being a recent phenomenon and being in constant evolution, e-commerce (EC) is already embedded in current society. However, difficulties in establishing a universally accepted definition have resulted in a multiplicity of meanings that sometimes merge with the e-business (EB) concept. This article presents a brief historical and conceptual evolution of EC and some of its most significant aspects. © 2018, IGI Global.

Abstract
In this paper a constructive heuristic for solving the staff scheduling problem of a glass manufacture unit is proposed. Based on simple calculations and algorithms, the developed procedure assigns working shifts and days-off to teams of employees, ensuring the satisfaction of a mandatory sequence of working shifts and the balance of the workload between employees. The computational times for the experiments with the case study company, with three eight-hour working shifts and five teams of employees, fell consistently below 5 seconds for a set of different planning periods. Results are compared with the ones achieved with an optimization model (MIP), demonstrating the good performance of the heuristic, also in terms of the quality of the achieved solutions. The heuristic rarely fails to produce a feasible solution and whenever the solution is feasible then it is also optimal. When tackling problems with a large number of teams, the heuristic maintains the good performance while the MIP model is not able to find any solution within 16 hours of running time. Although it was designed for a particular problem of the glass industry, tests show that the heuristic is flexible enough to be applied to problems with different features, from other activity sectors, encouraging further extensions of this work.

Abstract
Current manufacturing scheduling has still difficulties to deal with real-world situations and, hence, human intervention is required to maintain real-time adaptation and optimization, to efficiently adapt to the inherent complex system dynamics. In this paper the prototype of an Adaptive Decision Support System for Interactive Scheduling with MetaCognition and User Modeling Experience (ADSyS) is proposed. A preliminary usability evaluation was streamlined to collect user's opinion about the system performance and interaction model.

Abstract
A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All sub-channels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.