MAPEAMENTO E CARACTERIZAÇÃO DE FERRAMENTAS DE TECNOLOGIA DA INFORMAÇÃO NA CADEIA DE SUPRIMENTOS

Nos últimos tempos a utilização da Tecnologia da Informação tem-se tornado uma regra, principalmente em aplicações como na Gestão da Cadeia de Suprimentos, onde a informação passou a fazer parte do elo entre as empresas que integram esta Cadeia. A combinação de diferentes tecnologias tornou isso possível, pois empresas utilizam a Tecnologia da Informação de maneira diversificada, visando tirar melhor proveito dessa tecnologia. O presente Trabalho tem como objetivo mapear e caracterizar as diferentes Tecnologias da Informação utilizadas na Gestão da Cadeia de Suprimentos e determinar os principais fatores que as levaram a utilizar esta tecnologia. Identificou-se as principais Tecnologias da Informação normalmente encontradas na Gestão da Cadeia de Suprimentos, bem como um modelo teórico foi construído. A partir do modelo teórico desenvolveu-se um instrumento de pesquisa do tipo survey.. Utilizou-se também a prova Q de Cochran para avaliar se há diferenças na utilização da tecnologia da informação entre os diferentes tipos de empresas e apresentar os fatores que levaram as empresas a utilizarem a Tecnologia da Informação.

COMUNICAÇAO E TECNOLOGIA NA CADEIA DA SOJA EM MT

Esta tese trata do sistema de informação tecnologica (SIT) da cadeia produtiva da soja em Mato Grosso. O objetivo foi identificar, modelar, descrever e analisar o SIT, apresentando fontes, canais, fluxos, mediadores e usuários de informação sobre tecnologias agropecuarias, limitações, oprotunidades e estrategias para aumentar o desempenho do sistema. Os procedimentos metodologicos na pesquisa de campo incluem exames de documentos e outros dados secundarios, realização de grupo focal e, particularmente, entrevista com 44 conhecedores da cadeia. O estudo mostra que, a partir das transformações na agricultura, o modelo tradicional de transferencia de tecnologia baseada na articulação pesquisa/extensao/agricultor foi substituido por sistemas com multiplas conexoes e atores. Identifica-se que a informação é insumo fundamental e esta baseada na perspectiva de negocios; a principal maneira de transmissao de informações sao os meios informais; o agricultor possui fontes de informação em excesso com experiencias, pressupostos e interesses diferentes. Demonstra-se que a configuração atual do SIT da cadeia produtiva de soja em MT se ressente da ausencia do setor publico e apresenta -se estrategias para que o fluxo de informacao tecnologica aumente a competitividade da cadeia.(AU)

Analysing time series structure with hidden Markov models

This paper consides the problem of extracting the relationships between two time series in a non-linear non-stationary environment with Hidden Markov Models (HMMs). We describe an algorithm which is capable of identifying associations between variables. The method is applied both to synthetic data and real data. We show that HMMs are capable of modelling the oil drilling process and that they outperform existing methods.

Time delay estimation with hidden Markov models

Most traditional methods for extracting the relationships between two time series are based on cross-correlation. In a non-linear non-stationary environment, these techniques are not sufficient. We show in this paper how to use hidden Markov models to identify the lag (or delay) between different variables for such data. Adopting an information-theoretic approach, we develop a procedure for training HMMs to maximise the mutual information (MMI) between delayed time series. The method is used to model the oil drilling process. We show that cross-correlation gives no information and that the MMI approach outperforms maximum likelihood.

Volatility changes caused by the trading system:a Markov switching application

An expanding literature exists to suggest that the trading mechanism can influence the volatility of security returns. This study adds to this literature by examining the impact that the introduction of SETS, on the London Stock Exchange, had on the volatility of security returns. Using a Markov switching regime change model security volatility is categorized as being in a regime of either high or low volatility. It is shown that prior to the introduction of SETS securities tended to be in a low volatility regime. At the time SETS was introduced securities moved to a high volatility regime. This suggests that volatility increased when SETS was introduced.

A comparison of variational and Markov chain Monte Carlo methods for inference in partially observed stochastic dynamic systems

In recent work we have developed a novel variational inference method for partially observed systems governed by stochastic differential equations. In this paper we provide a comparison of the Variational Gaussian Process Smoother with an exact solution computed using a Hybrid Monte Carlo approach to path sampling, applied to a stochastic double well potential model. It is demonstrated that the variational smoother provides us a very accurate estimate of mean path while conditional variance is slightly underestimated. We conclude with some remarks as to the advantages and disadvantages of the variational smoother. © 2008 Springer Science + Business Media LLC.

Bayesian online algorithms for learning in discrete Hidden Markov Models

We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.

Variational Markov Chain Monte Carlo for Bayesian smoothing of non-linear niffusions

