Spatial data warehouses and spatial OLAP come towards the cloud: design and performance

Cloud computing systems handle large volumes of data by using almost unlimited computational resources, while spatial data warehouses (SDWs) are multidimensional databases that store huge volumes of both spatial data and conventional data. Cloud computing environments have been considered adequate to host voluminous databases, process analytical workloads and deliver database as a service, while spatial online analytical processing (spatial OLAP) queries issued over SDWs are intrinsically analytical. However, hosting a SDW in the cloud and processing spatial OLAP queries over such database impose novel obstacles. In this article, we introduce novel concepts as cloud SDW and spatial OLAP as a service, and afterwards detail the design of novel schemas for cloud SDW and spatial OLAP query processing over cloud SDW. Furthermore, we evaluate the performance to process spatial OLAP queries in cloud SDWs using our own query processor aided by a cloud spatial index. Moreover, we describe the cloud spatial bitmap index to improve the performance to process spatial OLAP queries in cloud SDWs, and assess it through an experimental evaluation. Results derived from our experiments revealed that such index was capable to reduce the query response time from 58.20 up to 98.89 %.     

Output feedback of Markov jump linear systems with no mode observation: An automotive throttle application

The note presents an output feedback control strategy for Markov jump linear systems with no mode observation. Based on minimizing a finite‐time quadratic cost, we derive an algorithm that generates output feedback gains that satisfy a necessary optimality condition. These gains can be computed off‐line relying only on the initial condition of the system. This result expands a previous one from the literature that considered state‐feedback only. To illustrate the usefulness of the approach, real‐time laboratory experiments were performed to control an automotive electronic throttle valve subject to Markov‐driven voltage fluctuations. Copyright © 2015 John Wiley & Sons, Ltd.     

Stationary policies for lower bounds on the minimum average cost of discrete‐time nonlinear control systems

The paper deals with the control problem of discrete‐time nonlinear systems. The main contribution of this note is to present conditions that assure the existence of stationary policies that generate lower bounds for the minimal long‐run average cost. These lower bounds coincide with the optimal solution when a mild convergence assumption holds. To illustrate the results, the paper presents an application for the simultaneous state‐feedback control problem, and the derived strategy is used to design a real‐time simultaneous control for two direct current motor devices. The dynamics of these two devices are written in terms of a nonlinear algebraic matrix recurrence, which in turn represents a particular case for our general nonlinear approach. The optimal gain for the corresponding simultaneous state‐feedback problem is obtained, and such a gain was implemented in a laboratory testbed to control simultaneously the two direct current motors. Copyright © 2013 John Wiley & Sons, Ltd.     

Enhancing decentralized service discovery in open service-oriented multi-agent systems

Service-oriented multi-agent systems are dynamic systems that are populated by heterogeneous agents. These agents model their functionality as services in order to allow heterogeneous agents or other entities to interact with each other in a standardized way. Furthermore, due to the large-scale and adaptative needs of the system, traditional directory facilitators or middle-agents are not suitable for the management of agent services. This article proposes the introduction of homophily in service-oriented multi-agent systems to create efficient decentralized and self-organized structures where agents have a greater probability of establishing links with similar agents than with dissimilar ones. This similarity is based on two social dimensions: the set of services that an agent provides and the organizational roles that it plays. A second contribution is an algorithm for service discovery that it is carried out taking into account the local information that is related to the homophily between agents. The experiments compare our proposal with other proposals in distributed environments. The results show that the proposed structure and algorithm offer desirable features for service discovery in decentralized environments. Specifically, these features provide short paths and a high success rate in the service discovery process and resilience under deliberate failures.     

电炉JetBOxTM技术的发展

美国PTI公司发明的专利技术JetBOxTM超音速氧枪喷射系统被证明是一种能有效提高电弧炉产量同时又能减少电炉改造成本的技术.通过在各个炼钢电炉上使用这种独特而有效的化学能输入方式从而获得了良好的效果.由于每个电炉的JetBOxTM系统都是专门设计,能满足每个炼钢车间的不同要求,因此已经被成功地应用在用料篮加料的普通电炉、Consteel电炉、使用DRI/HBI的电炉以及热装铁水的电炉上,同样都获得了良好的运行效果.自2001年以来JetBOxTM系统已经在全世界超过60台不同的电炉上安全而有效地运行着,满足了不同钢厂的要求.     

Spike count correlation increases with length of time interval in the presence of trial-to-trial variation

