arXiv subjects

Yu Zhang

Publications and source records attributed to Yu Zhang.

At least 1,675 records · Page 93Linked to original sources

arXiv2013

Double-core Excitations in Formamide Can Be Probed by X-ray Double-quantum-coherence Spectroscopy

The attosecond, time-resolved X-ray double-quantum-coherence (XDQC) four wave mixing signals of formamide at the nitrogen and oxygen K-edges are simulated using restricted excitation window time-dependent density functional theory (REW-TDDFT) and the excited core hole (XCH) approximation. These signals, induced by core exciton coupling, are particularly sensitive to the level of treatment of electron correlation, thus providing direct experimental signatures of electron core hole many-body effects and a test of electronic structure theories.

physics.atom-ph↗

arXiv2013

Multidimensional X-Ray Spectroscopy of Valence and Core Excitations in Cysteine

Several nonlinear spectroscopy experiments which employ broadband x-ray pulses to probe the coupling between localized core and delocalized valence excitation are simulated for the amino acid cysteine at the K-edges of oxygen and nitrogen and the K and L-edges of sulfur. We focus on two dimensional (2D) and 3D signals generated by two- and three-pulse stimulated x-ray Raman spectroscopy (SXRS) with frequency-dispersed probe. We show how the four-pulse x-ray signals $\boldsymbol{k}_\mathrm{I}=-\boldsymbol{k}_1+\boldsymbol{k}_2+\boldsymbol{k}_3$ and $\boldsymbol{k}_\mathrm{II}=\boldsymbol{k}_1-\boldsymbol{k}_2+\boldsymbol{k}_3$ can give new 3D insight into the SXRS signals. The coupling between valence- and core-excited states can be visualized in three dimensional plots, revealing the origin of the polarizability that controls the simpler pump-probe SXRS signals.

physics.chem-ph↗

arXiv2013

Parallel D2-Clustering: Large-Scale Clustering of Discrete Distributions

The discrete distribution clustering algorithm, namely D2-clustering, has demonstrated its usefulness in image classification and annotation where each object is represented by a bag of weighed vectors. The high computational complexity of the algorithm, however, limits its applications to large-scale problems. We present a parallel D2-clustering algorithm with substantially improved scalability. A hierarchical structure for parallel computing is devised to achieve a balance between the individual-node computation and the integration process of the algorithm. Additionally, it is shown that even with a single CPU, the hierarchical structure results in significant speed-up. Experiments on real-world large-scale image data, Youtube video data, and protein sequence data demonstrate the efficiency and wide applicability of the parallel D2-clustering algorithm. The loss in clustering accuracy is minor in comparison with the original sequential algorithm.

cs.LG↗

arXiv2012

The Buffered π-Calculus: A Model for Concurrent Languages

Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered $π$-calculus --- a variant of the $π$-calculus where channel names are classified into buffered and unbuffered: communication along buffered channels is asynchronous, and remains synchronous along unbuffered channels. We show that the buffered $π$-calculus can be fully simulated in the polyadic $π$-calculus with respect to strong bisimulation. In contrast to the $π$-calculus which is hard to use in practice, the new language enables easy and clear modeling of practical concurrent languages. We encode two real-world concurrent languages in the buffered $π$-calculus: the (core) Go language and the (Core) Erlang. Both encodings are fully abstract with respect to weak bisimulations.

cs.LO↗

arXiv2012

Designing Rating Systems to Promote Mutual Security for Interconnected Networks

Interconnected autonomous systems often share security risks. However, an autonomous system lacks the incentive to make (sufficient) security investments if the cost exceeds its own benefit even though doing that would be socially beneficial. In this paper, we develop a systematic and rigorous framework for analyzing and significantly improving the mutual security of a collection of ASs that interact frequently over a long period of time. Using this framework, we show that simple incentive schemes based on rating systems can be designed to encourage the autonomous systems' security investments, thereby significantly improving their mutual security.

