Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 8 )

2018 ( 91 )

2017 ( 112 )

2016 ( 129 )

Custom range...

Search Results: 1 - 10 of 16061 matches for " Xiaojun Ji "
All listed articles are free for downloading (OA Articles)
Page 1 /16061
Display every page Item
On commuting Tonelli Hamiltonians: Autonomous case
Xiaojun Cui,Ji Li
Mathematics , 2009,
Abstract: We show that the Aubry sets, the Ma\~{n}\'{e} sets, Mather's barrier functions are the same for two commuting autonomous Tonelli Hamiltonians. We also show the quasi-linearity of $\alpha$-functions from the dynamical point of view and the existence of common $C^{1,1}$ critical subsolution for their associated Hamilton-Jacobi equations.
A new gap phenomenon for proper holomorphic mappings from B^n into B^N
Xiaojun Huang,Shanyu Ji,Dekang Xu
Mathematics , 2006,
Abstract: In this paper (Math. Res. Lett. 13 (2006). No 4, 509-523), the authors established a pseudo-normal form for proper holomoprhic mappings between balls in complex spaces with degenerate rank. This then was used to give a complete characterization for all proper holomorphic maps with geometric rank one, which, in particular, includes the following as an immediate application: Theorem: Any rational holomorphic map from B^n into B^N with $4\le n\le N\le 3n-4$ is equivalent to the D'Angelo map $$F_{\theta}(z',w)=(z',(\cos\theta)w,(\sin\theta)z_1w, ..., (\sin\theta)z_{n-1}w, (\sin\theta)w^2, 0'), 0\le \theta\leq \pi/2.$$ It is a well-known (but also quite trivial) fact that any non-constant rational CR map from a piece of the sphere $\partial {B^n}$ into the sphere $\partial {B^N}$ can be extended as a proper rational holomoprhic map from $B^n$ into $B^N$ ($N\ge n\ge 2$). By using the rationality theorem that the authors established in [HJX05], one sees that the the above theorem (and also the main theorem of the paper) holds in the same way for any non-constant $C^3$-smooth CR map from a piece of $\partial {B^n}$ into $\partial{B^N}$. The paper [Math. Res. Lett. 13 (2006). No 4, 509-523] was first electronically published by Mathematical Research Letters several months ago at its home website: http://www.mrlonline.org/mrl/0000-000-00/Huang-Ji-Xu2.pdf. (The pdf file of the printed journal version can also be downloaded at http://www.math.uh.edu/~shanyuji/rank1.pdf).
A criterion for a proper rational map to be equivalent to a proper polynomial map
Xiaojun Huang,Shanyu Ji,Yuan Zhang
Mathematics , 2007,
Abstract: In this paper, we give an explicit criterion when a rational holomorphic map between balls is equivalent to a polynomial holomorphic map. Making use of this criterion, we show that any proper rational holomorphic map from B^2 into B^N of degree two is equivalent to a polynomial holomorphic map; we also construct rational holomorphic maps of degree 3 that are almost linear but are not equivalent to polynomial holomorphic maps.
CR and Holomorphic Embeddings and Pseudo-conformally Flat Metrics
Xiaojun Huang,Shanyu Ji,Brandon Lee
Mathematics , 2012,
Abstract: We study the non-embddability property for a class of real hypersurfaces, called real hypersurfaces of involution type, into the sphere in the low codimensional case, by making use of property of a naturally related Gauss curvature. We also study rigidity problems for conformal maps between a class of K\"ahler manifolds with pseud-conformally flat metrics.
On the Third Gap for Proper Holomorphic Maps between Balls
Xiaojun Huang,Shanyu Ji,Wanke Yin
Mathematics , 2012,
Abstract: In this paper, we study the gap rigidity phenomenon for proper holomorphic maps between balls of different dimension. We show that any $F\in prop_3({\mathbb{B}}^n, {\mathbb{B}} ^N)$, with $3n
Image encryption schemes for JPEG and GIF formats based on 3D baker with compound chaotic sequence generator
Shiyu Ji,Xiaojun Tong,Miao Zhang
Computer Science , 2012,
Abstract: This paper proposed several methods to transplant the compound chaotic image encryption scheme with permutation based on 3D baker into image formats as Joint Photographic Experts Group (JPEG) and Graphics Interchange Format (GIF). The new method averts the lossy Discrete Cosine Transform and quantization and can encrypt and decrypt JPEG images lossless. Our proposed method for GIF keeps the property of animation successfully. The security test results indicate the proposed methods have high security. Since JPEG and GIF image formats are popular contemporarily, this paper shows that the prospect of chaotic image encryption is promising.
An Integrated Fuzzy Approach for the Evaluation of Supply Chain Risk Mitigation Strategies  [PDF]
Xiaojun Wang
Open Journal of Social Sciences (JSS) , 2014, DOI: 10.4236/jss.2014.29028