It has been observed that spike count correlation between two simultaneously recorded neurons often increases with the length of time interval examined. Under simple assumptions that are roughly consistent with much experimental data, we show that this phenomenon may be explained as being due to excess trial-to-trial variation. The resulting formula for the correlation is able to predict the observed correlation of two neurons recorded from primary visual cortex as a function of interval length.     

Stabilizability and positiveness of solutions of the jump linear quadratic problem and the coupled algebraic Riccati equation

This note addresses the jump linear quadratic problem of Markov jump linear systems and the associated algebraic Riccati equation. Necessary and sufficient conditions for stability of the optimal control and positiveness of Riccati solutions are developed. We show that the concept of weak detectability is not only a sufficient condition for the finiteness of cost functional to imply stability of the associated trajectory, but also a necessary one. This, together with a characterization developed here for the kernel of the Riccati solution, allows us to show that the control solution stabilizes the system if and only if the system is weakly detectable, and that the Riccati solution is positive-definite if and only if the system is weakly observable. The connection between the algebraic Riccati equation and the control problem is made, as far as the minimal positive-semidefinite solution for the algebraic Riccati equation is identified with the optimal solution of the linear quadratic problem. Illustrative numerical examples and comparisons are included.     

Synthesis of mechanisms using evolution of associated dissipative systems

The paper deals with the new approach of the kinematical synthesis based on the reformulation of the synthesis computations as a time evolution of the nonlinear dynamical dissipative system. The synthesis/optimization objective functions are constructed based on the network of mechanism positions within the desired workspace. All synthesized parameters of the mechanism are in the associated dynamical system introduced as time-varying and generally different in the different positions. The important points and/or important lines are equipped with the fictitious masses and/or moments of inertia, the differences of parameters generates the correction forces, and the gradual dissipation of the kinetic energy is ensured by dampers connected between the inertial frame and the masses (sky-hook concept). The correction forces couple the auxiliary dynamical subsystems created in different positions. The nonzero correction forces are generated as long as the values of the corresponding parameters across the positions differ. The synthesis process is realized as the time evolution of such a system. The main advantage of the method for solving mechanisms?? synthesis is that it uses the unassembled configurations of the mechanisms by evolution of the time varying parameters. The mechanism search thus smoothly goes through the space of system parameters without inefficient penalization of the unassembled configurations. This space provides possible valuable solution of the more robust kinematical synthesis of the mechanisms. The applications for the different types of synthesis tasks and optimization of different objective functions like the optimization of the mechanism transmission or the multi-objective optimization of dexterity measure and the built-up space are straightforward, as described within the presented examples. The efficiency of the method can be improved using several re-activations of the evolution process.     

Modeling the reliability of a group membership protocol for dual-scheduled time division multiple access networks

We present reliability models for a group membership protocol designed for TDMA networks such as FlexRay, a protocol that is likely to become the de facto standard for next generation automotive networks. The models are based on discrete-time Markov chains and consider a comprehensive set of fault scenarios. Furthermore, they are parametric allowing for a sensitivity analysis. The results, obtained by a numeric solution of the models using the PRISM model-checker, show that they are computationally practical for realistic configurations and that the GMP can achieve reliability levels in the range required for safety critical applications.     

Exploring factors related to users’ experience of public transport route choice: influence of context and users profiles

This exploratory study aims to achieve a better understanding of the users-related factors that affect the choice of routes in public transport (PT). We also look at what can motivate route and modes changes towards alternatives in a real situation. We investigated the experience of 19 users of PTs, using the critical incident technique (Flanagan in Psychol Bull 51(4):327, 1954). We asked participants to report incidents (i.e. situations) in cases they were very satisfied or dissatisfied with their choice. For both situations, the case of their usual route and case of an alternative were considered. A total of 91 incidents were collected and analysed using a multiple correspondences analysis. Additionally, users’ profiles were characterized and superposed to the analysis of incidents content. The main results are as follows. First, the user’s choice of PT route depends on the context (i.e. aim of the travel, time of day). Second, taking an alternative to the usual PT route or using a route combining different transport modes is determined by the context and by factors related to the pleasantness of the travel (e.g. to accompany a friend along the travel). Finally, depending on the user’s profile (i.e. combination of attitude towards PT and demographic variables), the factors taken into account to make the choice of a PT route are related to the efficiency or the pleasantness of the trip. These results show the importance of the contextual factors and the users’ profiles in route choice. They suggest that these factors should be further taken into account in new tools and services for mobility.