Searcharxiv⌕ Search

arXiv subjects

Jie Wu

Publications and source records attributed to Jie Wu.

At least 271 records · Page 15Linked to original sources

Cancellation and homotopy rigidity of classical functors

We first show that simply connected co-$H$-spaces and connected $H$-spaces can be uniquely decomposed into prime factors in the homotopy category of pointed $p$-local spaces of finite type, which is used to develop a $p$-local version of Gray's correspondence between homotopy types of prime co-$H$-spaces and homotopy types of prime $H$-spaces, and the split fibration which connects them as well. Further, we use the unique decomposition theorem to study the homotopy rigidity problem for classic functors. Among others, we prove that $ΣΩ$ and $Ω$ are homotopy rigid on simply connected $p$-local co-$H$-spaces of finite type, and $ΩΣ$ and $Σ$ are homotopy rigid on connected $p$-local $H$-spaces of finite type.

math.AT↗

Combinatorics of double loop suspensions, evaluation maps and Cohen groups

We reformulate Milgram's model of a double loop suspension in terms of a preoperad of posets, each stage of which is the poset of all ordered partitions of a finite set. Using this model, we give a combinatorial model for the evaluation map and use it to study the Cohen representation for the group of homotopy classes of maps between double loop suspensions. Demonstrating the general theory, we recover Wu's shuffle relations and further provide a type of secondary relations in Cohen groups by using Toda brackets. In particular, we prove certain maps are null-homotopic by combining our relations and the classical James-Hopf invariants.

math.AT↗

Weighted persistent homology for biomolecular data analysis

In this paper, we systematically review weighted persistent homology (WPH) models and their applications in biomolecular data analysis. Essentially, the weight value, which reflects physical, chemical and biological properties, can be assigned to vertices (atom centers), edges (bonds), or higher order simplexes (cluster of atoms), depending on the biomolecular structure, function, and dynamics properties. Further, we propose the first localized weighted persistent homology (LWPH). Inspired by the great success of element specific persistent homology (ESPH), we do not treat biomolecules as an inseparable system like all previous weighted models, instead we decompose them into a series of local domains, which may be overlapped with each other. The general persistent homology or weighted persistent homology analysis is then applied on each of these local domains. In this way, functional properties, that are embedded in local structures, can be revealed. Our model has been applied to systematically studying DNA structures. It has been found that our LWPH based features can be used to successfully discriminate the A-, B-, and Z-types of DNA. More importantly, our LWPH based PCA model can identify two configurational states of DNA structure in ion liquid environment, which can be revealed only by the complicated helical coordinate system. The great consistence with the helical-coordinate model demonstrates that our model captures local structure variations so well that it is comparable with geometric models. Moreover, geometric measurements are usually defined in very local regions. For instance, the helical-coordinate system is limited to one or two basepairs. However, our LWPH can quantitatively characterize structure information in local regions or domains with arbitrary sizes and shapes, where traditional geometrical measurements fail.

q-bio.BM↗

The deformation quantization of the scalar fields

In this paper the deformation quantization is constructed in the case of scalar fields on Minkowski space-time. We construct the star products at three level concerning fields, Hamiltonian functionals and their underlying structure called Hamiltonian functions in a special sense. Which mean the star products of fields, functionals, Hamiltonian functions, and ones between the fields and functionals. As bases of star products the Poisson brackets at different level are generalized, constructed and discussed in a systematical way, where the Poisson brackets like canonical and time-equal ones. For both of the star products and Poisson brackets the construction at level of Hamiltonian functions plays the essential role. Actually, the discussion for the case of Hamiltonian functions includes the key information about Poisson brackets and the star products in our approach. All of other Poisson brackets and star products in this paper are based on ones of Hamiltonian functions, and the Poisson brackets and the star products at three level are compatible. To discuss the Poisson brackets and the star products in the case of scalar fields, we introduce the notion of algebra of Euler-Lagrange operators which related to variation calculus closely.

math-ph↗

Topological complexity of the work map

We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the task for which the system has been designed. From a purely topological point of view, this is a homotopy invariant of a map which generalizes the classical topological complexity of a space.

math.AT↗

On a certain non-split cubic surface

In this note, we establish an asymptotic formula for the number of rational points of bounded height on the singular cubic surface $$ x_0(x_1^2 + x_2^2)=x_3^3 $$ with a power-saving error term, which verifies the Manin-Peyre conjectures for this surface.

math.NT↗

Visual Saliency Maps Can Apply to Facial Expression Recognition

Human eyes concentrate different facial regions during distinct cognitive activities. We study utilising facial visual saliency maps to classify different facial expressions into different emotions. Our results show that our novel method of merely using facial saliency maps can achieve a descent accuracy of 65\%, much higher than the chance level of $1/7$. Furthermore, our approach is of semi-supervision, i.e., our facial saliency maps are generated from a general saliency prediction algorithm that is not explicitly designed for face images. We also discovered that the classification accuracies of each emotional class using saliency maps demonstrate a strong positive correlation with the accuracies produced by face images. Our work implies that humans may look at different facial areas in order to perceive different emotions.