Competing in an increasingly uncertain business environment, organizations need to mitigate its supply chain risks to enhance their resiliency. However, it is important to implement appropriate strategies to meet business needs. This paper presents a novel approach that integrates fuzzy risk assessment and fuzzy Delphi for the evaluation of strategies in order to mitigate supply chain risks. The novelty of the model lies in the fact that an analytical tool enables the specific business preferences concerning supply chain risks to be taken into consideration in making the strategic decisions. It provides a practical solution by which companies can systematically assess the risks involved in the supply chain and select appropriate strategies to address them.

Memory Suggestibility under Social Pressure and Inhibitory Control in Preschoolers  [PDF]
Xiaojun Cao
Journal of Behavioral and Brain Science (JBBS) , 2015, DOI: 10.4236/jbbs.2015.54012
Abstract: The current study examined the interaction of inhibitory control and social pressure on young children’s memory suggestibility. Children were administered the Video Memory Suggestibility Scale for Children (VMSSC) and batteries of inhibitory control tasks, and were exposed to different levels of situational social pressures during interviews for memory suggestibility. The findings indicated that inhibitory control played a significantly moderating role in the relationship between social pressure and memory suggestibility. The greater the inhibitory control, the lower the effects of social pressure on the memory suggestibility of children. For the children with lower levels of inhibitory control, the social pressure positively predicted memory suggestibility; but for the children with higher levels of inhibitory control, the social pressure didn’t significantly predict memory suggestibility. So, to a certain extent, memory suggestibility may be a dynamic integration of stable trait and fluctuating state elements. The implications for the essence of memory suggestibility were discussed.
Simulation of Multiphase Flow of the Oil-Water Separation in a Rotating Packed Bed for Oil Purification
Xiaojun Zhang,Yun Cheng,Songlin Nie,Hui Ji
Mathematical Problems in Engineering , 2013, DOI: 10.1155/2013/404327
Low-Complexity Scheduling Policies for Achieving Throughput and Asymptotic Delay Optimality in Multi-Channel Wireless Networks
Bo Ji,Gagan R. Gupta,Xiaojun Lin,Ness B. Shroff
Computer Science , 2013,
Abstract: In this paper, we study the scheduling problem for downlink transmission in a multi-channel (e.g., OFDM-based) wireless network. We focus on a single cell, with the aim of developing a unifying framework for designing low-complexity scheduling policies that can provide optimal performance in terms of both throughput and delay. We develop new easy-to-verify sufficient conditions for rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in general non-asymptotic setting), respectively. The sufficient conditions allow us to prove rate-function delay optimality for a class of Oldest Packets First (OPF) policies and throughput optimality for a large class of Maximum Weight in the Fluid limit (MWF) policies, respectively. By exploiting the special features of our carefully chosen sufficient conditions and intelligently combining policies from the classes of OPF and MWF policies, we design hybrid policies that are both rate-function delay-optimal and throughput-optimal with a complexity of $O(n^{2.5} \log n)$, where $n$ is the number of channels or users. Our sufficient condition is also used to show that a previously proposed policy called Delay Weighted Matching (DWM) is rate-function delay-optimal. However, DWM incurs a high complexity of $O(n^5)$. Thus, our approach yields significantly lower complexity than the only previously designed delay and throughput optimal scheduling policy. We also conduct numerical experiments to validate our theoretical results.
Page 1 /16061
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.