No abstract uploaded!

New, “big data” sources allow measurement of city characteristics and outcomevariables at higher collection frequencies and more granular geographic scales thanever before. However, big data will not solve large urban social science questionson its own. Big urban data has the most value for the study of cities when it allowsmeasurement of the previously opaque, or when it can be coupled with exogenous shocksto people or place. We describe a number of new urban data sources and illustrate howthey can be used to improve the study and function of cities. We rst show how GoogleStreet View images can be used to predict income in New York City, suggesting thatsimilar imagery data can be used to map wealth and poverty in previously unmeasuredareas of the developing world. We then discuss how survey techniques can be improved tobetter measure willingness to pay for urban amenities. Finally, we explain how Internetdata is being used to improve the quality of city services.

Cartographical projection is mathematical cartography. Map projection is the mathematical model of geoid. Gauss-Kruger projection is unable to realize seamless splicing between adjoining sheet maps. While Mercator projection, especially web Mercator projection, is able to realize seamless splicing but has larger measurement error. How to combine with the advantage of the two projections, apply the method of map projection transformation and realize accurate measurement under the framework of a global map, is the purpose of thisarticle. In order to demonstrate that the problem of measurement could be solved by map projection transformation, we studied the mathematical principle of Gauss - Kruger Projection and the Mercator Projection and designed the algorithm model based on characteristics of both projections. And established simulated data in ArcMap, calculated the error of the three indicators-the area, the length and the angle- under areas in different latitude(0°-4°、30°-34°、60°-64°)and longitude (120°-126°)range which validated the algorithm model. The conclusion suggests that it is feasible that using web Mercator Projection is capable to achieve a global map expression. Meanwhile, calculations of area, distance and angle using map projection transformation principle are feasible as well in Gauss - Kruger Projection. This algorithm combines the advantage of the two different kinds of projection, is able to satisfy uses' high demand and covers the shortage of measurement function of online map services in China. It has certain practical value.

No abstract uploaded!

No abstract uploaded!

For the purpose of isogeometric analysis, one of the most common ways is to construct structured hexahedral meshes, which have regular tensor product structure, and fit them by volumetric T-Splines. This theoretic work proposes a novel surface quadrilateral meshing method, colorable quad-mesh, which leads to the structured hexahedral mesh of the enclosed volume for high genus surfaces. The work proves the equivalence relations among colorable quad-meshes, finite measured foliations and Strebel differentials on surfaces. This trinity theorem lays down the theoretic foundation for quadrilateral/hexahedral mesh generation, and leads to practical, automatic algorithms. The work proposes the following algorithm: the user inputs a set of disjoint, simple loops on a high genus surface, and specifies a height parameter for each loop; a unique Strebel differential is computed with the combinatorial type and the heights prescribed by the user’s input; the Strebel differential assigns a flat metric on the surface and decomposes the surface into cylinders; a colorable quad-mesh is generated by splitting each cylinder into two quadrilaterals, followed by subdivision; the surface cylindrical decomposition is extended inward to produce a solid cylindrical decomposition of the volume; the hexadhedral meshing is generated for each volumetric cylinder and then glued together to form a globally consistent hex-mesh. The method is rigorous, geometric, automatic and conformal to the geometry. This work focuses on the theoretic aspects of the framework, the algorithmic details and practical evaluations will be given in the future expositions.

No abstract uploaded!

No abstract uploaded!

Cooperative dual-crane lifting is an important but challenging process involved in heavy and critical lifting tasks. This paper considers the path planning for the cooperative dual-crane lifting. It aims to automatically generate optimal dual-crane lifting paths under multiple constraints, i.e., collision avoidance, coordination between the two cranes, and balance of the lifting target. Previous works often used oversimplified models for the dual-crane lifting system, the lifting environment, and the motion of the lifting target. They were thus limited to simple lifting cases and might even lead to unsafe paths in some cases. We develop a novel path planner for dual-crane lifting that can quickly produce optimized paths in complex 3-D environments. The planner has fully considered the kinematic structure of the lifting system. Therefore, it is able to robustly handle the nonlinear movement of the suspended target during lifting. The effectiveness and efficiency of the planner are enabled by three novel aspects: 1) a comprehensive and computationally efficient mathematical modeling of the lifting system; 2) a new multiobjective parallel genetic algorithm designed to solve the path planning problem; and 3) a new efficient approach to perform continuous collision detection for the dual-crane lifting target. The planner has been tested in complex industrial environments. The results show that the planner can generate dual-crane lifting paths that are easy for conductions and optimized in terms of costs for complex environments. Comparisons with two previous methods demonstrate the advantages of the planner, including safer paths, higher success rates, and the ability to handle general lifting cases.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