cs.GT↗

arXiv2012

Distributed Optimal Beamformers for Cognitive Radios Robust to Channel Uncertainties

Through spatial multiplexing and diversity, multi-input multi-output (MIMO) cognitive radio (CR) networks can markedly increase transmission rates and reliability, while controlling the interference inflicted to peer nodes and primary users (PUs) via beamforming. The present paper optimizes the design of transmit- and receive-beamformers for ad hoc CR networks when CR-to-CR channels are known, but CR-to-PU channels cannot be estimated accurately. Capitalizing on a norm-bounded channel uncertainty model, the optimal beamforming design is formulated to minimize the overall mean-square error (MSE) from all data streams, while enforcing protection of the PU system when the CR-to-PU channels are uncertain. Even though the resultant optimization problem is non-convex, algorithms with provable convergence to stationary points are developed by resorting to block coordinate ascent iterations, along with suitable convex approximation techniques. Enticingly, the novel schemes also lend themselves naturally to distributed implementations. Numerical tests are reported to corroborate the analytical findings.

cs.IT↗

arXiv2012

The Evolution and Star Formation History of M33

We construct a parameterized model to explore the main properties of the star formation history of M33. We assume that the disk originates and grows by the primordial gas infall and adopt the simple form of gas accretion rate with one free parameter, the infall time-scale. We also include the contribution of gas outflow process. A major update of the model is that we adopt a molecular hydrogen correlated star formation law and calculate the evolution of the atomic and molecular gas separately. Comparisons between the model predictions and the observational data show that the model predictions are very sensitive to the adopted infall time-scale, while the gas outflow process mainly influences the metallicity profile. The model adopting a moderate outflow rate and an inside-out formation scenario can be in good agreement with most of observed constraints of M33 disk. We also compare the model predictions based on the molecular hydrogen correlated star formation law and that based on the Kennicutt star formation law. Our results imply that the molecular hydrogen correlated star formation law should be preferred to describe the evolution of the M33 disk, especially the radial distributions of both the cold gas and the stellar population.

astro-ph.CO↗

arXiv2012

Two-Dimensional Stimulated Resonance Raman Spectroscopy of Molecules with Broadband X-ray Pulses

Expressions for the two-dimensional Stimulated x-ray Raman Spectroscopy (2D-SXRS) signal obtained using attosecond x-ray pulses are derived. The 1D- and 2D-SXRS signals are calculated for trans-N-methyl acetamide (NMA) with broad bandwidth (FWHM ~14.2eV, 181 as) pulses tuned to the oxygen and nitrogen K-edges. Crosspeaks in 2D signals reveal electronic Franck-Condon overlaps between valence orbitals and relaxed orbitals in the presence of the core hole.

physics.chem-ph↗

arXiv2012

Global well-posedness of periodic KP-I initial value problem in the energy space

The periodic KP-I initial value problem $\partial_t u+\partial_x^3 u-\partial_x^{-1}\partial_y^2 u+\partial_x (u^2/2)=0$ on $T_{x,y}^2\times R_t, $u(0)=ϕ$ is globally well-posed in the energy space $E^1 = E^1 (T^2)=ϕ: T^2\to R:\hatϕ(0,n)=0$ for all $n\in Z \ 0$ and $||ϕ||_{E^1 (T^2)}=||\hatϕ(m,n)(1+|m|+|n/m|)||_{l^2(Z^2)}<\infty$.

math.AP↗

arXiv2012

Determining gravitational wave radiation from close galaxy pairs using a binary population synthesis approach

