Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

2014

A Hybrid Framework for Supporting Scheduling in Extended Manufacturing Environments

Autores
Santos, AS; Madureira, AM; Varela, MLR; Putnik, GD; Abraham, A;

Publicação
2014 14TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS (HIS)

Abstract
In the current marketplace, enterprises face enormous competitive pressures. Global competition for customers that demand customized products with shorter due dates and the advancement in information technologies, marked the introduction of the Extended Enterprise. In these EMEs (Extended Manufacturing Environments), lean, virtual, networked and distributed enterprises, form MO (Meta-Organizations), which collaborate to respond to the dynamic marketplace. MO members share resources, customers and information. In this paper we present a hybrid framework based on a DKBS (Distributed Knowledge Base System), which includes information about scheduling methods for collaborative enterprises sharing their problems. A core component of this system includes an inference engine as well as two indexes, to help in the classification of the usefulness of the information about the problems and solving methods. A more structured approach for expanding the MO concept is presented, with the HO (Hyper-Organization). The manner in which MO-DSS can communicate, cooperate and share information, in the context of the HO is also detailed.

2014

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices

Autores
Silva, RMA; Silva, DM; Resende, MGC; Mateus, GR; Goncalves, JF; Festa, P;

Publicação
OPTIMIZATION LETTERS

Abstract
This paper presents a newedge-swap heuristic for generating spanning trees with a minimum number of branch vertices, i.e. vertices of degree greater than two. This problem was introduced in Gargano et al. (Lect Notes Comput Sci 2380:355-365, 2002) and has been called the minimum branch vertices problem by Cerulli et al. (Comput Optim Appl 42:353-370, 2009). The heuristic starts with a random spanning tree and iteratively reduces the number of branch vertices by swapping tree edges with edges not currently in the tree. It can be easily implemented as a multi-start heuristic. We report on extensive computational experiments comparing single-start and multi-start variants on our heuristic with other heuristics previously proposed in the literature.

2014

Nonlinearities in the EU sovereign debt crisis

Autores
Ferreiraa, NB; Oliveira, MM;

Publicação
INTERNATIONAL WORK-CONFERENCE ON TIME SERIES (ITISE 2014)

Abstract
Sights of sovereign debt crisis spread among financial players started in late 2009 as a result of the rising private and government debt levels worldwide. In 2010 news developments concerning Spain and Italy lead European nations to implement several financial support measures such as the European Financial Stability Facility. In an established crisis context, it was searched for evidence of nonlinearities, structural breaks and cointegration between interest rates and stock market prices in order to evaluate the impact effect analysis of the European markets contamination by sovereign debt. Four European markets under stress were examined using the United States of America as benchmark. It was found evidence in the crisis regime especially for Portugal, obtaining the greatest nonlinear threshold adjustment between interest rates and stock market returns. Moreover, significant structural breaks were found at the end of 2010 and the null hypothesis of no cointegration was consistently rejected.

2014

Grounding language in perception for scene conceptualization in autonomous robots

Autores
Dubba, KSR; De Oliveira, MR; Lim, GH; Kasaei, H; Lopes, LS; Tome, A; Cohn, AG;

Publicação
AAAI Spring Symposium - Technical Report

Abstract
In order to behave autonomously, it is desirable for robots to have the ability to use human supervision and learn from different input sources (perception, gestures, verbal and textual descriptions etc). In many machine learning tasks, the supervision is directed specifically towards machines and hence is straight forward clearly annotated examples. But this is not always very practical and recently it was found that the most preferred interface to robots is natural language. Also the supervision might only be available in a rather indirect form, which may be vague and incomplete. This is frequently the case when humans teach other humans since they may assume a particular context and existing world knowledge. We explore this idea here in the setting of conceptualizing objects and scene layouts. Initially the robot undergoes training from a human in recognizing some objects in the world and armed with this acquired knowledge it sets out in the world to explore and learn more higher level concepts like static scene layouts and environment activities. Here it has to exploit its learned knowledge and ground language into perception to use inputs from different sources that might have overlapping as well as novel information. When exploring, we assume that the robot is given visual input, without explicit type labels for objects, and also that it has access to more or less generic linguistic descriptions of scene layout. Thus our task here is to learn the spatial structure of a scene layout and simultaneously visual object models it was not trained on. In this paper, we present a cognitive architecture and learning framework for robot learning through natural human supervision and using multiple input sources by grounding language in perception. Copyright

2014

Energy-aware routing for biomedical wireless sensor networks

Autores
Abreu, C; Ricardo, M; Mendes, PM;

Publicação
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS

Abstract
Available wireless sensor networks targeting the domain of healthcare enables the development of new applications and services in the context of E-Health. Such networks play an important role in several scenarios of patient monitoring, particularly those where data collection is vital for diagnosis and/or research purposes. However, despite emerging solutions, wearable sensors still depend on users' acceptance. One proposed solution to improve wearability relies on the use of smaller sensing nodes, requiring more energy-efficient networks, due to smaller room available for energy sources. In such context, smaller wireless sensor network nodes are required to work long time periods without human intervention and, at the same time, to provide appropriate levels of reliability and quality of service. Satisfaction of these two goals depends on several key factors, such as the routing protocol, the network topology, and energy efficiency. This paper offers a solution to increase the network lifetime based on a new Energy-Aware Objective Function used to design a Routing Protocol for Low-Power and Lossy Networks. The proposed Objective Function uses the Expected Transmission Count Metric and the Remaining Energy on each sensor node to compute the best paths to route data packets across the network. When compared with state of the art solutions, the proposed method increases the network lifetime by 21% and reduces the peaks of energy consumption by 12%. In this way, wireless sensor network nodes wearability can be improved, making them smaller and lighter, while maintaining the required performance.

2014

Optimization models for an EV aggregator selling secondary reserve in the electricity market

Autores
Bessa, RJ; Matos, MA;

Publicação
ELECTRIC POWER SYSTEMS RESEARCH

Abstract
Power system regulators and operators are creating conditions for encouraging the participation of the demand-side into reserve markets. The electric vehicle (EV), when aggregated by a market agent, holds sufficient flexibility for offering reserve bids. Nevertheless, due to the stochastic nature of the drivers' behavior and market variables, forecasting and optimization algorithms are necessary for supporting an EV aggregator participating in the electricity market. This paper describes a new day-ahead optimization model between energy and secondary reserve bids and an operational management algorithm that coordinates EV charging in order to minimize differences between contracted and realized values. The use of forecasts for EV and market prices is included, as well as a market settlement scheme that includes a penalty term for reserve shortage. The optimization framework is evaluated in a test case constructed with synthetic time series for EV and market data from the Iberian electricity market.

  • 2808
  • 4387