Searcharxiv⌕ Search

arXiv subjects

Li Guo

Publications and source records attributed to Li Guo.

At least 145 records · Page 8Linked to original sources

Hopf algebra of multi-decorated rooted forests, free matching Rota-Baxter algebras and Gröbner-Shirshov bases

Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted forests with multiple decoration sets to construct free Hopf algebras with multiple Hochschild 1-cocycle conditions. Applying the universal property of the underlying operated algebras and the method of Gröbner-Shirshov bases, we then construct free objects in the category of matching Rota-Baxter algebras which is a generalization of Rota-Baxter algebras to allow multiple Rota-Baxter operators. Finally the free matching Rota-Baxter algebras are equipped with a cocycle Hopf algebra structure.

math.RA↗

On differential lattices

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications of differential lattices are obtained for some basic lattices. Several families of derivations on a lattice are explicitly constructed, giving realizations of the lattice as lattices of derivations. Derivations on a finite distributive lattice are shown to have a natural structure of lattice. Moreover, derivations on a complete infinitely distributive lattice form a complete lattice. For a general lattice, it is conjectured that its poset of derivations is a lattice that uniquely determines the given lattice.

math.RA↗

Compatible structures on unary binary nonsymmetric operads with quadratic and cubic relations

Various compatibility conditions among replicated copies of operations in a given algebraic structure have appeared in broad contexts in recent years. Taking an uniform approach, this paper gives an operadic study of compatibility conditions for nonsymmetric operads with unary and binary operations, and homogeneous quadratic and cubic relations. This generalizes the previous studies for binary quadratic operads. We consider three compatibility conditions, namely the linear compatibility, matching compatibility and total compatibility, with increasingly strict restraints among the replicated copies. The linear compatibility is in Koszul dual to the total compatibility, while the matching compatibility is self dual. Further, each compatibility can be expressed in terms of either one or both of the two Manin square products.

math.CT↗

From orthocomplementations to locality

After some background on lattices, the locality framework introduced in earlier work by the authors is extended to cover posets and lattices. We then extend the correspondence between Euclidean structures on vector spaces and orthogonal complementations to a one-one correspondence between a class of locality structures and orthocomplementations on bounded lattices. This recasts in the context of renormalisation classical results in lattice theory.

math.RA↗

Privacy-Preserving Cloud-Aided Broad Learning System

With the rapid development of artificial intelligence and the advent of the 5G era, deep learning has received extensive attention from researchers. Broad Learning System (BLS) is a new deep learning model proposed recently, which shows its effectiveness in many fields, such as image recognition and fault detection. However, the training process still requires vast computations, and therefore cannot be accomplished by some resource-constrained devices. To solve this problem, the resource-constrained device can outsource the BLS algorithm to cloud servers. Nevertheless, some security challenges also follow with the use of cloud computing, including the privacy of the data and the correctness of returned results. In this paper, we propose a secure, efficient, and verifiable outsourcing algorithm for BLS. This algorithm not only improves the efficiency of the algorithm on the client but also ensures that the clients sensitive information is not leaked to the cloud server. In addition, in our algorithm, the client can verify the correctness of returned results with a probability of almost 1. Finally, we analyze the security and efficiency of our algorithm in theory and prove our algorithms feasibility through experiments.

cs.CR↗

An algebraic study of Volterra integral equations and their operator linearity

The algebraic study of special integral operators led to the notions of Rota-Baxter operators and shuffle products which have found broad applications. This paper carries out an algebraic study of general integral operators and equations, and shows that there are rich algebraic structures underlying Volterra integral operators and the corresponding equations. First Volterra integral operators are shown to produce a matching twisted Rota-Baxter algebra satisfying twisted integration-by-parts operator identities. In order to provide a universal space to express general integral equations, free operated algebras are then constructed in terms of bracketed words and rooted trees with decorations on the vertices and edges. Further explicit constructions of the free objects in the category of matching twisted Rota-Baxter algebras are obtained by a twisted and decorated generalization of the shuffle product, providing a universal space for separable Volterra equations. As an application of these algebraic constructions, it is shown that any integral equation with separable Volterra kernels is operator linear in the sense that the equation can be simplified to a linear combination of iterated integrals.

math.RA↗

Intelligent Reflecting Surface Enhanced Indoor Robot Path Planning: A Radio Map based Approach