Context. The early phase of the coalescence of supermassive black hole (SMBH) binaries from their host galaxies provides a guaranteed source of low-frequency (nHz-$μ$Hz) gravitational wave (GW) radiation by pulsar timing observations. These types of GW sources would survive the coalescing and be potentially identifiable. Aims. We aim to provide an outline of a new method for detecting GW radiation from individual SMBH systems based on the Sloan Digital Sky Survey (SDSS) observational results, which can be verified by future observations. Methods. Combining the sensitivity of the international Pulsar Timing Array (PTA) and the Square Kilometer Array (SKA) detectors, we used a binary population synthesis (BPS) approach to determine GW radiation from close galaxy pairs under the assumption that SMBHs formed at the core of merged galaxies. We also performed second post-Newtonian approximation methods to estimate the variation of the strain amplitude with time. Results. We find that the value of the strain amplitude \emph{h} varies from about $10^{-14}$ to $10^{-17}$ using the observations of 20 years, and we estimate that about 100 SMBH sources can be detected with the SKA detector.

astro-ph.GA↗

arXiv2012

Breaking a novel colour image encryption algorithm based on chaos

Recently, a colour image encryption algorithm based on chaos was proposed by cascading two position permutation operations and one substitution operation, which are all determined by some pseudo-random number sequences generated by iterating the Logistic map. This paper evaluates the security level of the encryption algorithm and finds that the position permutation-only part and the substitution part can be separately broken with only $\lceil (\log_2(3MN))/8 \rceil$ and 2 chosen plain-images, respectively, where $MN$ is the size of the plain-image. Concise theoretical analyses are provided to support the chosen-plaintext attack, which are verified by experimental results also.

cs.CR↗

arXiv2012

Multi-Domain Collaborative Filtering

Collaborative filtering is an effective recommendation approach in which the preference of a user on an item is predicted based on the preferences of other users with similar interests. A big challenge in using collaborative filtering methods is the data sparsity problem which often arises because each user typically only rates very few items and hence the rating matrix is extremely sparse. In this paper, we address this problem by considering multiple collaborative filtering tasks in different domains simultaneously and exploiting the relationships between domains. We refer to it as a multi-domain collaborative filtering (MCF) problem. To solve the MCF problem, we propose a probabilistic framework which uses probabilistic matrix factorization to model the rating problem in each domain and allows the knowledge to be adaptively transferred across different domains by automatically learning the correlation between domains. We also introduce the link function for different domains to correct their biases. Experiments conducted on several real-world applications demonstrate the effectiveness of our methods when compared with some representative methods.

cs.IR↗

arXiv2012

A Convex Formulation for Learning Task Relationships in Multi-Task Learning

Multi-task learning is a learning paradigm which seeks to improve the generalization performance of a learning task with the help of some other related tasks. In this paper, we propose a regularization formulation for learning the relationships between tasks in multi-task learning. This formulation can be viewed as a novel generalization of the regularization framework for single-task learning. Besides modeling positive task correlation, our method, called multi-task relationship learning (MTRL), can also describe negative task correlation and identify outlier tasks based on the same underlying principle. Under this regularization framework, the objective function of MTRL is convex. For efficiency, we use an alternating method to learn the optimal model parameters for each task as well as the relationships between tasks. We study MTRL in the symmetric multi-task learning setting and then generalize it to the asymmetric setting as well. We also study the relationships between MTRL and some existing multi-task learning methods. Experiments conducted on a toy problem as well as several benchmark data sets demonstrate the effectiveness of MTRL.

cs.LG↗

arXiv2011

Testing three derivative methods of stellar population synthesis models