This paper studies the inventory management problem of dual channels operated by one vendor. Demands of dual channels are inventory-level-dependent.We propose a multi-period stochastic dynamic programming model which shows that under mild conditions, the myopic inventory policy is optimal for the infinite horizon problem. To investigate the importance of capturing demand dependency on inventory levels, we consider a heuristic where the vendor ignores demand dependency on inventory levels, and compare the optimal inventory levels with those recommended by the heuristic. Through numerical examples, we show that the vendor may order less for dual channels than those recommended by the heuristic, and the difference between the inventory levels in the two cases can be so large that the demand dependency on inventory levels cannot be neglected. In the end, we numerically examine the impact of different ways to treat unmet demand and obtain some managerial insights.

We study wetting front (traveling wave) solutions to the Richards equation that describe the vertical infiltration of water through one-dimensional periodically layered unsaturated soils. We prove the existence, uniqueness, and large time asymptotic stability of the traveling wave solutions under prescribed flux boundary conditions and certain constitutive conditions. The traveling waves are connections between two steady state solutions that form near the ground surface and towards the underground water table. We found a closed form expression of the wave speed. The speed of a traveling wave is equal to the ratio of the flux difference and the difference of the spatial averages of the two steady states. We give both analytical and numerical examples showing that the wave speeds in the periodic soils can be larger or smaller than those in the homogeneous soils which have the same mean diffusivity and conductivity

We propose to combine cepstrum and nonlinear time–frequency (TF) analysis to study multiple component oscillatory signals with time-varying frequency and amplitude and with time-varying non-sinusoidal oscillatory pattern. The concept of cepstrum is applied to eliminate the wave-shape function influence on the TF analysis, and we propose a new algorithm, named de-shape synchrosqueezing transform (deshape SST). The mathematical model, adaptive non-harmonic model, is introduced and the de-shape SST algorithm is theoretically analyzed. In addition to simulated signals, several different physiological, musical and biological signals are analyzed to illustrate the proposed algorithm.

Given a gauged linear sigma model (GLSM) $\mathcal{T}_{X}$ realizing a projective variety $X$ in one of its phases, i.e. its quantum K\"ahler moduli has a geometric point, we propose an \emph{extended} GLSM $\mathcal{T}_{\mathcal{X}}$ realizing the homological projective dual category $\mathcal{C}$ to $D^{b}Coh(X)$ as the category of B-branes of the Higgs branch of one of its phases. In most of the cases, the models $\mathcal{T}_{X}$ and $\mathcal{T}_{\mathcal{X}}$ are anomalous and the analysis of their Coulomb and mixed Coulomb-Higgs branches gives information on the semiorthogonal/Lefschetz decompositions of $\mathcal{C}$ and $D^{b}Coh(X)$. We also study the models $\mathcal{T}_{X_{L}}$ and $\mathcal{T}_{\mathcal{X}_{L}}$ that correspond to homological projective duality of linear sections $X_{L}$ of $X$. This explains why, in many cases, two phases of a GLSM are related by homological projective duality. We study mostly abelian examples: linear and Veronese embeddings of $\mathbb{P}^{n}$ and Fano complete intersections in $\mathbb{P}^{n}$. In such cases, we are able to reproduce known results as well as produce some new conjectures. In addition, we comment on the construction of the HPD to a nonabelian GLSM for the Pl\"ucker embedding of the Grassmannian $G(k,N)$.

No abstract uploaded!

No abstract uploaded!

We present a general computational framework to locally characterize any shape space of meshes implicitly prescribed by a collection of non-linear constraints. We computationally access such manifolds, typically of high dimension and co-dimension, through first and second order approximants, namely tangent spaces and quadratically parameterized osculant surfaces. Exploration and navigation of desirable subspaces of the shape space with regard to application specific quality measures are enabled using approximants that are intrinsic to the underlying manifold and directly computable in the parameter space of the osculant surface. We demonstrate our framework on shape spaces of planar quad (PQ) meshes, where each mesh face is constrained to be (nearly) planar, and circular meshes, where each face has a circumcircle. We evaluate our framework for navigation and design exploration on a variety of inputs, while keeping context specific properties such as fairness, proximity to a reference surface, etc.

Information Technology has enabled new levels of convenience to our daily life. While providing people with astonishingly good experiences, computer science has still a long way to meet the needs from the users for various scenarios. As a good example, path selection problem is an important and common problem which finds applications in location based services, internet routing and navigation systems. Choosing the most cost effective and time saving routines plays an essential role in both theory and engineering. Although a plethora of classical solutions have been made to the static shortest path problem, dynamic shortest path problem has not been thoroughly studied. To address this critical issue, this paper investigates the dynamic shortest path problem by optimizing existing work and conducting extensive experiments. The studies fall into three main variants of the problem: unweighted shortest paths, weighted shortest paths, and shortest paths on the map. We present a comprehensive comparison of our optimizations and existing solutions which demonstrates the effectiveness and efficiency of our algorithms.