Mathematical analysis of investment systems

Investment systems are studied using a framework that emphasize their profiles (the cumulative probability distribution on all the possible percentage gains of trades) and their log return functions (the expected average return per trade in logarithmic scale as a function of the investment size in terms of the percentage of the available capital). The efficiency index for an investment system, defined as the maximum of the log return function, is proposed as a measure to compare investment systems for their intrinsic merit. This efficiency index can be viewed as a generalization of Shannon's information rate for a communication channel. Applications are illustrated.     

Vehicle density and velocity estimation on highways for on-ramp metering control

A scheme for vehicle density and velocity estimation in a stretch of highway based on a modified cell transmission model [C. F. Daganzo, Transportation Research, Part B, 28B(4),269–287, 1994. Elsevier is presented. The scheme is intended for use with on-ramp metering control algorithms, providing local knowledge of densities and velocities that is helpful to improve on-ramp metering control performance. Estimation of density is obtained by nonlinear estimators, while velocity estimation is obtained by gradient algorithms. There is one density–velocity estimator for free traffic flow and other for congested traffic flow. Both estimator schemes work in parallel. The final estimation of density and velocity results from a convex combination of the predictions of the two estimators. This combination depends on occupancy or density measurements at the boundaries of the stretch and is produced by a fuzzy inference system. Stability and convergence of the density and velocity estimation scheme is proved by Lyapunov based techniques. Simulation results comparing measured and estimated traffic data are presented. They confirm good performance of the estimators. Research sponsored by grants UNAM PAPIIT IN110403 and CONACYT 47583.     

Improved modeling and solution methods for the multi-resource routing problem

This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.     

Solution bundle for a class of impulsive differential inclusions on Banach spaces

In this paper a class of impulsive differential inclusions is investigated. The existence of solution bundle is proved. And we also construct a nonlinear semigroup of operators on cb(E) (closed-bounded subset of E) to describe the set of attainable states.     

Dynamical dark energy models – dynamical system approach

We study the Friedmann-Robertson-Walker model with dynamical dark energy modelled in terms of the equation of state p _X = w _X (a(z)) ρ _X in which the coefficient w _X is parameterized by the scale factor a or redshift z. We use methods of qualitative analysis of differential equations to investigate the space of all admissible solutions for all initial conditions on the two-dimensional phase plane. We show advantages of representing this dynamics as a motion of a particle in the one-dimensional potential V(a). One of the features of this reduction is the possibility of investigating how typical big rip singularities are in the future evolution of the model. The properties of potential function V can serve as a tool for qualitative classification of all evolution paths. Some important features like resolution of the acceleration problem can be simply visualized as domains on the phase plane. Then one is able to see how large is the class of solutions (labelled by the inset of the initial conditions) leading to the desired property.     

相关系数与相关性度量

研究了度量相关性的两个主要工具:线性相关系数和尾部相关系数.线性相关系数反映了变量间的线性相关性,这对于一般的椭圆型分布是合适的.但如果随机变量具有不对称的尾部变化特征时,要用尾部相关系数描述它们之间的相关性.通过相关函数C opu la,对沪深股市的尾部相关系数进行了定量分析.结果表明:沪深股市具有较强的相关性.     

General synchronization dynamics of coupled Van der Pol–Duffing oscillators

This paper considers the general synchronization dynamics of coupled Van der Pol–Duffing oscillators. The linear and nonlinear stability analysis on the synchronization process is derived through the Whittaker method and the Floquet theory in addition to the multiple time scales method. A stability map displaying different dynamical states of the system is performed. Numerical simulation is carried out to support and to complement the accuracy of the analytical treatment.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Dynamic Nonlinear Modelization of Operational Supply Chain Systems

Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors, manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the formulation of demonstrably asymptotically optimal management plans.