In this paper, an indoor robot navigation system is investigated, where an intelligent reflecting surface (IRS) is employed to enhance the connectivity between the access point (AP) and robotic users. Both single-user and multiple-user scenarios are considered. In the single-user scenario, one mobile robotic user (MRU) communicates with the AP. In the multiple-user scenario, the AP serves one MRU and one static robotic user (SRU) employing either non-orthogonal multiple access (NOMA) or orthogonal multiple access (OMA) transmission. The considered system is optimized for minimization of the travelling time/distance of the MRU from a given starting point to a predefined final location, while satisfying constraints on the communication quality of the robotic users. To this end, a radio map based approach is proposed to exploit location-dependent channel propagation knowledge. For the single-user scenario, a channel power gain map is constructed, which characterizes the spatial distribution of the maximum expected effective channel power gain of the MRU for the optimal IRS phase shifts. Based on the obtained channel power gain map, the communication-aware robot path planing problem is solved by exploiting graph theory. For the multiple-user scenario, a communication rate map is constructed, which characterizes the spatial distribution of the maximum expected rate of the MRU for the optimal power allocation at the AP and the optimal IRS phase shifts subject to a minimum rate requirement for the SRU. The joint optimization problem is efficiently solved by invoking bisection search and successive convex approximation methods. Then, a graph theory based solution for the robot path planning problem is derived by exploiting the obtained communication rate map. Our numerical results verify the effectiveness of the proposed designs.

eess.SP↗

Commutative matching Rota-Baxter operators, shuffle products with decorations and matching Zinbiel algebras

The Rota-Baxter algebra and the shuffle product are both algebraic structures arising from integral operators and integral equations. Free commutative Rota-Baxter algebras provide an algebraic framework for integral equations with the simple Riemann integral operator. The Zinbiel algebras form a category in which the shuffle product algebra is the free object. Motivated by algebraic structures underlying integral equations involving multiple integral operators and kernels, we study commutative matching Rota-Baxter algebras and construct the free objects making use of the shuffle product with multiple decorations. We also construct free commutative matching Rota-Baxter algebras in a relative context, to emulate the action of the integral operators on the coefficient functions in an integral equation. We finally show that free commutative \match Rota-Baxter algebras give the free matching Zinbiel algebra, generalizing the characterization of the shuffle product algebra as the free Zinbiel algebra obtained by Loday.

math.RA↗

Renormalization of quasisymmetric functions

As a natural basis of the Hopf algebra of quasisymmetric functions, monomial quasisymmetric functions are formal power series defined from compositions. The same definition applies to left weak compositions, while leads to divergence for other weak compositions. We adapt the method of renormalization in quantum field theory, in the framework of Connes and Kreimer, to deal with such divergency. This approach defines monomial quasisymmetric functions for any weak composition as power series while extending the quasi-shuffle (stuffle) relation satisfied by the usual quasisymmetric functions. The algebra of renormalized quasisymmetric functions thus obtained turns out to be isomorphic to the quasi-shuffle algebra of weak compositions, giving the former a natural Hopf algebra structure and the latter a power series realization. This isomorphism also gives the free commutative Rota-Baxter algebra a power series realization, in support of a suggestion of Rota that Rota-Baxter algebra should provide a broad context for generalizations of symmetric functions.

math.CO↗

A Locational Marginal Pricing Mechanism for Uncertainty Management Based on Improved Multi-Ellipsoidal Uncertainty Set

Large-scale integration of renewable energy sources (RES) brings huge challenges to the power system. A cost-effective reserve deployment and uncertainty pricing mechanism are critical to deal with the uncertainty and variability of RES. To this end, this paper proposes a novel locational marginal pricing mechanism in day-ahead market for managing uncertainties from RES. Firstly, an improved multi-ellipsoidal uncertainty set (IMEUS) considering the temporal correlation and conditional correlation of wind power forecast is formulated to better capture the uncertainty of wind power. The dimension of each ellipsoidal subset is optimized based on a comprehensive evaluation index to reduce the invalid region without large loss of modeling accuracy, so as to reduce the conservatism. Then, an IMEUS-based robust unit commitment (RUC) model and a robust economic dispatch (RED) model are established for the day-ahead market clearing. Both the reserve cost and ramping constraints are considered in the overall dispatch process. Furthermore, based on the Langrangian function of the RED model, a new locational marginal pricing mechanism is developed. The uncertainty locational marginal price (ULMP) is introduced to charge the RES for its uncertainties and reward the generators who provide reserve to mitigate uncertainties. The new pricing mechanism can provide effective price signals to incentivize the uncertainty management in the day-ahead market. Finally, the effectiveness of the proposed methods is verified via numerous simulations on the PJM 5-bus system and IEEE 118-bus system.