The number of methods used to study the properties of galaxies is increased, and testing these methods is very important. Galactic globular clusters (GCs) provide an excellent medium for such test, because they can be considered as simple stellar populations. We present ages and metallicities for 40 Galactic GCs as determined from three publicly available techniques, including colour, Lick-index and spectrum-fitting methods, based on Bruzual & Charlot evolutionary population synthesis (EPS) models. By comparing with the ages obtained from colour-magnitude diagrams (CMDs) and metallicities obtained from spectra of stars, we are able to estimate the ability of 'these methods on determination of GCs parameters, which is absolutely necessary. As a result, we find that: (i) for the metallicity, our derived metallicities agree with those derived from the spectra of stars, Lick-index method is suitable to study metallicity for the stellar population systems in the range of -1.5=<[Fe/H]=<-0.7 and spectrum- fitting method is suitable to study metallicity for the stellar population systems in the range of -2.3=<[Fe/H]=<-1.5; (ii) for the age, these three methods have difficulties in age determination, our derived ages are smaller (about 2.0 Gyr, on average) than the results of CMDs for all these three methods. We use Vazdekis and Maraston models to analyze whether our results are dependent on EPS models, and find that the tendency of these two models is the same as that of Bruzual & Charlot models. Our results are independent of the EPS models. In addition, our test is based on the old GCs and our conclusions may hold for old stellar population systems. The whole abstract can be found in my PDF version.

astro-ph.GA↗

arXiv2011

Cryptanalyzing a chaos-based image encryption algorithm using alternate structure

Recently, a chaos-based image encryption algorithm using alternate structure (IEAS) was proposed. This paper focuses on differential cryptanalysis of the algorithm and finds that some properties of IEAS can support a differential attack to recover equivalent secret key with a little small number of known plain-images. Detailed approaches of the cryptanalysis for cryptanalyzing IEAS of the lower round number are presented and the breaking method can be extended to the case of higher round number. Both theoretical analysis and experiment results are provided to support vulnerability of IEAS against differential attack. In addition, some other security defects of IEAS, including insensitivity with respect to changes of plain-images and insufficient size of key space, are also reported.

cs.CR↗

arXiv2011

Block-based Bayesian epistasis association mapping with application to WTCCC type 1 diabetes data

Interactions among multiple genes across the genome may contribute to the risks of many complex human diseases. Whole-genome single nucleotide polymorphisms (SNPs) data collected for many thousands of SNP markers from thousands of individuals under the case--control design promise to shed light on our understanding of such interactions. However, nearby SNPs are highly correlated due to linkage disequilibrium (LD) and the number of possible interactions is too large for exhaustive evaluation. We propose a novel Bayesian method for simultaneously partitioning SNPs into LD-blocks and selecting SNPs within blocks that are associated with the disease, either individually or interactively with other SNPs. When applied to homogeneous population data, the method gives posterior probabilities for LD-block boundaries, which not only result in accurate block partitions of SNPs, but also provide measures of partition uncertainty. When applied to case--control data for association mapping, the method implicitly filters out SNP associations created merely by LD with disease loci within the same blocks. Simulation study showed that this approach is more powerful in detecting multi-locus associations than other methods we tested, including one of ours. When applied to the WTCCC type 1 diabetes data, the method identified many previously known T1D associated genes, including PTPN22, CTLA4, MHC, and IL2RA.

stat.AP↗

arXiv2011

Density Functional Theory for Fractional Particle Number: Derivative Discontinuity of the Energy at the Maximum Number of Bound Electrons

The derivative discontinuity in the exact exchange-correlation potential of ensemble Density Functional Theory (DFT) is investigated at the specific integer number that corresponds to the maximum number of bound electrons, $J_{max}$. A recently developed complex-scaled analog of DFT is extended to fractional particle numbers and used to study ensembles of both bound and metastable states. It is found that the exact exchange-correlation potential experiences discontinuous jumps at integer particle numbers including $J_{max}$. For integers below $J_{max}$ the jump is purely real because of the real shift in the chemical potential. At $J_{max}$, the jump has a non-zero imaginary component reflecting the finite lifetime of the $(J_{max}+1)$ state.

quant-ph↗

arXiv2011

Breaking a chaotic image encryption algorithm based on perceptron model

Recently, a chaotic image encryption algorithm based on perceptron model was proposed. The present paper analyzes security of the algorithm and finds that the equivalent secret key can be reconstructed with only one pair of known-plaintext/ciphertext, which is supported by both mathematical proof and experiment results. In addition, some other security defects are also reported.

cs.CR↗