RFID together with multi-agent systems to control global value chains

Nowadays, the cooperative intelligent transport systems are part of a largest system. Transportations are modal operations integrated in logistics and, logistics is the main process of the supply chain management. The supply chain strategic management as a simultaneous local and global value chain is a collaborative/cooperative organization of stakeholders, many times in co-opetition, to perform a service to the customers respecting the time, place, price and quality levels. The transportation, like other logistics operations must add value, which is achieved in this case through compression lead times and order fulfillments. The complex supplier's network and the distribution channels must be efficient and the integral visibility (monitoring and tracing) of supply chain is a significant source of competitive advantage. Nowadays, the competition is not discussed between companies but among supply chains. This paper aims to evidence the current and emerging manufacturing and logistics system challenges as a new field of opportunities for the automation and control systems research community. Furthermore, the paper forecasts the use of radio frequency identification (RFID) technologies integrated into an information and communication technologies (ICT) framework based on distributed artificial intelligence (DAI) supported by a multi-agent system (MAS), as the most value advantage of supply chain management (SCM) in a cooperative intelligent logistics systems. Logistical platforms (production or distribution) as nodes of added value of supplying and distribution networks are proposed as critical points of the visibility of the inventory, where these technological needs are more evident.

Criticality of colloids with distinct interaction patches: The limits of linear chains, hyperbranched polymers, and dimers

We use a simple model of associating fluids which consists of spherical particles having a hard-core repulsion, complemented by three short-ranged attractive sites on the surface (sticky spots). Two of the spots are of type A and one is of type B; the bonding interactions between each pair of spots have strengths epsilon(AA), epsilon(BB), and epsilon(AB). The theory is applied over the whole range of bonding strengths and the results are interpreted in terms of the equilibrium cluster structures of the phases. In addition to our numerical results, we derive asymptotic expansions for the free energy in the limits for which there is no liquid-vapor critical point: linear chains (epsilon(AA)not equal 0, epsilon(AB)=epsilon(BB)=0), hyperbranched polymers (epsilon(AB)not equal 0, epsilon(AA)=epsilon(BB)=0), and dimers (epsilon(BB)not equal 0, epsilon(AA)=epsilon(AB)=0). These expansions also allow us to calculate the structure of the critical fluid by perturbing around the above limits, yielding three different types of condensation: of linear chains (AA clusters connected by a few AB or BB bonds); of hyperbranched polymers (AB clusters connected by AA bonds); or of dimers (BB clusters connected by AA bonds). Interestingly, there is no critical point when epsilon(AA) vanishes despite the fact that AA bonds alone cannot drive condensation.

Self-assembly in chains, rings, and branches: a single component system with two critical points

Agências financiadoras: FCT - PEstOE/FIS/UI0618/2011; PTDC/FIS/098254/2008 ERC-PATCHYCOLLOIDS e MIUR-PRIN

Quantitative description of the self-assembly of patchy particles into chains and rings

We numerically study a simple fluid composed of particles having a hard-core repulsion complemented by two patchy attractive sites on the particle poles. An appropriate choice of the patch angular width allows for the formation of ring structures which, at low temperatures and low densities, compete with the growth of linear aggregates. The simplicity of the model makes it possible to compare simulation results and theoretical predictions based on the Wertheim perturbation theory, specialized to the case in which ring formation is allowed. Such a comparison offers a unique framework for establishing the quality of the analytic predictions. We find that the Wertheim theory describes remarkably well the simulation results.

Dynamic programming for a Markov-switching jump–diffusion

We consider an optimal control problem with a deterministic finite horizon and state variable dynamics given by a Markov-switching jump–diffusion stochastic differential equation. Our main results extend the dynamic programming technique to this larger family of stochastic optimal control problems. More specifically, we provide a detailed proof of Bellman’s optimality principle (or dynamic programming principle) and obtain the corresponding Hamilton–Jacobi–Belman equation, which turns out to be a partial integro-differential equation due to the extra terms arising from the Lévy process and the Markov process. As an application of our results, we study a finite horizon consumption– investment problem for a jump–diffusion financial market consisting of one risk-free asset and one risky asset whose coefficients are assumed to depend on the state of a continuous time finite state Markov process. We provide a detailed study of the optimal strategies for this problem, for the economically relevant families of power utilities and logarithmic utilities.

Modelos de previsão de deterioração de pontes existentes: processos de Markov

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Civil