eess.SY↗

Joint Deployment and Multiple Access Design for Intelligent Reflecting Surface Assisted Networks

The fundamental intelligent reflecting surface (IRS) deployment problem is investigated for IRS-assisted networks, where one IRS is arranged to be deployed in a specific region for assisting the communication between an access point (AP) and multiple users. Specifically, three multiple access schemes are considered, namely non-orthogonal multiple access (NOMA), frequency division multiple access (FDMA), and time division multiple access (TDMA). The weighted sum rate maximization problem for joint optimization of the deployment location and the reflection coefficients of the IRS as well as the power allocation at the AP is formulated. The non-convex optimization problems obtained for NOMA and FDMA are solved by employing monotonic optimization and semidefinite relaxation to find a performance upper bound. The problem obtained for TDMA is optimally solved by leveraging the time-selective nature of the IRS. Furthermore, for all three multiple access schemes, low-complexity suboptimal algorithms are developed by exploiting alternating optimization and successive convex approximation techniques, where a local region optimization method is applied for optimizing the IRS deployment location. Numerical results are provided to show that: 1) near-optimal performance can be achieved by the proposed suboptimal algorithms; 2) asymmetric and symmetric IRS deployment strategies are preferable for NOMA and FDMA/TDMA, respectively; 3) the performance gain achieved with IRS can be significantly improved by optimizing the deployment location.

eess.SP↗

Vision-based Price Suggestion for Online Second-hand Items

Different from shopping in physical stores, where people have the opportunity to closely check a product (e.g., touching the surface of a T-shirt or smelling the scent of perfume) before making a purchase decision, online shoppers rely greatly on the uploaded product images to make any purchase decision. The decision-making is challenging when selling or purchasing second-hand items online since estimating the items' prices is not trivial. In this work, we present a vision-based price suggestion system for the online second-hand item shopping platform. The goal of vision-based price suggestion is to help sellers set effective prices for their second-hand listings with the images uploaded to the online platforms. First, we propose to better extract representative visual features from the images with the aid of some other image-based item information (e.g., category, brand). Then, we design a vision-based price suggestion module which takes the extracted visual features along with some statistical item features from the shopping platform as the inputs to determine whether an uploaded item image is qualified for price suggestion by a binary classification model, and provide price suggestions for items with qualified images by a regression model. According to two demands from the platform, two different objective functions are proposed to jointly optimize the classification model and the regression model. For better model training, we also propose a warm-up training strategy for the joint optimization. Extensive experiments on a large real-world dataset demonstrate the effectiveness of our vision-based price prediction system.

cs.CV↗

Integration and geometrization of Rota-Baxter Lie algebras

This paper first introduces the notion of a Rota-Baxter operator (of weight $1$) on a Lie group so that its differentiation gives a Rota-Baxter operator on the corresponding Lie algebra. Direct products of Lie groups, including the decompositions of Iwasawa and Langlands, carry natural Rota-Baxter operators. Formal inverse of the Rota-Baxter operator on a Lie group is precisely the crossed homomorphism on the Lie group, whose tangent map is the differential operator of weight $1$ on a Lie algebra. A factorization theorem of Rota-Baxter Lie groups is proved, deriving directly on the Lie group level, the well-known global factorization theorems of Semenov-Tian-Shansky in his study of integrable systems. As geometrization, the notions of Rota-Baxter Lie algebroids and Rota-Baxter Lie groupoids are introduced, with the former a differentiation of the latter. Further, a Rota-Baxter Lie algebroid naturally gives rise to a post-Lie algebroid, generalizing the well-known fact for Rota-Baxter Lie algebras and post-Lie algebras. It is shown that the geometrization of a Rota-Baxter Lie algebra or a Rota-Baxter Lie group can be realized by its action on a manifold. Examples and applications are provided for these new notions.

math.QA↗

Construction of free differential algebras by extending Gröbner-Shirshov bases

As a fundamental notion, the free differential algebra on a set is concretely constructed as the polynomial algebra on the differential variables. Such a construction is not known for the more general notion of the free differential algebra on an algebra, from the left adjoint functor of the forgetful functor from differential algebras to algebras, instead of sets. In this paper we show that generator-relation properties of a base algebra can be extended to the free differential algebra on this base algebra. More precisely, a Gröbner-Shirshov basis property of the base algebra can be extended to the free differential algebra on this base algebra, allowing a Poincaré-Birkhoff-Witt type basis for these more general free differential algebras. Examples are given as illustrations.

