Circuit Synthesis of Electrochemical Supercapacitor Models

This paper is concerned with the synthesis of RC electrical circuits from physics-based supercapacitor models describing conservation and diffusion relationships. The proposed synthesis procedure uses model discretisation, linearisation, balanced model order reduction and passive network synthesis to form the circuits. Circuits with different topologies are synthesized from several physical models. This work will give greater understanding to the physical interpretation of electrical circuits and will enable the development of more generalised circuits, since the synthesized impedance functions are generated by considering the physics, not from experimental fitting which may ignore certain dynamics

Why Do Shoppers Use Cash? Evidence from Shopping Diary Data

Recent studies find that cash remains a dominant payment choice for small-value transactions despite the prevalence of alternative methods of payment such as debit and credit cards. For policy makers an important question is whether consumers truly prefer using cash or merchants restrict card usage. Using unique shopping diary data, we estimate a payment choice model with individual unobserved heterogeneity (demandside factors) while controlling for merchants’ acceptance of cards (supply-side factors). Based on a policy simulation where we impose universal card acceptance among merchants, we find that overall cash usage would decrease by only 7.7 percentage points, implying that cash usage in small-value transactions is driven mainly by consumers’ preferences

Model order reduction of fully parameterized systems by recursive least square optimization

This paper presents an approach for the model order reduction of fully parameterized linear dynamic systems. In a fully parameterized system, not only the state matrices, but also can the input/output matrices be parameterized. The algorithm presented in this paper is based on neither conventional moment-matching nor balanced-truncation ideas. Instead, it uses “optimal (block) vectors” to construct the projection matrix, such that the system errors in the whole parameter space are minimized. This minimization problem is formulated as a recursive least square (RLS) optimization and then solved at a low cost. Our algorithm is tested by a set of multi-port multi-parameter cases with both intermediate and large parameter variations. The numerical results show that high accuracy is guaranteed, and that very compact models can be obtained for multi-parameter models due to the fact that the ROM size is independent of the number of parameters in our approach

A nonparametric Bayesian approach toward robot learning by demonstration

In the past years, many authors have considered application of machine learning methodologies to effect robot learning by demonstration. Gaussian mixture regression (GMR) is one of the most successful methodologies used for this purpose. A major limitation of GMR models concerns automatic selection of the proper number of model states, i.e., the number of model component densities. Existing methods, including likelihood- or entropy-based criteria, usually tend to yield noisy model size estimates while imposing heavy computational requirements. Recently, Dirichlet process (infinite) mixture models have emerged in the cornerstone of nonparametric Bayesian statistics as promising candidates for clustering applications where the number of clusters is unknown a priori. Under this motivation, to resolve the aforementioned issues of GMR-based methods for robot learning by demonstration, in this paper we introduce a nonparametric Bayesian formulation for the GMR model, the Dirichlet process GMR model. We derive an efficient variational Bayesian inference algorithm for the proposed model, and we experimentally investigate its efficacy as a robot learning by demonstration methodology, considering a number of demanding robot learning by demonstration scenarios