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

2012

Business impact assessment for autonomic network management identifying business impact indicators from use case requirements

Autores
Spek, S; Gonçalves, V; Delaere, S;

Publicação
UBICOMM 2012 - 6th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies

Abstract
In this paper, a methodology is presented to identify business impact indicators from the use case requirements in an early phase of the development stage. It is based on the Quality Function Deployment method and the business model design framework. This methodology is applied to the design for a unified management framework to facilitate autonomics in complex, ubiquitous and large-scale networks. The analysis concludes that this innovation will be particularly disruptive in the functional architecture and value proposition aspects of the business model.

2012

Strategic optimization in R&D investment

Autores
Ferreira, M; Figueiredo, IP; Oliveira, BMPM; Pinto, AA;

Publicação
OPTIMIZATION

Abstract
We use d'Aspremont and Jacquemin's strategic optimal R&D investment in a duopoly Cournot competition model to construct myopic optimal discrete and continuous R&D dynamics. We show that for some high initial production costs, the success or failure of a firm is very sensitive to small variations in its initial R&D investment strategies.

2012

Mathematical Literacy as a Condition for Sustainable Development

Autores
Barbosa, LuisSoares; Martinho, MariaHelena;

Publicação
Information Technology and Open Source: Applications for Education, Innovation, and Sustainability - SEFM 2012 Satellite Events, InSuEdu, MoKMaDS, and OpenCert, Thessaloniki, Greece, October 1-2, 2012, Revised Selected Papers

Abstract
Argumentation and proof are two main ingredients in strategies for developing mathematical skills and structured reasoning. This paper reports on a research project aimed at 'refactoring' school Mathematics in other to achieve a higher degree of mathematical literacy. In a sense this builds on a number of 'lessons' learnt from the practice of Computing Science. We further argue that mathematical fluency, broadly understood as the ability to reason in terms of abstract models and the effective use of logical arguments and mathematical calculation, became a condition for democratic citizenship and sustainable development. © Springer-Verlag Berlin Heidelberg 2014.

2012

Computing Semantic Relatedness using DBPedia

Autores
Leal, JP; Rodrigues, V; Queirós, R;

Publicação
1st Symposium on Languages, Applications and Technologies, SLATE 2012, Braga, Portugal, June 21-22, 2012

Abstract
Extracting the semantic relatedness of terms is an important topic in several areas, including data mining, information retrieval and web recommendation. This paper presents an approach for computing the semantic relatedness of terms using the knowledge base of DBpedia - a community effort to extract structured information from Wikipedia. Several approaches to extract semantic relatedness from Wikipedia using bag-of-words vector models are already available in the literature. The research presented in this paper explores a novel approach using paths on an ontological graph extracted from DBpedia. It is based on an algorithm for finding and weighting a collection of paths connecting concept nodes. This algorithm was implemented on a tool called Shakti that extract relevant ontological data for a given domain from DBpedia using its SPARQL endpoint. To validate the proposed approach Shakti was used to recommend web pages on a Portuguese social site related to alternative music and the results of that experiment are reported in this paper.

2012

HCAC: Semi-supervised hierarchical clustering using confidence-based active learning

Autores
Nogueira, BM; Jorge, AM; Rezende, SO;

Publicação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
Despite their importance, hierarchical clustering has been little explored for semi-supervised algorithms. In this paper, we address the problem of semi-supervised hierarchical clustering by using an active learning solution with cluster-level constraints. This active learning approach is based on a new concept of merge confidence in agglomerative clustering. When there is low confidence in a cluster merge the user is queried and provides a cluster-level constraint. The proposed method is compared with an unsupervised algorithm (average-link) and two state-of-the-art semi-supervised algorithms (pairwise constraints and Constrained Complete-Link). Results show that our algorithm tends to be better than the two semi-supervised algorithms and can achieve a significant improvement when compared to the unsupervised algorithm. Our approach is particularly useful when the number of clusters is high which is the case in many real problems. © 2012 Springer-Verlag Berlin Heidelberg.

2012

Towards Halos Networks ubiquitous networking and computing at the edge

Autores
Manzalini, A; Crespi, N; Goncalves, V; Minerva, R;

Publicação
2012 16th International Conference on Intelligence in Next Generation Networks, ICIN 2012

Abstract
This paper presents Halos Networks as an architectural paradigm for developing ubiquitous networking and computing services at the edge of the networks A Halos Network is like a wireless network spontaneously emerging through the interactions of distributed resources embedding wireless communication capabilities. Halos Networks are capable of delivering services and data virally through multiple devices, machines and objects interconnected with one other. This paper discusses business roles for Stakeholders in Halos Networks scenarios, specifically concluding with some remarks about the Operators' role. © 2012 IEEE.

  • 3202
  • 4362