math.RA↗

Intelligent Reflecting Surface Enhanced Indoor Robot Path Planning Using Radio Maps

An indoor robot navigation system is investigated, where an intelligent reflecting surface (IRS) is employed to enhance the connectivity between the access point (AP) and a mobile robotic user. The considered system is optimized for minimization of the travelling time/distance of the mobile robotic user from a given starting point to a predefined final location, while satisfying constraints on the communication quality. To tackle this problem, a radio map based approach is proposed to exploit location-dependent channel propagation knowledge. Specifically, a channel power gain map is constructed, which characterizes the spatial distribution of the maximum expected effective channel power gain of the mobile robotic user for the optimal IRS phase shifts. Based on the obtained channel power gain map, the communication-aware robot path planing problem is solved as a shortest path problem by exploiting graph theory. Numerical results show that: 1) Deploying an IRS can significantly extend the coverage of the AP and reduce the travelling distance of the mobile robotic user; 2) 2- or 3-bit IRS phase shifters can achieve nearly the same performance as continuous IRS phase shifters.

eess.SP↗

Exploiting Intelligent Reflecting Surfaces in NOMA Networks: Joint Beamforming Optimization

This paper investigates a downlink multiple-input single-output intelligent reflecting surface (IRS) aided non-orthogonal multiple access (NOMA) system, where a base station (BS) serves multiple users with the aid of IRSs. Our goal is to maximize the sum rate of all users by jointly optimizing the active beamforming at the BS and the passive beamforming at the IRS, subject to successive interference cancellation decoding rate conditions and IRS reflecting elements constraints. In term of the characteristics of reflection amplitudes and phase shifts, we consider ideal and non-ideal IRS assumptions. To tackle the formulated non-convex problems, we propose efficient algorithms by invoking alternating optimization, which design the active beamforming and passive beamforming alternately. For the ideal IRS scenario, the two subproblems are solved by invoking the successive convex approximation technique. For the non-ideal IRS scenario, constant modulus IRS elements are further divided into continuous phase shifts and discrete phase shifts. To tackle the passive beamforming problem with continuous phase shifts, a novel algorithm is developed by utilizing the sequential rank-one constraint relaxation approach, which is guaranteed to find a locally optimal rank-one solution. Then, a quantization-based scheme is proposed for discrete phase shifts. Finally, numerical results illustrate that: i) the system sum rate can be significantly improved by deploying the IRS with the proposed algorithms; ii) 3-bit phase shifters are capable of achieving almost the same performance as the ideal IRS; iii) the proposed IRS-aided NOMA systems achieve higher system sum rate than the IRS-aided orthogonal multiple access system.

eess.SP↗

Non-Orthogonal Multiple Access for Air-to-Ground Communication

This paper investigates ground-aerial uplink non-orthogonal multiple access (NOMA) cellular networks. A rotary-wing unmanned aerial vehicle (UAV) user and multiple ground users (GUEs) are served by ground base stations (GBSs) by utilizing the uplink NOMA protocol. The UAV is dispatched to upload specific information bits to each target GBSs. Specifically, our goal is to minimize the UAV mission completion time by jointly optimizing the UAV trajectory and UAV-GBS association order while taking into account the UAV's interference to non-associated GBSs. The formulated problem is a mixed integer non-convex problem and involves infinite variables. To tackle this problem, we efficiently check the feasibility of the formulated problem by utilizing graph theory and topology theory. Next, we prove that the optimal UAV trajectory needs to satisfy the \emph{fly-hover-fly} structure. With this insight, we first design an efficient solution with predefined hovering locations by leveraging graph theory techniques. Furthermore, we propose an iterative UAV trajectory design by applying successive convex approximation (SCA) technique, which is guaranteed to coverage to a locally optimal solution. We demonstrate that the two proposed designs exhibit polynomial time complexity. Finally, numerical results show that: 1) the SCA based design outperforms the fly-hover-fly based design; 2) the UAV mission completion time is significantly minimized with proposed NOMA schemes compared with the orthogonal multiple access (OMA) scheme; 3) the increase of GUEs' quality of service (QoS) requirements will increase the UAV mission completion time.

cs.IT↗