cs.CV↗

Hodge Decompositions for Weighted Hypergraphs

Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the embedded homology of hypergraphs was constructed. In this paper, we generalize the weighted Laplacians of weighted simplicial complexes to weighted hypergraphs. We study the relations between the weighted Laplacians and the weighted embedded homology of weighted hypergraphs. We generalize the Hodge decompositions of weighted simplicial complexes to weighted hypergraphs. Moreover, as a complement for the Hodge decompositions, we give some results for the nonzero eigenvalues of the weighted Laplacians of weighted hypergraphs.

math.AT↗

On a senary quartic form

We count rational points of bounded height on the non-normal senary quartic hypersurface x 4 = (y 2 1 + $\times$ $\times$ $\times$ + y 2 4)z 2 in the spirit of Manin's conjecture.

math.NT↗

On homotopy aspects and cablings of virtual pure braid groups

By exploring simplicial structure of pure virtual braid groups, we give new connections between the homotopy groups of the 3-sphere and the virtual braid groups that are related to the theory of Brunnian virtual braids. The group structure of VP_n with n > 4 is determined by VP_3, VP_4 and virtual cablings given by iterated degeneracy operations on the generators and defining relations. The complete proofs will be published in the two forthcoming papers.

math.AT↗

Mean Values for a Class of Arithmetic Functions in Short Intervals

In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable as sums of two squares.

math.NT↗

An Accountable Anonymous Data Aggregation Scheme for Internet of Things

The Internet of Things (IoT) has become increasingly popular in people's daily lives. The pervasive IoT devices are encouraged to share data with each other in order to better serve the users. However, users are reluctant to share sensitive data due to privacy concerns. In this paper, we study the anonymous data aggregation for the IoT system, in which the IoT company servers, though not fully trustworthy, are used to assist the aggregation. We propose an efficient and accountable aggregation scheme that can preserve the data anonymity. We analyze the communication and computation overheads of the proposed scheme, and evaluate the total execution time and the per-user communication overhead with extensive simulations. The results show that our scheme is more efficient than the previous peer-shuffle protocol, especially for data aggregation from multiple providers.

cs.CR↗

Cascading Sensor Network Clock Synchronization Scheme

In this paper, we propose a hybrid clock synchronization architecture for a cascaded sensor network based on GPS time service and synchronous frame protocol. The sensor's upper-level unit is called sensor management unit (SMU) which synchronizes the local clock with the GPS and then use the broadcast sync frame to synchronize the clock of the sensor chain. In this paper, we build a link of 20 cascaded sensors to measure the center frequency and clock stability. The results showed that the center frequency deviation was 0.037 Hz and the stability was 0.045 ppm to 0.066 ppm .The stability of GPS is 0.06ppm, the scheme has achieved the effect similar to installing GPS chip on every sensor.

physics.ins-det↗

Using Adjacent Data Retransmission to Improve the Transmission Efficiency of Multi-hop Relay Networks

Data transmission systems are widely used in various aspects of life, industry, research and other fields. Transmission systems have different characteristics for different application scenarios. Many of them require multi-hop transmission to extend the transmission range, such as Wireless Mesh Network (WMN), Mobile Ad-hoc Network (MANET), Wireless Sensor Networks (WSN) and so on. The biggest problem of multi-hop transmission lies in that packet loss caused by bit error ratio (BER) in multiple transmission processes increases greatly, which makes end-to-end transmission reliability and bandwidth utilization decrease. This paper analyzes the impact of BER on bandwidth utilization in multi-hop relay transmission and proposes a simple and flexible transmission mechanism that is generally applicable to multi-hop transmission scenarios.

eess.SP↗

Weighted Persistent Homology

In this paper we develop the theory of weighted persistent homology. In 1990, Robert J. Dawson was the first to study in depth the homology of weighted simplicial complexes. We generalize the definitions of weighted simplicial complex and the homology of weighted simplicial complex to allow weights in an integral domain $R$. Then we study the resulting weighted persistent homology. We show that weighted persistent homology can tell apart filtrations that ordinary persistent homology does not distinguish. For example, if there is a point considered as special, weighted persistent homology can tell when a cycle containing the point is formed or has disappeared.

math.AT↗

The Embedded Homology of Hypergraphs and Applications

Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this paper, generalising the usual homology of simplicial complexes, we define the embedded homology of hypergraphs as well as the persistent embedded homology of sequences of hypergraphs. As a generalisation of the Mayer-Vietoris sequence for the homology of simplicial complexes, we give a Mayer-Vietoris sequence for the embedded homology of hypergraphs. Moreover, as applications of the embedded homology, we study acyclic hypergraphs and construct some indices for the data analysis of hyper-networks.

math.AT↗

Cobordism classes of maps and covers for spheres

In this paper we show that for m>n the set of cobordism classes of maps from m-sphere to n-sphere is trivial. The determination of the cobordism homotopy groups of spheres admits applications to the covers for spheres.

math.AT↗

Computing the Homology of Hypergraphs

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to compute the homology of the associated simplicial complexes and the embedded homology of hypergraphs as well as some heuristics for efficient computations.

math.AT↗