In this paper we develop set of novel Markov chain Monte Carlo algorithms for Bayesian smoothing of partially observed non-linear diffusion processes. The sampling algorithms developed herein use a deterministic approximation to the posterior distribution over paths as the proposal distribution for a mixture of an independence and a random walk sampler. The approximating distribution is sampled by simulating an optimized time-dependent linear diffusion process derived from the recently developed variational Gaussian process approximation method. Flexible blocking strategies are introduced to further improve mixing, and thus the efficiency, of the sampling algorithms. The algorithms are tested on two diffusion processes: one with double-well potential drift and another with SINE drift. The new algorithm's accuracy and efficiency is compared with state-of-the-art hybrid Monte Carlo based path sampling. It is shown that in practical, finite sample, applications the algorithm is accurate except in the presence of large observation errors and low observation densities, which lead to a multi-modal structure in the posterior distribution over paths. More importantly, the variational approximation assisted sampling algorithm outperforms hybrid Monte Carlo in terms of computational efficiency, except when the diffusion process is densely observed with small errors in which case both algorithms are equally efficient.

Identifying and correcting non-Markov states in peptide conformational dynamics

Conformational transitions in proteins define their biological activity and can be investigated in detail using the Markov state model. The fundamental assumption on the transitions between the states, their Markov property, is critical in this framework. We test this assumption by analyzing the transitions obtained directly from the dynamics of a molecular dynamics simulated peptide valine-proline-alanine-leucine and states defined phenomenologically using clustering in dihedral space. We find that the transitions are Markovian at the time scale of ˜ 50 ps and longer. However, at the time scale of 30–40 ps the dynamics loses its Markov property. Our methodology reveals the mechanism that leads to non-Markov behavior. It also provides a way of regrouping the conformations into new states that now possess the required Markov property of their dynamics.

Modelling data and voice traffic over IP networks using continuous-time Markov models

Common approaches to IP-traffic modelling have featured the use of stochastic models, based on the Markov property, which can be classified into black box and white box models based on the approach used for modelling traffic. White box models, are simple to understand, transparent and have a physical meaning attributed to each of the associated parameters. To exploit this key advantage, this thesis explores the use of simple classic continuous-time Markov models based on a white box approach, to model, not only the network traffic statistics but also the source behaviour with respect to the network and application. The thesis is divided into two parts: The first part focuses on the use of simple Markov and Semi-Markov traffic models, starting from the simplest two-state model moving upwards to n-state models with Poisson and non-Poisson statistics. The thesis then introduces the convenient to use, mathematically derived, Gaussian Markov models which are used to model the measured network IP traffic statistics. As one of the most significant contributions, the thesis establishes the significance of the second-order density statistics as it reveals that, in contrast to first-order density, they carry much more unique information on traffic sources and behaviour. The thesis then exploits the use of Gaussian Markov models to model these unique features and finally shows how the use of simple classic Markov models coupled with use of second-order density statistics provides an excellent tool for capturing maximum traffic detail, which in itself is the essence of good traffic modelling. The second part of the thesis, studies the ON-OFF characteristics of VoIP traffic with reference to accurate measurements of the ON and OFF periods, made from a large multi-lingual database of over 100 hours worth of VoIP call recordings. The impact of the language, prosodic structure and speech rate of the speaker on the statistics of the ON-OFF periods is analysed and relevant conclusions are presented. Finally, an ON-OFF VoIP source model with log-normal transitions is contributed as an ideal candidate to model VoIP traffic and the results of this model are compared with those of previously published work.

An accurate Markov model for slotted CSMA/CA algorithm in IEEE 802.15.4 networks

In this letter we propose an Markov model for slotted CSMA/CA algorithm working in a non-acknowledgement mode, specified in IEEE 802.15.4 standard. Both saturation throughput and energy consumption are modeled as functions of backoff window size, number of contending devices and frame length. Simulations show that the proposed model can achieve a very high accuracy (less than 1% mismatch) if compared to all existing models (bigger than 10% mismatch).

A novel framework of training hidden Markov support vector machines from lightly-annotated data

Natural language understanding (NLU) aims to map sentences to their semantic mean representations. Statistical approaches to NLU normally require fully-annotated training data where each sentence is paired with its word-level semantic annotations. In this paper, we propose a novel learning framework which trains the Hidden Markov Support Vector Machines (HM-SVMs) without the use of expensive fully-annotated data. In particular, our learning approach takes as input a training set of sentences labeled with abstract semantic annotations encoding underlying embedded structural relations and automatically induces derivation rules that map sentences to their semantic meaning representations. The proposed approach has been tested on the DARPA Communicator Data and achieved 93.18% in F-measure, which outperforms the previously proposed approaches of training the hidden vector state model or conditional random fields from unaligned data, with a relative error reduction rate of 43.3% and 10.6% being achieved.

Rotation invariant iris feature extraction using Gaussian Markov random fields with non-separable wavelet

Rotation invariance is important for an iris recognition system since changes of head orientation and binocular vergence may cause eye rotation. The conventional methods of iris recognition cannot achieve true rotation invariance. They only achieve approximate rotation invariance by rotating the feature vector before matching or unwrapping the iris ring at different initial angles. In these methods, the complexity of the method is increased, and when the rotation scale is beyond the certain scope, the error rates of these methods may substantially increase. In order to solve this problem, a new rotation invariant approach for iris feature extraction based on the non-separable wavelet is proposed in this paper. Firstly, a bank of non-separable orthogonal wavelet filters is used to capture characteristics of the iris. Secondly, a method of Markov random fields is used to capture rotation invariant iris feature. Finally, two-class kernel Fisher classifiers are adopted for classification. Experimental results on public iris databases show that the proposed approach has a low error rate and achieves true rotation invariance. © 2010.