32 resultados para Technologies of the Information and the Communication
em Cambridge University Engineering Department Publications Database
Resumo:
With the rapid growth of information and communication technology (ICT) in Korea, there was a need to improve the quality of official ICT statistics. In order to do this, various factors had to be considered, such as the quality of surveying, processing, and output as well as the reputation of the statistical agency. We used PLS estimation to determine how these factors might influence customer satisfaction. Furthermore, through a comparison of associated satisfaction indices, we provided feedback to the responsible statistics agency. It appears that our model can be used as a tool for improving the quality of official ICT statistics. © 2008 Elsevier B.V. All rights reserved.
Resumo:
Strategic innovation has been shown to provide significant value for organisations whilst at the same time challenging traditional ways of thinking and working. There is less known, however, as to how organisations collaborate in innovation networks to achieve strategic innovation. In this paper we explore how innovation networks are orchestrated in developing a strategic innovation initiative around the Internet of Things. We show how a hub actor brings together a diverse group of actors to initially create and subsequently orchestrate the strategic innovation network through the employ of three dialogical strategies, namely persuasive projection, reflective development, and definitional control. Further, we illuminate how different types of legitimacy are established through these various dialogical strategies in orchestrating strategic innovation networks.
Resumo:
Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.