On the relationships among latent variables and residuals in PLS path modeling: The formative-reflective scheme

A new approach for the estimation and the validation of a structural equation model with a formative-reflective scheme is presented. The basis of the paper is a proposal for overcoming a potential deficiency of PLS path modeling. In the PLS approach the reflective scheme assumed for the endogenous latent variables (LVs) is inverted; moreover, the model errors are not explicitly taken into account for the estimation of the endogenous LVs. The proposed approach utilizes all the relevant information in the formative manifest variables (MVs) providing solutions which respect the causal structure of the model. The estimation procedure is based on the optimization of the redundancy criterion. The new approach, entitled redundancy analysis approach to path modeling (RA-PM) is compared with both traditional PLS Path Modeling and LISREL methodology, on the basis of real and simulated data.     

Almost sure exponential convergence to consensus of random gossip algorithms

In this paper, we provide a proof of almost sure exponential convergence to consensus for a general class of ergodic edge selection processes. The proof is based on the multiplicative ergodic theorem of Oseledec and also applies to continuous time gossip algorithms. An example of exponential convergence in a non ergodic case is also discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

Fibonacci: A programming language for object databases

Fibonacci is an object-oriented database programming language characterized by static and strong typing, and by new mechanisms for modeling data-bases in terms of objects with roles, classes, and associations. A brief introduction to the language is provided to present those features, which are particularly suited to modeling complex databases. Examples of the use of Fibonacci are given with reference to the prototype implementation of the language.     

A variational integrators approach to second order modeling and identification of linear mechanical systems

The theory of variational integration provides a systematic procedure to discretize the equations of motion of a mechanical system, preserving key properties of the continuous time flow. The discrete-time model obtained by variational integration theory inherits structural conditions which in general are not guaranteed under general discretization procedures. We discuss a simple class of variational integrators for linear second order mechanical systems and propose a constrained identification technique which employs simple linear transformation formulas to recover the continuous time parameters of the system from the discrete-time identified model. We test this approach on a simulated eight degrees of freedom system and show that the new procedure leads to an accurate identification of the continuous-time parameters of second-order mechanical systems starting from discrete measured data.     

Online Coloring of Bipartite Graphs with and without Advice

In the online version of the well-known graph coloring problem, the vertices appear one after the other together with the edges to the already known vertices and have to be irrevocably colored immediately after their appearance. We consider this problem on bipartite, i.e., two-colorable graphs. We prove that at least ?1.13746?log₂(n)?0.49887? colors are necessary for any deterministic online algorithm to be able to color any given bipartite graph on n vertices, thus improving on the previously known lower bound of ?log₂ n?+1 for sufficiently large n. Recently, the advice complexity was introduced as a method for a fine-grained analysis of the hardness of online problems. We apply this method to the online coloring problem and prove (almost) tight linear upper and lower bounds on the advice complexity of coloring a bipartite graph online optimally or using 3 colors. Moreover, we prove that \(O(\sqrt{n})\) advice bits are sufficient for coloring any bipartite graph on n vertices with at most ?log₂ n? colors.     

On the second-order sliding mode control of nonlinear systems with uncertain control direction

This note deals with the implementation of a second-order sliding mode control algorithm for a class of nonlinear systems in which the sign of the high-frequency gain, though constant, is unknown. A specific second-order sliding mode control algorithm, the “Suboptimal” algorithm, is properly modified in order to face the uncertainty in the control direction. It is shown that after a finite time the uncertain sign is identified and the standard finite time convergence takes place from that time on. Simulation results are provided.     

On the design of efficient ATM routing schemes

In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks; (ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight.     

Black‐box position and attitude tracking for underwater vehicles by second‐order sliding‐mode technique

In this work we address the tracking control problems for autonomous underwater vehicles (AUVs). The proposed solution is based on the variable structure systems (VSS) theory and, in particular, on the second‐order sliding‐mode (2‐SM) methodology. The tuning of the controller is carried out via black‐box approach, dispensing with the knowledge of the actual AUV parameters, by simply progressively increasing a single gain parameter. The presented stability analysis includes explicitly the unmodelled actuator dynamics and the presence of external uncertain disturbances. The good performance of the proposed scheme is verified by means of simulations on a 6‐DOF AUV. Copyright © 2009 John Wiley & Sons, Ltd.