Abstract:
The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay and long-range connection (LRC) probability have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs.

Abstract:
The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the optimal results for these maximization problems. Three topics are addressed. First, we consider the case where the channel output is quantized, and we find the quantization thresholds that maximize the mutual information. The approximation derived from the asymptotic solution has a negligible loss on the entire range of SNR when 2-PAM modulation is used, and its quantization thresholds linearly depend on the standard deviation of noise. We also derive a simple estimator of the relative capacity loss due to quantization, based on the high-rate limit. Then we consider the integer constraint on the decoding metric, and maximize the mismatched channel capacity. We study the asymptotic solution of the optimal metric assignment and show that the same approximation we derived in the matched decoding case still holds for the mismatched decoder. Finally, we consider the demodulation problem for 8PSK bit-interleaved coded modulation(BICM). We derive the approximated optimal demodulation metrics that maximize the general cut-off rate or the mismatched capacity using max-log approximation . The error rate performances of the two metrics' assignments are compared, based on Reed-Solomon-Viterbi(RSV) code, and the mismatched capacity metric turns out to be better. The proposed approximation can be computed using an efficient firmware algorithm, and improves the system performance of commercial chips.

Abstract:
GARCH (Generalized Auto-Regressive Conditional Heteroskedasticity) model proposed by Professor Engle is successful to analyze the volatility of stock price. In this paper GARCH model is used to analyze the volatility of web news events and public attitudes by the data coming from typical news events in famous web. The results show that the volatility of web news events and public attitudes are suitable to GARCH model by some adjusting and test of parameters.

Abstract:
Prospect theory believes that value
judgments of decision-makers are associated with reference point. Based on this
intuition, this paper analyzes the impacts of reference point as well as its
change on individual value with two risk selection experiments, which are at
the same wealth level but have different reference points. Experiments find
that reference point has significant influences on value function and decision
weight at the same wealth level. Moreover, via the value function diagram, we
find that the value of a certain wealth level rising from a relatively low
reference point is higher than the value of the same wealth level declining
from a relatively high reference point which initially is raised from the lower
reference one. Intuitively, it also explains that the changes of the reference
point will lead to a decline in the overall value of decision-maker.

Abstract:
Private education is a major component of China’s socialism education causes. The Chinese government pays high attention to private education and increase steady investment in it. This paper analyzes the reform and the development of private education in the dimensions of system design, actual effect and policy-making suggestions based on the research on the comprehensive reform of private education in X city.

Abstract:
This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem (LCP) based on the Mizuno-Todd-Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain which is similar to the classical Mizuno-Todd-Ye algorithm. Finally, the numerical experiments show that our algorithm improved the performance of the classical MTY algorithm. 1. Introduction Since Karmarkar published the first paper on interior point method [1] in 1984, the interior point methodologies have yielded rich theories and algorithms in the fields of linear programming (LP), quadratic programming (QP), and linear complementarity problems (LCP). Among these interior point methods, predictor-corrector interior-point methods play a special role due to their best polynomial complexity and superlinear convergence. In 1993, Mizuno et al. [2] proposed the classical representative of predictor-corrector method for linear programming. The Mizuno-Todd-Ye (MTY) algorithm has -iteration complexity which is the best iteration complexity obtained so far for all the interior-point method [3, 4]. Moreover, Ye et al. [5] proved the duality gap of classical MTY algorithm converges to zero quadratically, which dedicated that MTY algorithm has superlinear convergence. The classical MTY algorithm is the first algorithm for LP has both polynomial complexity and superlinear convergence. So the classical MTY algorithm therefore was considered as the most efficient interior point methods for LP. Afterwards, the MTY algorithm was extended to LCP [6, 7] for its excellent performance. In recent papers, Potra [8, 9] presented several predictor-corrector methods for linear complementarity problems acting in a wide neighborhood of the central path, and Stoer et al. [10] proposed a predictor-corrector algorithm with arbitrarily high order of convergence to degenerate sufficient linear complementarity problems. Subsequently, Potra proposed a generalization of the MTY algorithm for infeasible starting points for monotone LCP [11]. Based on the so-called “fast step-safe step” strategy, Wright proposed an infeasible interior point method with polynomial and quadratic convergence for nondegenerate LCP [12]. And Ai and Zhang presented an -iteration primal-dual path-following method for monotone LCP based on

Abstract:
We analyze the magnetic moment of gluon, find if QCD is nongauge SU(3) theory then the magnetic moment of gluon varnishes, but if QCD is gauge theory then the magnetic moment of gluon will not vanishes. The magnetic moment of gluon can be measured by investigate the E-M decay of gluball.

Abstract:
We formulate the dynamics of local order parameters by extending the recently developed adiabatic spinwave theory involving the Berry curvature, and derive a formula showing explicitly the role of the Berry phase in determining the spectral form of the low-lying collective modes. For antiferromagnetic spin chains, the Berry phase becomes a topological invariant known as the Chern number. Our theory predicts the existence of the Haldane gap for a topologically trivial ground state, and a linear dispersion of low-lying excitations for a non-trivial ground state.

Abstract:
We study the transport of an overdamped particle adiabatically driven by an asymmetric potential which is periodic in both space and time. We develop an adiabatic perturbation theory after transforming the Fokker-Planck equation into a time-dependent hermitian problem, and reveal an analogy with quantum adiabatic particle transport. An analytical expression is obtained for the ensemble average of the particle velocity in terms of the Berry phase of the Bloch states. Its time average is shown to be quantized as a Chern number in the deterministic or tight-binding limit, with exponentially small corrections. In the opposite limit, where the thermal energy dominates the ratchet potential, a formula for the average velocity is also obtained, showing a second order dependence on the potential.

Abstract:
At first we give a little formalism to show some features of spontaneous CP violation theory. Then we give a convincing argument show that Cronin etc's experiment is a evidence of CPT violation and spontaneous CP violation is absolutely necessary. Final we discuss some possible CPT violation mechanism.