2016
Autores
Costa, LA; Correa, MBR; Vitorino, MA; dos Santos, GG; Fernandes, DA;
Publicação
2016 IEEE Applied Power Electronics Conference and Exposition (APEC)
Abstract
2016
Autores
Marques, CP; Goncalves, R;
Publicação
2016 11TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI)
Abstract
The present study investigated how vivid, i.e. sensorially rich platforms influence the urge to buy impulsively in e-commerce environments. A stimulus - organism - response model was assessed in an experiment involving two groups, one experiencing a vivid platform and the other a more informational one. The response was posited to be mediated by the affect elicited during the experience. The results show that the urge to buy was not prevalent, but it was significantly higher in the group exposed to the vivid site. The variance of urge to buy was largely accounted buy the variance of positive arousal (delight). Negative affect, as well as low arousal positive affect (relax) have small negative effects on the urge. These results confirm our expectation that a simple distinction between negative and positive affect is insufficient to predict the urge, since the level of arousal also plays a fundamental role to trigger the urge.
2016
Autores
Accinelli, E; Ordaz, E; Plata, L; Pinto, A;
Publicação
J Glob Econ - Journal of Global Economics
Abstract
2016
Autores
Peres, RS; Parreira Rocha, M; Rocha, AD; Barbosa, J; Leitao, P; Barata, J;
Publicação
PROCEEDINGS OF THE IECON 2016 - 42ND ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY
Abstract
With the emergence of the Industry 4.0 concept, or the fourth industrial revolution, the industry is bearing witness to the appearance of more and more complex systems, often requiring the integration of various new heterogeneous, modular and intelligent elements with pre-existing legacy devices. This challenge of interoperability is one of the main concerns taken into account when designing such systems-of-systems, commonly requiring the use of standard interfaces to ensure this seamless integration. To aid in tackling this challenge, a common format for data exchange should be adopted. Thus, a study to select the foundations for the development of such a format is hereby presented, taking into account the specific needs of four different use cases representing varied key European industry sectors.
2016
Autores
Dalmazo, BL; Vilela, JP; Curado, M;
Publicação
INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT
Abstract
Network traffic prediction is a fundamental tool to harness several management tasks, such as monitoring and managing network traffic. Online traffic prediction is usually performed based on large sets of historical data used in training algorithms, for example, to determine the size of static windows to bound the amount of traffic under consideration. However, using large sets of historical data may not be suitable in highly volatile environments, such as cloud computing, where the coupling between time series observations decreases rapidly with time. To fill this gap, this work presents a dynamic window size algorithm for traffic prediction that contains a methodology to optimize a threshold parameter alpha that affects both the prediction and computational cost of our scheme. The alpha parameter defines the minimum data traffic variability needed to justify dynamic window size changes. Thus, with the optimization of this parameter, the number of operations of the dynamic window size algorithm decreases significantly. We evaluate the alpha estimation methodology against several prediction models by assessing the normalized mean square error and mean absolute percent error of predicted values over observed values from two real cloud computing datasets, collected by monitoring the utilization of Dropbox, and a data center dataset including traffic from several common cloud computing services. Copyright (C) 2016 John Wiley & Sons, Ltd.
2016
Autores
Pereira, T; Veloso, M; Moreira, A;
Publicação
ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
Abstract
In this paper we introduce the problem of planning for perception of a target position. Given a sensing target, the robot has to move to a goal position from where the target can be perceived. Our algorithm minimizes the overall path cost as a function of both motion and perception costs, given an initial robot position and a sensing target. We contribute a heuristic search method, PA*, that efficiently searches for an optimal path. We prove the proposed heuristic is admissible, and introduce a new goal state stopping condition.
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.