Explosion of smoothness from a point to everywhere for conjugacies between Markov families

For uniformly asymptotically affine (uaa) Markov maps on train tracks, we prove the following type of rigidity result: if a topological conjugacy between them is (uaa) at a point in the train track then the conjugacy is (uaa) everywhere. In particular, our methods apply to the case in which the domains of the Markov maps are Canter sets. We also present similar statements for (uaa:) and C-r Markov families. These results generalize the similar ones of Sullivan and de Faria for C-r expanding circle maps with r > 1 and have useful applications to hyperbolic dynamics on surfaces and laminations.

Electron transfer chains in sulfate reducing bacteria

Dissertação para a obtenção de grau de doutor em Bioquímica pelo Instituto de Tecnologia Química e Biológica. Universidade Nova de Lisboa.

THE U.S. and European M&A cycles: A Markov switching and state space approach

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Credit cycle identification: A Markov-switching application

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Supercomplexes of Prokaryotic Aerobic Respiratory Chains-Escherichia coli and Bacillus subtilis supramolecular assemblies

Dissertation presented to obtain the Ph.D degree in Biochemistry.

Predicting market direction with hidden Markov models

This paper develops the model of Bicego, Grosso, and Otranto (2008) and applies Hidden Markov Models to predict market direction. The paper draws an analogy between financial markets and speech recognition, seeking inspiration from the latter to solve common issues in quantitative investing. Whereas previous works focus mostly on very complex modifications of the original hidden markov model algorithm, the current paper provides an innovative methodology by drawing inspiration from thoroughly tested, yet simple, speech recognition methodologies. By grouping returns into sequences, Hidden Markov Models can then predict market direction the same way they are used to identify phonemes in speech recognition. The model proves highly successful in identifying market direction but fails to consistently identify whether a trend is in place. All in all, the current paper seeks to bridge the gap between speech recognition and quantitative finance and, even though the model is not fully successful, several refinements are suggested and the room for improvement is significant.

An integrated system for human action recognition from video using hidden Markov model

In this paper, we present an integrated system for real-time automatic detection of human actions from video. The proposed approach uses the boundary of humans as the main feature for recognizing actions. Background subtraction is performed using Gaussian mixture model. Then, features are extracted from silhouettes and Vector Quantization is used to map features into symbols (bag of words approach). Finally, actions are detected using the Hidden Markov Model. The proposed system was validated using a newly collected real- world dataset. The obtained results show that the system is capable of achieving robust human detection, in both indoor and outdoor environments. Moreover, promising classification results were achieved when detecting two basic human actions: walking and sitting.

Projeção da dinâmica da floresta natural de Terra-firme, região de Manaus-AM, com o uso da cadeia de transição probabilística de Markov

Os fatores que envolvem os processos da dinâmica da floresta influenciam a sua biodiversidade e, portanto, a qualidade da floresta. A definição de estratégias que envolve a proteção e o uso adequado da floresta manejada e a recuperação de áreas já degradadas tornam-se possível com o estudo da estrutura e dinâmica da floresta primária por meio de informações como a mortalidade, o recrutamento e a permanência das árvores no sistema florestal. Este trabalho teve como objetivo avaliar a dinâmica de uma floresta não perturbada e fazer projeções da dinâmica florestal usando a matriz de transição probabilística (Cadeia de Markov). As taxas de recrutamento, mortalidade e incremento foram determinadas a partir de inventários florestais realizados em dois transectos, nos sentidos Norte-Sul e Leste-Oeste (20 x 2500 m cada, totalizando 10 ha), localizados no km 50 da BR 174, na estrada vicinal ZF-2, Manaus/AM, nos anos de 2000 e 2004. A floresta acumulou 8,34 t.ha-1.ano-1 de biomassa fresca acima do solo. De acordo com projeção para 2008, o número total de árvores diminuirá em 2,67% (de 5987 indivíduos (2004) para 5827 (2008)) e a mortalidade será 15% maior (de 264 (2004) para 311 (2008)). O teste Qui-quadrado mostrou que não há diferença significativa (1% de probabilidade) entre as informações coletadas e projetadas. Esses resultados permitem concluir que a Cadeia de Markov é um eficiente instrumento para projetar a dinâmica da floresta natural, contribuindo para o planejamento em curto prazo das atividades que utilizam os recursos florestais.